| Publication | Date of Publication | Type |
|---|
| Collapsing the tower -- on the complexity of multistage stochastic IPs | 2024-07-19 | Paper |
| On the fine-grained complexity of the unbounded SubsetSum and the Frobenius problem | 2024-07-19 | Paper |
Reducibility bounds of objective functions over the integers
Operations Research Letters | 2024-06-17 | Paper |
| On minimizing tardy processing time, Max-Min skewed convolution, and triangular structured ILPs | 2024-05-14 | Paper |
| Simple Lattice Basis Computation -- The Generalization of the Euclidean Algorithm | 2023-11-27 | 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 |
Empowering the configuration-IP: new PTAS results for scheduling with setup times
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
About the Complexity of Two-Stage Stochastic IPs
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
scientific article; zbMATH DE number 7559087 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
About the complexity of two-stage stochastic IPs
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
The double exponential runtime is tight for 2-stage stochastic ILPs
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Faster Algorithms for Integer Programs with Block Structure
(available as arXiv preprint) | 2021-07-28 | Paper |
Online strip packing with polynomial migration
(available as arXiv preprint) | 2021-07-28 | 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 |
| New Bounds for the Vertices of the Integer Hull | 2020-06-18 | Paper |
Fully dynamic bin packing revisited
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
A robust AFPTAS for online bin packing with polynomial migration
SIAM Journal on Discrete Mathematics | 2019-10-30 | Paper |
| Using structural properties for integer programs | 2018-09-06 | 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 |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
scientific article; zbMATH DE number 6820261 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-19 | Paper |
scientific article; zbMATH DE number 6767525 (Why is no real title available?)
(available as arXiv preprint) | 2017-08-31 | 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 |
A robust AFPTAS for online bin packing with polynomial migration
Automata, Languages, and Programming | 2013-08-06 | Paper |
