| Publication | Date of Publication | Type |
|---|
| Breaking the barrier of 2 for the storage allocation problem | 2026-03-18 | Paper |
| Coworking scheduling with network flows | 2025-10-31 | Paper |
Online knapsack with removal and recourse
Journal of Computer and System Sciences | 2025-09-29 | Paper |
| Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth | 2025-06-20 | Paper |
Approximating maximum edge 2-coloring by normalizing graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
Discrete Applied Mathematics | 2024-09-26 | Paper |
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
| Approximating maximum edge 2-coloring by normalizing graphs | 2024-07-19 | Paper |
| Unsplittable flow on a path: the game! | 2024-07-19 | Paper |
| A 3-approximation algorithm for maximum independent set of rectangles | 2024-07-19 | Paper |
| Capacitated vehicle routing in graphic metrics | 2024-05-14 | Paper |
Online knapsack with removal and recourse
Lecture Notes in Computer Science | 2023-12-22 | Paper |
A PTAS for unsplittable flow on a path
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back | 2023-09-20 | Paper |
A Modern View on Stability of Approximation
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time
(available as arXiv preprint) | 2022-08-16 | Paper |
Randomized online computation with high probability guarantees
Algorithmica | 2022-05-03 | Paper |
scientific article; zbMATH DE number 7378704 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| Approximating airports and railways | 2020-08-05 | Paper |
Robust reoptimization of Steiner trees
Algorithmica | 2020-05-21 | Paper |
A (5/3+)-approximation for unsplittable flow on a path: placing small tasks into boxes
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Removing and adding edges for the traveling salesman problem
Journal of the ACM | 2018-08-02 | Paper |
To augment or not to augment: solving unsplittable flow on a path by creating slack
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Maximum Scatter TSP in Doubling Metrics
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
European Journal of Operational Research | 2018-05-30 | Paper |
| Airports and railways: facility location meets network design | 2018-01-24 | Paper |
Complexity and approximability of parameterized MAX-CSPs
Algorithmica | 2017-10-10 | Paper |
New approximation schemes for unsplittable flow on a path
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Complexity and Approximability of Parameterized MAX-CSPs
(available as arXiv preprint) | 2017-09-29 | Paper |
Improved analysis of the online set cover problem with advice
Theoretical Computer Science | 2017-09-07 | Paper |
| Robust reoptimization of Steiner trees | 2017-07-13 | Paper |
Online algorithms with advice: the tape model
Information and Computation | 2017-05-18 | Paper |
Randomized Online Algorithms with High Probability Guarantees
(available as arXiv preprint) | 2017-03-03 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
The complexity of paging against a probabilistic adversary
Lecture Notes in Computer Science | 2016-03-10 | Paper |
A (2+)-approximation algorithm for the storage allocation problem
Automata, Languages, and Programming | 2015-10-27 | Paper |
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
Information Processing Letters | 2015-07-15 | Paper |
Improved approximations for TSP with simple precedence constraints
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Approximating Graphic TSP by Matchings
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
On the advice complexity of the set cover problem
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Steiner tree reoptimization in graphs with sharpened triangle inequality
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Reoptimization of the shortest common superstring problem
Algorithmica | 2011-09-20 | Paper |
Improved approximations for hard optimization problems via problem instance classification
Lecture Notes in Computer Science | 2011-05-27 | Paper |
Structural properties of hard metric TSP inputs (extended abstract)
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
The Steiner tree reoptimization problem with sharpened triangle inequality (extended abstract)
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Improved approximations for TSP with simple precedence constraints (extended abstract)
Lecture Notes in Computer Science | 2010-05-28 | Paper |
On the Advice Complexity of Online Problems
Algorithms and Computation | 2009-12-17 | Paper |
Reoptimization of Steiner trees: changing the terminal set
Theoretical Computer Science | 2009-08-21 | Paper |
Reoptimization of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2009-07-07 | Paper |
On the power of randomization for job shop scheduling with<i>k</i>-units length tasks
RAIRO - Theoretical Informatics and Applications | 2009-05-06 | Paper |
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata
Stochastic Algorithms: Foundations and Applications | 2009-03-05 | Paper |
On the Size Complexity of Rotating and Sweeping Automata
Developments in Language Theory | 2008-10-30 | Paper |
Reoptimization of Steiner Trees
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
On the Hardness of Reoptimization
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Efficient Algorithms for the Spoonerism Problem
Lecture Notes in Computer Science | 2007-11-15 | Paper |
| Job shop scheduling with unit length tasks: bounds and algorithms | 2007-08-13 | Paper |
