| Publication | Date of Publication | Type |
|---|
| Minimizing the weighted makespan with restarts on a single machine | 2026-09-29 | Paper |
| Hardness of SetCover reoptimization | 2026-09-29 | Paper |
| New algorithm for combinatorial n-folds and applications | 2026-09-23 | Paper |
| The support of bin packing is exponential | 2026-08-31 | Paper |
| Convolution and knapsack in higher dimensions | 2026-08-11 | Paper |
| Improved approximation algorithms for three-dimensional knapsack | 2026-08-11 | Paper |
| Robust scheduling on uniform machines. New results using a relaxed approximation guarantee | 2026-02-10 | Paper |
| Exact and approximate high-multiplicity scheduling on identical machines | 2025-11-11 | Paper |
| New support size bounds for integer programming, applied to makespan minimization on uniformly related machines | 2025-07-24 | Paper |
| A PTAS for packing hypercubes into a knapsack | 2024-06-24 | Paper |
| Load balancing: the long road from theory to practice | 2024-05-24 | Paper |
On Integer Programming, Discrepancy, and Convolution
Mathematics of Operations Research | 2024-02-27 | Paper |
A rainbow about T-colorings for complete graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Rankings of graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Peak demand minimization via sliced strip packing
Algorithmica | 2023-12-13 | Paper |
Peak Demand Minimization via Sliced Strip Packing.
(available as arXiv preprint) | 2023-11-20 | Paper |
| A Tight (3/2+ε) Approximation for Skewed Strip Packing. | 2023-10-31 | Paper |
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
Algorithmica | 2023-10-06 | Paper |
scientific article; zbMATH DE number 7740908 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Solving cut-problems in quadratic time for graphs with bounded treewidth
Lecture Notes in Computer Science | 2023-08-14 | Paper |
On the complexity of scheduling problems with a fixed number of parallel identical machines
Lecture Notes in Computer Science | 2023-08-14 | Paper |
scientific article; zbMATH DE number 7724212 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
The double exponential runtime is tight for 2-stage stochastic ILPs
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Online bin covering with limited migration
Journal of Computer and System Sciences | 2023-03-10 | Paper |
scientific article; zbMATH DE number 7650890 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
An approximation scheme for bin packing with conflicts
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Empowering the configuration-IP: new PTAS results for scheduling with setup times
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
| Exact polynomial time algorithm for the response time analysis of harmonic tasks | 2022-08-30 | Paper |
Local search breaks 1.75 for graph balancing
(available as arXiv preprint) | 2022-07-21 | Paper |
| Near-linear time algorithm for \(n\)-fold ILPs via color coding | 2022-07-21 | Paper |
| On integer programming and convolution | 2022-07-18 | Paper |
Empowering the configuration-IP -- new PTAS results for scheduling with setups times
(available as arXiv preprint) | 2022-07-18 | Paper |
Online Bin Covering with Limited Migration
(available as arXiv preprint) | 2022-05-11 | Paper |
Closing the Gap for Pseudo-Polynomial Strip Packing
(available as arXiv preprint) | 2022-05-11 | Paper |
Tightness of sensitivity and proximity bounds for integer linear programs
(available as arXiv preprint) | 2022-03-24 | Paper |
Robust online algorithms for dynamic choosing problems
(available as arXiv preprint) | 2022-03-22 | Paper |
The double exponential runtime is tight for 2-stage stochastic ILPs
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Approximation results for makespan minimization with budgeted uncertainty
Theory of Computing Systems | 2021-09-28 | Paper |
Online strip packing with polynomial migration
(available as arXiv preprint) | 2021-07-28 | Paper |
An EPTAS for scheduling fork-join graphs with communication delay
Theoretical Computer Science | 2021-03-09 | Paper |
Closing the gap for makespan scheduling via sparsification techniques
Mathematics of Operations Research | 2021-01-08 | Paper |
About the Structure of the Integer Cone and Its Application to Bin Packing
Mathematics of Operations Research | 2021-01-08 | Paper |
A quasi-polynomial approximation for the restricted assignment problem
SIAM Journal on Computing | 2020-12-04 | Paper |
Near-linear time algorithm for n-fold ILPs via color coding
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
Structural parameters for scheduling with assignment restrictions
Theoretical Computer Science | 2020-10-21 | Paper |
A note on the integrality gap of the configuration LP for restricted Santa Claus
Information Processing Letters | 2020-10-07 | Paper |
Robust online algorithms for certain dynamic packing problems
(available as arXiv preprint) | 2020-08-24 | Paper |
Approximation results for makespan minimization with budgeted uncertainty
Approximation and Online Algorithms | 2020-08-24 | Paper |
Linear time algorithms for multiple cluster scheduling and multiple strip packing
Lecture Notes in Computer Science | 2020-07-20 | Paper |
| New Bounds for the Vertices of the Integer Hull | 2020-06-18 | Paper |
Complexity and inapproximability results for parallel task scheduling and strip packing
Theory of Computing Systems | 2020-02-27 | Paper |
Fully dynamic bin packing revisited
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Approximation schemes for machine scheduling with resource (in-)dependent processing times
ACM Transactions on Algorithms | 2019-11-25 | Paper |
A robust AFPTAS for online bin packing with polynomial migration
SIAM Journal on Discrete Mathematics | 2019-10-30 | Paper |
| Compact LP relaxations for allocation problems | 2019-10-25 | Paper |
| Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows | 2019-10-24 | Paper |
Improved approximation for two dimensional strip packing with polynomial bounded width
Theoretical Computer Science | 2019-09-10 | Paper |
An EPTAS for scheduling on unrelated machines of few different types
Algorithmica | 2019-09-10 | Paper |
On the optimality of approximation schemes for the classical scheduling problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
New approximability results for two-dimensional bin packing
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Parameterized approximation scheme for the multiple knapsack problem | 2019-05-06 | Paper |
| Improved approximation algorithms for scheduling with fixed jobs | 2019-05-06 | Paper |
Complexity and inapproximability results for parallel task scheduling and strip packing
Lecture Notes in Computer Science | 2018-11-28 | Paper |
A PTAS for scheduling unrelated machines of few different types
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Approximation schemes for machine scheduling with resource (in-)dependent processing times
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
About the structure of the integer cone and its application to bin packing
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the configuration-LP of the restricted assignment problem
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Constrained bipartite edge coloring with applications to wavelength routing
Automata, Languages and Programming | 2018-07-04 | Paper |
Approximation results for the optimum cost chromatic partition problem
Automata, Languages and Programming | 2018-07-04 | Paper |
On the optimality of exact and approximation algorithms for scheduling problems
Journal of Computer and System Sciences | 2018-06-06 | Paper |
Estimating the makespan of the two-valued restricted assignment problem
Algorithmica | 2018-05-23 | Paper |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
| Non-preemptive scheduling with setup times: a PTAS | 2018-01-11 | Paper |
scientific article; zbMATH DE number 6820261 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
A faster FPTAS for the unbounded knapsack problem
European Journal of Combinatorics | 2017-11-14 | Paper |
| Estimating the makespan of the two-valued restricted assignment problem | 2017-10-17 | Paper |
An EPTAS for scheduling on unrelated machines of few different types
Lecture Notes in Computer Science | 2017-09-22 | Paper |
A quasi-polynomial approximation for the restricted assignment problem
(available as arXiv preprint) | 2017-08-31 | Paper |
scientific article; zbMATH DE number 6767525 (Why is no real title available?)
(available as arXiv preprint) | 2017-08-31 | Paper |
New algorithmic results for bin packing and scheduling
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Structural parameters for scheduling with assignment restrictions
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Improved approximation for two dimensional strip packing with polynomial bounded width
Lecture Notes in Computer Science | 2017-05-05 | Paper |
Structured instances of restricted assignment with two processing times
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
| Scheduling parallel jobs on heterogeneous platforms | 2017-02-14 | Paper |
An efficient PTAS for parallel machine scheduling with capacity constraints
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Upper domination: complexity and approximation
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Makespan minimization in job shops: a polynomial time approximation scheme
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Improved approximation schemes for scheduling unrelated parallel machines
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
A faster FPTAS for the unbounded knapsack problem
Lecture Notes in Computer Science | 2016-04-04 | Paper |
New approximability results for two-dimensional bin packing
Algorithmica | 2016-03-23 | Paper |
Precedence scheduling with unit execution time is equivalent to parametrized biclique
Lecture Notes in Computer Science | 2016-03-10 | Paper |
A PTAS for scheduling unrelated machines of few different types
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Bounding the running time of algorithms for scheduling and packing problems
SIAM Journal on Discrete Mathematics | 2016-03-04 | Paper |
Improved approximation algorithms for scheduling parallel jobs on identical clusters
Theoretical Computer Science | 2015-09-16 | Paper |
An approximation algorithm for scheduling malleable tasks under general precedence constraints
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| On rectangle packing, maximizing benefits | 2015-08-03 | Paper |
Preemptive scheduling with dedicated processors: applications of fractional graph coloring
Journal of Scheduling | 2015-01-22 | Paper |
A new asymptotic approximation algorithm for 3-dimensional strip packing
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms | 2014-09-09 | Paper |
