| Publication | Date of Publication | Type |
|---|
| Selecting intervals to optimize the design of observational studies subject to fine balance constraints | 2024-04-10 | Paper |
| Algorithms and Complexities of Matching Variants in Covariate Balancing | 2024-03-12 | Paper |
| EPTAS for parallel identical machine scheduling with time restrictions | 2024-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090878 | 2023-11-20 | Paper |
| EPTAS for the dual of splittable bin packing with cardinality constraint | 2023-10-26 | Paper |
| Online minimization of the maximum starting time: migration helps | 2023-08-17 | Paper |
| EPTAS for load balancing problem on parallel machines with a non-renewable resource | 2023-06-30 | Paper |
| High-multiplicity \(N\)-fold IP via configuration LP | 2023-05-25 | Paper |
| Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times | 2023-05-16 | Paper |
| Online bin covering with limited migration | 2023-03-10 | Paper |
| Comparing the costs of any fit algorithms for bin packing | 2022-12-12 | Paper |
| EPTAS for load balancing problem on parallel machines with a non-renewable resource | 2022-10-19 | Paper |
| Approximate separable multichoice optimization over monotone systems | 2022-06-09 | Paper |
| Online Bin Covering with Limited Migration | 2022-05-11 | Paper |
| Lower bounds for batched bin packing | 2022-04-13 | Paper |
| Approximation schemes for the generalized extensible bin packing problem | 2022-03-25 | Paper |
| Parameterized complexity of configuration integer programs | 2022-03-11 | Paper |
| The near exact bin covering problem | 2022-02-22 | Paper |
| More on ordered open end bin packing | 2022-01-14 | Paper |
| Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes | 2021-12-14 | Paper |
| Complexity, algorithms and applications of the integer network flow with fractional supplies problem | 2021-12-13 | Paper |
| Starting time minimization for the maximum job variant | 2021-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009562 | 2021-08-04 | Paper |
| A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs | 2021-07-28 | Paper |
| A new lower bound for classic online bin packing | 2021-06-30 | Paper |
| A note on a variant of the online open end bin packing problem | 2021-04-07 | Paper |
| A new lower bound for classic online bin packing | 2020-08-24 | Paper |
| Online bin packing with cardinality constraints resolved | 2020-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111695 | 2020-05-27 | Paper |
| Lower bounds for online bin covering-type problems | 2020-03-06 | Paper |
| Hypergraphic Degree Sequences are Hard | 2020-01-13 | Paper |
| Lower bounds for several online variants of bin packing | 2019-12-19 | Paper |
| Robust algorithms for total completion time | 2019-11-28 | Paper |
| The benefit of preemption with respect to the \(\ell_p\) norm | 2019-06-11 | Paper |
| A unified framework for designing EPTAS for load balancing on parallel machines | 2019-05-21 | Paper |
| Deadline TSP | 2019-05-17 | Paper |
| A Unified Approach to Truthful Scheduling on Related Machines | 2019-05-15 | Paper |
| The benefit of preemption for single machine scheduling so as to minimize total weighted completion time | 2019-01-15 | Paper |
| Batch coloring of graphs | 2019-01-11 | Paper |
| On the performance guarantee of first fit for sum coloring | 2018-12-10 | Paper |
| Online-bounded analysis | 2018-11-07 | Paper |
| A unified framework for designing EPTAS's for load balancing on parallel machines | 2018-09-06 | Paper |
| Optimization over Degree Sequences | 2018-08-10 | Paper |
| Min-sum bin packing | 2018-07-20 | Paper |
| Deadline TSP | 2018-06-22 | Paper |
| Lower bounds for several online variants of bin packing | 2018-06-22 | Paper |
| Weighted matching with pair restrictions | 2018-05-28 | Paper |
| Min-max cover of a graph with a small number of parts | 2018-05-24 | Paper |
| Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem | 2018-04-13 | Paper |
| Discounted reward TSP | 2018-04-06 | Paper |
| Improved bounds for randomized preemptive online matching | 2018-03-21 | Paper |
| Shifted matroid optimization | 2018-02-06 | Paper |
| Maximum coverage problem with group budget constraints | 2017-11-16 | Paper |
| A new and improved algorithm for online bin packing | 2017-07-06 | Paper |
| Batch Coloring of Graphs | 2017-04-04 | Paper |
| On nonlinear multi-covering problems | 2017-02-22 | Paper |
| Improved Bounds for Online Preemptive Matching | 2017-01-30 | Paper |
| Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines | 2017-01-27 | Paper |
| An AFPTAS for variable sized bin packing with general activation costs | 2016-11-14 | Paper |
| Online Bounded Analysis | 2016-07-25 | Paper |
| Nonoblivious 2-Opt heuristics for the traveling salesman problem | 2016-06-10 | Paper |
| A Unified Approach to Truthful Scheduling on Related Machines | 2016-04-15 | Paper |
| Vertex cover meets scheduling | 2016-04-06 | Paper |
| The (weighted) metric dimension of graphs: hard and easy cases | 2015-09-02 | Paper |
| The minimum generalized vertex cover problem | 2015-09-02 | Paper |
| Offline black and white bin packing | 2015-07-24 | Paper |
| Online file caching with rejection penalties | 2015-05-26 | Paper |
| Finding mobile data under delay constraints with searching costs | 2015-03-02 | Paper |
| Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees | 2015-01-21 | Paper |
| Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems | 2014-12-05 | Paper |
| The benefit of adaptivity in stochastic packing problems with probing | 2014-12-02 | Paper |
| Robust algorithms for preemptive scheduling | 2014-11-19 | Paper |
| A generalized minimum cost \(k\)-clustering | 2014-11-18 | Paper |
| An efficient polynomial time approximation scheme for load balancing on uniformly related machines | 2014-10-17 | Paper |
| Bin covering with cardinality constraints | 2014-04-22 | Paper |
| The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature | 2014-04-15 | Paper |
| Adaptivity in the stochastic blackjack knapsack problem | 2013-12-13 | Paper |
| Robust Approximation Schemes for Cube Packing | 2013-09-25 | Paper |
| Online clustering with variable sized clusters | 2013-03-05 | Paper |
| On the max coloring problem | 2012-11-27 | Paper |
| The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases | 2012-11-06 | Paper |
| Universal Sequencing on an Unreliable Machine | 2012-09-12 | Paper |
| Online variable-sized bin packing with conflicts | 2012-06-20 | Paper |
| Bin packing with general cost structures | 2012-04-27 | Paper |
| Approximation schemes for packing splittable items with cardinality constraints | 2012-04-26 | Paper |
| On equilibria for ADM minimization games | 2012-04-26 | Paper |
| Selfish bin coloring | 2012-04-04 | Paper |
| Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model | 2012-03-15 | Paper |
| Max-min Online Allocations with a Reordering Buffer | 2012-03-15 | Paper |
| Randomized algorithms for online bounded bidding | 2012-03-12 | Paper |
| IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * | 2012-01-23 | Paper |
| Robust Algorithms for Preemptive Scheduling | 2011-09-16 | Paper |
| On Variants of File Caching | 2011-07-06 | Paper |
| Monotone Covering Problems with an Additional Covering Constraint | 2011-04-27 | Paper |
| Graph coloring with rejection | 2011-03-28 | Paper |
| AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items | 2011-03-21 | Paper |
| Uniform unweighted set cover: the power of non-oblivious local search | 2011-03-14 | Paper |
| How to allocate review tasks for robust ranking | 2010-10-08 | Paper |
| Max-min Online Allocations with a Reordering Buffer | 2010-09-07 | Paper |
| Online Clustering with Variable Sized Clusters | 2010-09-03 | Paper |
| On the sum minimization version of the online bin covering problem | 2010-08-13 | Paper |
| Class constrained bin packing revisited | 2010-08-11 | Paper |
| Improved randomized results for the interval selection problem | 2010-08-11 | Paper |
| Universal Sequencing on a Single Machine | 2010-06-22 | Paper |
| Asymptotic fully polynomial approximation schemes for variants of open-end bin packing | 2010-06-09 | Paper |
| Tight results for next fit and worst fit with resource augmentation | 2010-06-07 | Paper |
| Online Capacitated Interval Coloring | 2010-06-01 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Class constrained bin covering | 2010-05-10 | Paper |
| Minimization of SONET ADMs in ring networks revisited | 2010-04-12 | Paper |
| The finite horizon investor problem with a budget constraint | 2010-03-24 | Paper |
| Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search | 2010-03-17 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Real time scheduling with a budget: parametric-search is better than binary search | 2010-01-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| On Equilibria for ADM Minimization Games | 2009-12-01 | Paper |
| Covering the edges of bipartite graphs using \(K_{2,2}\) graphs | 2009-12-01 | Paper |
| Weighted sum coloring in batch scheduling of conflicting jobs | 2009-10-23 | Paper |
| On Bin Packing with Conflicts | 2009-08-20 | Paper |
| The multi‐integer set cover and the facility terminal cover problem | 2009-07-28 | Paper |
| Variable sized online interval coloring with bandwidth | 2009-06-17 | Paper |
| The computational complexity of graph contractions II: Two tough polynomially solvable cases | 2009-06-16 | Paper |
| Approximation algorithms for maximum latency and partial cycle cover | 2009-05-07 | Paper |
| A robust APTAS for the classical bin packing problem | 2009-04-24 | Paper |
| Scheduling a maintenance activity on parallel identical machines | 2009-04-22 | Paper |
| An APTAS for Generalized Cost Variable-Sized Bin Packing | 2009-03-16 | Paper |
| A Robust APTAS for the Classical Bin Packing Problem | 2009-03-12 | Paper |
| Better bounds for minimizing SONET ADMs | 2009-03-11 | Paper |
| Online Capacitated Interval Coloring | 2009-03-03 | Paper |
| Improved Randomized Results for That Interval Selection Problem | 2008-11-25 | Paper |
| More on online bin packing with two item sizes | 2008-11-19 | Paper |
| Online unit clustering: Variations on a theme | 2008-11-18 | Paper |
| A Faster, Better Approximation Algorithm for the Minimum Latency Problem | 2008-10-28 | Paper |
| The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases | 2008-06-20 | Paper |
| Two-dimensional packing with conflicts | 2008-06-17 | Paper |
| A PTAS for delay minimization in establishing wireless conference calls | 2008-05-16 | Paper |
| Approximation algorithm for minimizing total latency in machine scheduling with deliveries | 2008-05-16 | Paper |
| Graph Coloring with Rejection | 2008-03-11 | Paper |
| Multi-dimensional Packing with Conflicts | 2008-02-26 | Paper |
| On Bin Packing with Conflicts | 2008-02-21 | Paper |
| The k-Allocation Problem and Its Variants | 2008-02-21 | Paper |
| Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search | 2008-02-21 | Paper |
| Covering the Edges of Bipartite Graphs Using K 2,2 Graphs | 2008-02-20 | Paper |
| On the Max Coloring Problem | 2008-02-20 | Paper |
| Minimum Weighted Sum Bin Packing | 2008-02-20 | Paper |
| SONET ADMs minimization with divisible paths | 2007-11-28 | Paper |
| Variable Sized Online Interval Coloring with Bandwidth | 2007-09-07 | Paper |
| Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs | 2007-08-28 | Paper |
| Optimizing over Consecutive 1's and Circular 1's Constraints | 2007-05-22 | Paper |
| Flow trees for vertex-capacitated networks | 2007-03-08 | Paper |
| Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms | 2007-02-20 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Partial multicuts in trees | 2007-01-09 | Paper |
| Approximations for minimum and min-max vehicle routing problems | 2006-10-05 | Paper |
| The conference call search problem in wireless networks | 2006-09-14 | Paper |
| The constrained minimum weighted sum of job completion times problem | 2006-06-28 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| The chord version for SONET ADMs minimization | 2006-03-20 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Synthesis of 2-Commodity Flow Networks | 2005-11-11 | Paper |
| A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem | 2005-10-28 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection | 2005-02-21 | Paper |
| Approximation algorithms for quickest spanning tree problems | 2005-02-21 | Paper |
| Approximating the degree-bounded minimum diameter spanning tree problem | 2005-02-21 | Paper |
| A better approximation algorithm for the budget prize collecting tree problem. | 2005-01-11 | Paper |
| Strongly polynomial-time approximation for a class of bicriteria problems. | 2005-01-11 | Paper |
| Minimum spanning tree with hop restrictions | 2004-03-14 | Paper |
| Minimum restricted diameter spanning trees. | 2004-03-14 | Paper |
| Lexicographic local search and the \(p\)-center problem. | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411286 | 2003-07-07 | Paper |
| The SONET edge‐partition problem | 2003-03-10 | Paper |
| Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs | 2003-03-09 | Paper |
| Approximation algorithms for constructing wavelength routing networks | 2002-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537746 | 2002-06-20 | Paper |
