| Publication | Date of Publication | Type |
|---|
| On Integer Programming, Discrepancy, and Convolution | 2024-02-27 | Paper |
| A rainbow about T-colorings for complete graphs | 2024-01-05 | Paper |
| Rankings of graphs | 2024-01-05 | Paper |
| Peak demand minimization via sliced strip packing | 2023-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090895 | 2023-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084400 | 2023-10-31 | Paper |
| A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing | 2023-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075945 | 2023-09-20 | Paper |
| Solving cut-problems in quadratic time for graphs with bounded treewidth | 2023-08-14 | Paper |
| On the complexity of scheduling problems with a fixed number of parallel identical machines | 2023-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168454 | 2023-08-08 | Paper |
| The double exponential runtime is tight for 2-stage stochastic ILPs | 2023-03-14 | Paper |
| Online bin covering with limited migration | 2023-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874275 | 2023-02-07 | Paper |
| An approximation scheme for bin packing with conflicts | 2022-12-09 | Paper |
| Empowering the configuration-IP: new PTAS results for scheduling with setup times | 2022-10-24 | Paper |
| Exact polynomial time algorithm for the response time analysis of harmonic tasks | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091233 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091234 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090420 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090421 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075753 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075807 | 2022-05-11 | Paper |
| Tightness of sensitivity and proximity bounds for integer linear programs | 2022-03-24 | Paper |
| Robust online algorithms for dynamic choosing problems | 2022-03-22 | Paper |
| The double exponential runtime is tight for 2-stage stochastic ILPs | 2021-12-21 | Paper |
| Approximation results for makespan minimization with budgeted uncertainty | 2021-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002616 | 2021-07-28 | Paper |
| An EPTAS for scheduling fork-join graphs with communication delay | 2021-03-09 | Paper |
| Closing the Gap for Makespan Scheduling via Sparsification Techniques | 2021-01-08 | Paper |
| About the Structure of the Integer Cone and Its Application to Bin Packing | 2021-01-08 | Paper |
| A Quasi-Polynomial Approximation for the Restricted Assignment Problem | 2020-12-04 | Paper |
| Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding | 2020-12-04 | Paper |
| Structural parameters for scheduling with assignment restrictions | 2020-10-21 | Paper |
| A note on the integrality gap of the configuration LP for restricted Santa Claus | 2020-10-07 | Paper |
| Robust online algorithms for certain dynamic packing problems | 2020-08-24 | Paper |
| Approximation results for makespan minimization with budgeted uncertainty | 2020-08-24 | Paper |
| Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing | 2020-07-20 | Paper |
| Complexity and inapproximability results for parallel task scheduling and strip packing | 2020-02-27 | Paper |
| Fully dynamic bin packing revisited | 2020-01-17 | Paper |
| Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times | 2019-11-25 | Paper |
| A Robust AFPTAS for Online Bin Packing with Polynomial Migration | 2019-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240426 | 2019-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240195 | 2019-10-24 | Paper |
| Improved approximation for two dimensional strip packing with polynomial bounded width | 2019-09-10 | Paper |
| An EPTAS for scheduling on unrelated machines of few different types | 2019-09-10 | Paper |
| On the optimality of approximation schemes for the classical scheduling problem | 2019-06-20 | Paper |
| New Approximability Results for Two-Dimensional Bin Packing | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633878 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633879 | 2019-05-06 | Paper |
| Complexity and inapproximability results for parallel task scheduling and strip packing | 2018-11-28 | Paper |
| A PTAS for Scheduling Unrelated Machines of Few Different Types | 2018-07-24 | Paper |
| Approximation schemes for machine scheduling with resource (in-)dependent processing times | 2018-07-16 | Paper |
| About the Structure of the Integer Cone and its Application to Bin Packing | 2018-07-16 | Paper |
| On the Configuration-LP of the Restricted Assignment Problem | 2018-07-16 | Paper |
| Constrained bipartite edge coloring with applications to wavelength routing | 2018-07-04 | Paper |
| Approximation results for the optimum cost chromatic partition problem | 2018-07-04 | Paper |
| On the optimality of exact and approximation algorithms for scheduling problems | 2018-06-06 | Paper |
| Estimating the makespan of the two-valued restricted assignment problem | 2018-05-23 | Paper |
| The many facets of upper domination | 2018-03-13 | Paper |
| Non-preemptive scheduling with setup times: a PTAS | 2018-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598212 | 2017-12-19 | Paper |
| A faster FPTAS for the unbounded knapsack problem | 2017-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369526 | 2017-10-17 | Paper |
| An EPTAS for scheduling on unrelated machines of few different types | 2017-09-22 | Paper |
| A quasi-polynomial approximation for the restricted assignment problem | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351895 | 2017-08-31 | Paper |
| Structural parameters for scheduling with assignment restrictions | 2017-07-21 | Paper |
| New Algorithmic Results for Bin Packing and Scheduling | 2017-07-21 | Paper |
| Improved approximation for two dimensional strip packing with polynomial bounded width | 2017-05-05 | Paper |
| Structured Instances of Restricted Assignment with Two Processing Times | 2017-04-07 | Paper |
| Scheduling parallel jobs on heterogeneous platforms | 2017-02-14 | Paper |
| An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints | 2017-02-01 | Paper |
| Algorithmic Aspects of Upper Domination: A Parameterised Perspective | 2016-11-09 | Paper |
| Upper Domination: Complexity and Approximation | 2016-09-29 | Paper |
| Makespan minimization in job shops | 2016-09-29 | Paper |
| Improved approximation schemes for scheduling unrelated parallel machines | 2016-09-29 | Paper |
| A faster FPTAS for the unbounded knapsack problem | 2016-04-04 | Paper |
| New approximability results for two-dimensional bin packing | 2016-03-23 | Paper |
| Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique | 2016-03-10 | Paper |
| A PTAS for Scheduling Unrelated Machines of Few Different Types | 2016-03-10 | Paper |
| Bounding the Running Time of Algorithms for Scheduling and Packing Problems | 2016-03-04 | Paper |
| Improved approximation algorithms for scheduling parallel jobs on identical clusters | 2015-09-16 | Paper |
| An approximation algorithm for scheduling malleable tasks under general precedence constraints | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501261 | 2015-08-03 | Paper |
| Preemptive scheduling with dedicated processors: applications of fractional graph coloring | 2015-01-22 | Paper |
| A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing | 2015-01-13 | Paper |
| Tight approximation algorithms for scheduling with fixed jobs and nonavailability | 2014-09-09 | Paper |
| TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING | 2014-07-04 | Paper |
| A \((5/3+\varepsilon)\)-approximation for strip packing | 2014-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867317 | 2013-12-11 | Paper |
| Bounding the Running Time of Algorithms for Scheduling and Packing Problems | 2013-08-12 | Paper |
| A Robust AFPTAS for Online Bin Packing with Polynomial Migration, | 2013-08-06 | Paper |
| An Improved Knapsack Solver for Column Generation | 2013-06-14 | Paper |
| A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption | 2013-03-28 | Paper |
| Trimming of Graphs, with Application to Point Labeling | 2013-03-19 | Paper |
| Bin packing with fixed number of bins revisited | 2013-02-21 | Paper |
| An Improved Approximation Scheme for Variable-Sized Bin Packing | 2012-09-25 | Paper |
| APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS | 2012-08-27 | Paper |
| Packing Squares with Profits | 2012-08-22 | Paper |
| Approximation Algorithms for Scheduling and Packing Problems | 2012-07-16 | Paper |
| Scheduling Jobs on Identical and Uniform Processors Revisited | 2012-07-16 | Paper |
| A Fast Approximation Scheme for the Multiple Knapsack Problem | 2012-06-15 | Paper |
| A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths | 2012-05-24 | Paper |
| Scheduling malleable tasks with precedence constraints | 2012-05-11 | Paper |
| Scheduling Jobs on Heterogeneous Platforms | 2011-08-17 | Paper |
| A (5/3 + ε)-Approximation for Strip Packing | 2011-08-12 | Paper |
| An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables | 2011-04-15 | Paper |
| Approximation Algorithms for Scheduling Parallel Jobs | 2011-04-04 | Paper |
| Approximating the Non-contiguous Multiple Organization Packing Problem | 2010-10-27 | Paper |
| Trimming of graphs, with application to point labeling | 2010-10-06 | Paper |
| Approximation algorithms for scheduling with reservations | 2010-09-16 | Paper |
| Parameterized Approximation Scheme for the Multiple Knapsack Problem | 2010-09-06 | Paper |
| On strip packing With rotations | 2010-08-16 | Paper |
| An asymptotic approximation algorithm for 3D-strip packing | 2010-08-16 | Paper |
| An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths | 2010-06-22 | Paper |
| Bin Packing with Fixed Number of Bins Revisited | 2010-06-22 | Paper |
| Approximation Algorithms for Multiple Strip Packing | 2010-05-11 | Paper |
| APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS | 2010-03-09 | Paper |
| A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability | 2009-12-17 | Paper |
| Two for One: Tight Approximation of 2D Bin Packing | 2009-10-20 | Paper |
| Rectangle packing with one-dimensional resource augmentation | 2009-08-19 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables | 2009-07-14 | Paper |
| A Survey on Approximation Algorithms for Scheduling with Machine Unavailability | 2009-07-09 | Paper |
| An Approximation Algorithm for the General Mixed Packing and Covering Problem | 2009-03-03 | Paper |
| New Approximability Results for 2-Dimensional Packing Problems | 2008-09-17 | Paper |
| Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 | 2008-08-28 | Paper |
| Grouping techniques for scheduling problems: simpler and faster | 2008-07-01 | Paper |
| Approximation Algorithms for Geometric Intersection Graphs | 2008-07-01 | Paper |
| A Polynomial Time Approximation Scheme for the Square Packing Problem | 2008-06-10 | Paper |
| Approximation algorithms for general packing problems and their application to the multicast congestion problem | 2008-06-03 | Paper |
| Approximative Algorithmen und Nichtapproximierbarkeit | 2008-05-20 | Paper |
| Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications | 2008-03-14 | Paper |
| Preemptive scheduling with dedicated processors: applications of fractional graph coloring | 2007-12-20 | Paper |
| Approximation Algorithms for 3D Orthogonal Knapsack | 2007-11-13 | Paper |
| Parallel Processing and Applied Mathematics | 2007-09-25 | Paper |
| Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem | 2007-09-14 | Paper |
| On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes | 2007-09-06 | Paper |
| The \(d\)-precoloring problem for \(k\)-degenerate graphs | 2007-06-26 | Paper |
| Faster and simpler approximation algorithms for mixed packing and covering problems | 2007-06-06 | Paper |
| Approximation Algorithm for the Mixed Fractional Packing and Covering Problem | 2007-05-22 | Paper |
| Maximizing the total profit of rectangles packed into a rectangle | 2007-04-26 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| An approximation algorithm for the general max-min resource sharing problem | 2006-06-14 | Paper |
| General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time | 2006-06-01 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Improved Approximation Schemes for Scheduling Unrelated Parallel Machines | 2005-11-11 | Paper |
| Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs | 2005-10-28 | Paper |
| Polynomial-Time Approximation Schemes for Geometric Intersection Graphs | 2005-09-16 | Paper |
| APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS | 2005-09-12 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Approximation schemes for job shop scheduling problems with controllable processing times | 2005-08-04 | Paper |
| A memetic algorithm to schedule planned maintenance for the national grid | 2005-08-04 | Paper |
| Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024769 | 2005-07-04 | Paper |
| Conversion of coloring algorithms into maximum weight independent set algorithms | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673409 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673410 | 2005-04-29 | Paper |
| Approximation schemes for parallel machine scheduling problems with controllable processing times | 2004-11-12 | Paper |
| Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736831 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737537 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472467 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472514 | 2004-08-04 | Paper |
| An asymptotic fully polynomial time approximation scheme for bin covering. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448360 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448755 | 2004-02-18 | Paper |
| Makespan Minimization in Job Shops: A Linear Time Approximation Scheme | 2004-01-08 | Paper |
| Graph Subcolorings: Complexity and Algorithms | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425952 | 2003-09-14 | Paper |
| The mutual exclusion scheduling problem for permutation and comparability graphs. | 2003-08-19 | Paper |
| Approximate strong separation with application in fractional graph coloring and preemptive scheduling. | 2003-08-17 | Paper |
| Computing optimal preemptive schedules for parallel tasks: linear programming approaches | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411391 | 2003-07-08 | Paper |
| Polynomial time approximation schemes for general multiprocessor job shop scheduling | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796706 | 2003-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782692 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782744 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536380 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768362 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535069 | 2002-06-12 | Paper |
| Linear-Time approximation schemes for scheduling malleable parallel tasks | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762518 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754204 | 2001-12-06 | Paper |
| The Maximum Edge-Disjoint Paths Problem in Bidirected Trees | 2001-11-11 | Paper |
| An approximation scheme for bin packing with conflicts | 2001-11-06 | Paper |
| The complexity of path coloring and call scheduling | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527196 | 2001-02-01 | Paper |
| Approximation Results for the Optimum Cost Chromatic Partition Problem | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508364 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501555 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500843 | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941835 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942616 | 2000-03-16 | Paper |
| Optimal wavelength routing on directed fiber trees | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268437 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260373 | 1999-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252325 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224927 | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395326 | 1998-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839008 | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395324 | 1998-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373682 | 1998-06-23 | Paper |
| Rankings of Graphs | 1998-05-11 | Paper |
| The disjoint cliques problem | 1998-02-19 | Paper |
| Generalized coloring for tree-like graphs | 1997-08-10 | Paper |
| Approximation algorithms for time constrained scheduling | 1997-07-06 | Paper |
| Restrictions of graph partition problems. I | 1997-02-28 | Paper |
| The minimum broadcast time problem for several processor networks | 1997-02-28 | Paper |
| On the complexity of allocation problems in high-level synthesis | 1997-02-27 | Paper |
| A rainbow about \(T\)-colorings for complete graphs | 1996-11-25 | Paper |
| Scheduling of conditional executed jobs on unrelated processors | 1996-05-30 | Paper |
| An approximation algorithm for the license and shift class design problem | 1995-02-19 | Paper |
| Scheduling with incompatible jobs | 1995-02-01 | Paper |
| UET-scheduling with chain-type precedence constraints | 1995-01-01 | Paper |
| Analysis of scheduling problems with typed task systems | 1994-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281630 | 1994-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4299118 | 1994-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281628 | 1994-06-20 | Paper |
| Scheduling of incompatible jobs on unrelated machines | 1994-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281629 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284253 | 1994-03-24 | Paper |
| The complexity of detecting crossingfree configurations in the plane | 1994-03-22 | Paper |
| One strike against the min-max degree triangulation problem | 1993-10-17 | Paper |
| Bounds for the general capacitated routing problem | 1993-09-05 | Paper |
| The allocation problem in hardware design | 1993-08-17 | Paper |
| Scheduling with constrained processor allocation for interval orders | 1993-08-10 | Paper |
| Transfer flow graphs | 1993-06-20 | Paper |
| The interconnection problem | 1993-05-16 | Paper |
| An approximation algorithm for the general routing problem | 1993-01-16 | Paper |
| Processor optimization for flow graphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976790 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5203657 | 1990-01-01 | Paper |
