| Publication | Date of Publication | Type |
|---|
| A constant-factor approximation for quasi-bipartite directed Steiner tree on minor-free graphs | 2025-01-14 | Paper |
| An \(O(\log k)\)-approximation for directed Steiner tree in planar graphs | 2024-11-14 | Paper |
| Bi-criteria approximation algorithms for bounded-degree subset TSP | 2024-09-11 | Paper |
| Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants | 2024-08-13 | Paper |
| A parameterized approximation scheme for generalized partial vertex cover | 2024-01-16 | Paper |
| Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs | 2024-01-16 | Paper |
| A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time | 2023-02-07 | Paper |
| Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems | 2022-08-16 | Paper |
| Improved approximations for capacitated vehicle routing with unsplittable client demands | 2022-08-16 | Paper |
| A constant-factor approximation for directed latency in quasi-polynomial time | 2022-03-29 | Paper |
| Graph pricing with limited supply | 2022-03-25 | Paper |
| Fair correlation clustering with global and local guarantees | 2022-03-25 | Paper |
| Scheduling Problems over Network of Machines | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111386 | 2020-05-27 | 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 based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract) | 2019-05-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 |
| Lift-and-project methods for set cover and knapsack | 2018-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607905 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598215 | 2017-12-19 | Paper |
| A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs | 2017-10-17 | Paper |
| Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts | 2017-10-17 | Paper |
| On Linear Programming Relaxations for Unsplittable Flow in Trees | 2017-08-31 | Paper |
| Compact, provably-good LPs for orienteering and regret-bounded vehicle routing | 2017-08-31 | Paper |
| Approximation Algorithms for Minimum-Load k-Facility Location | 2017-03-22 | Paper |
| An Improved Integrality Gap for Asymmetric TSP Paths | 2016-08-10 | Paper |
| Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line | 2016-03-10 | 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 |
| A logarithmic approximation for unsplittable flow on line graphs | 2015-08-14 | Paper |
| Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing | 2015-06-26 | Paper |
| Approximating minimum-cost connected \(T\)-joins | 2015-05-21 | Paper |
| Minimizing movement in mobile facility location problems | 2014-09-09 | Paper |
| Linear Programming Hierarchies Suffice for Directed Steiner Tree | 2014-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417635 | 2014-05-22 | Paper |
| Asymmetric traveling salesman path and directed latency problems | 2013-11-14 | Paper |
| Multiple Traveling Salesmen in Asymmetric Metrics | 2013-10-04 | Paper |
| Lift-and-Project Methods for Set Cover and Knapsack | 2013-08-12 | Paper |
| An Improved Integrality Gap for Asymmetric TSP Paths | 2013-03-19 | Paper |
| Approximating Minimum-Cost Connected T-Joins | 2012-11-02 | Paper |
| Superabundant Numbers and the Riemann Hypothesis | 2012-01-01 | Paper |
| Approximability of packing disjoint cycles | 2011-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3558605 | 2010-05-05 | Paper |
| Approximability of Packing Disjoint Cycles | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5462257 | 2005-08-01 | Paper |
