| Publication | Date of Publication | Type |
|---|
| Approximations for Throughput Maximization | 2024-04-24 | Paper |
| Approximation Algorithms for Generalized Path Scheduling | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065401 | 2023-11-14 | Paper |
| Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension | 2023-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874306 | 2023-02-07 | Paper |
| Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment | 2022-08-18 | Paper |
| Improved approximations for capacitated vehicle routing with unsplittable client demands | 2022-08-16 | Paper |
| Scheduling Problems over Network of Machines | 2021-07-28 | Paper |
| Scheduling problems over a network of machines | 2020-01-03 | Paper |
| Approximation Schemes for Clustering with Outliers | 2019-11-25 | Paper |
| Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS | 2019-10-15 | Paper |
| Local Search Yields a PTAS for $k$-Means in Doubling Metrics | 2019-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633882 | 2019-05-06 | Paper |
| Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median | 2019-03-11 | Paper |
| LP-based approximation algorithms for facility location in buy-at-bulk network design | 2019-03-11 | Paper |
| Approximation Algorithms for Minimum-Load k -Facility Location | 2018-11-13 | Paper |
| Packing element-disjoint steiner trees | 2018-11-05 | Paper |
| Approximation algorithms and hardness results for cycle packing problems | 2018-11-05 | Paper |
| Minimizing latency of capacitated \(k\)-tours | 2018-07-25 | Paper |
| Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607905 | 2018-03-15 | Paper |
| Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts | 2017-10-17 | Paper |
| Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems | 2017-03-27 | Paper |
| Approximation Algorithms for Minimum-Load k-Facility Location | 2017-03-22 | Paper |
| New approximation algorithms for the unsplittable capacitated facility location problem | 2016-06-28 | Paper |
| How to walk your dog in the mountains with no magic leash | 2016-02-29 | Paper |
| Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph | 2016-02-23 | Paper |
| LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design | 2015-10-30 | Paper |
| Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median | 2015-10-27 | Paper |
| On minimum sum of radii and diameters clustering | 2015-09-03 | Paper |
| A logarithmic approximation for unsplittable flow on line graphs | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934722 | 2014-12-18 | Paper |
| Minimizing movement in mobile facility location problems | 2014-09-09 | Paper |
| How to walk your dog in the mountains with no magic leash | 2014-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417635 | 2014-05-22 | Paper |
| Asymmetric Traveling Salesman Path and Directed Latency Problems | 2013-11-14 | Paper |
| Two-stage robust network design with exponential scenarios | 2013-03-05 | Paper |
| On Minimum Sum of Radii and Diameters Clustering | 2012-08-14 | Paper |
| New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem | 2012-08-14 | Paper |
| A weakly robust PTAS for minimum clique partition in unit disk graphs | 2012-04-26 | Paper |
| A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs | 2012-03-15 | Paper |
| Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph | 2011-12-16 | Paper |
| Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems | 2011-08-17 | Paper |
| Approximability of packing disjoint cycles | 2011-05-10 | Paper |
| Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design | 2010-11-04 | Paper |
| Combination can be hard | 2010-08-16 | Paper |
| Survivable Network Design with Degree or Order Constraints | 2010-07-07 | Paper |
| A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs | 2010-06-22 | Paper |
| Combination Can Be Hard: Approximability of the Unique Coverage Problem | 2009-08-20 | Paper |
| Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees | 2009-05-13 | Paper |
| Survivable network design with degree or order constraints | 2009-01-05 | Paper |
| A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs | 2008-11-27 | Paper |
| Two-Stage Robust Network Design with Exponential Scenarios | 2008-11-25 | Paper |
| Approximability of Packing Disjoint Cycles | 2008-05-27 | Paper |
| Disjoint Cycles: Integrality Gap, Hardness, and Approximation | 2007-08-30 | Paper |
| Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees | 2007-08-28 | Paper |
| Hardness and approximation results for packing Steiner trees | 2007-06-21 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Large induced forests in triangle-free planar graphs | 2006-06-16 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Planar graphs without cycles of length from 4 to 7 are 3-colorable | 2005-03-08 | Paper |
| A polynomial time algorithm for strong edge coloring of partial \(k\)-trees | 2004-11-23 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4810508 A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma] | 2004-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471317 | 2004-07-28 | Paper |
| On sum coloring of graphs | 2003-06-10 | Paper |
| On a conjecture of Keedwell and the cycle double cover conjecture | 2001-11-28 | Paper |
