| Publication | Date of Publication | Type |
|---|
| Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree | 2023-06-09 | Paper |
| PTAS for Steiner tree on map graphs | 2022-10-13 | Paper |
| Better Bounds for Online Line Chasing | 2022-07-21 | Paper |
| Constant-Factor FPT Approximation for Capacitated k-Median | 2022-05-11 | Paper |
| To close is easier than to open: dual parameterization to \(k\)-median | 2022-03-22 | Paper |
| Concave connection cost facility location and the star inventory routing problem | 2022-03-22 | Paper |
| Proportional Approval Voting, Harmonic k-median, and Negative Association | 2021-07-28 | Paper |
| New results on multi-level aggregation | 2021-03-09 | Paper |
| Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree | 2021-01-19 | Paper |
| Unbounded lower bound for k-server against weak adversaries | 2021-01-19 | Paper |
| Online Algorithms for Multilevel Aggregation | 2020-11-04 | Paper |
| Approximating node-weighted \(k\)-MST on planar graphs | 2020-06-02 | Paper |
| Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration | 2020-05-27 | Paper |
| Dynamic Beats Fixed | 2019-12-02 | Paper |
| Constant-factor approximation for ordered k-median | 2019-08-22 | Paper |
| Better Approximation Bounds for the Joint Replenishment Problem | 2019-06-20 | Paper |
| Approximating node-weighted \(k\)-MST on planar graphs | 2019-01-15 | Paper |
| An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization | 2018-11-05 | Paper |
| An improved approximation algorithm for knapsack median using sparsification | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606281 | 2018-03-02 | Paper |
| Approximation Algorithms for Stochastic and Risk-Averse Optimization | 2018-01-12 | Paper |
| Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs | 2017-10-17 | Paper |
| Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems | 2017-10-05 | Paper |
| An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization | 2017-10-05 | Paper |
| An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation | 2016-08-10 | Paper |
| Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) | 2016-03-21 | Paper |
| Improved Approximation Algorithm for Fault-Tolerant Facility Placement | 2015-11-20 | Paper |
| An Improved Approximation Algorithm for Knapsack Median Using Sparsification | 2015-11-19 | Paper |
| The interval constrained 3-coloring problem | 2015-10-08 | Paper |
| PTAS for Minimax Approval Voting | 2015-01-07 | Paper |
| Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter | 2014-09-02 | Paper |
| An improved LP-based approximation for steiner tree | 2014-08-13 | Paper |
| Steiner Tree Approximation via Iterative Randomized Rounding | 2014-02-17 | Paper |
| Online Control Message Aggregation in Chain Networks | 2013-08-12 | Paper |
| Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location | 2013-08-12 | Paper |
| Drawing (complete) binary tanglegrams | 2012-04-26 | Paper |
| An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem | 2011-01-17 | Paper |
| New results on optimizing rooted triplets consistency | 2010-10-11 | Paper |
| Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm | 2010-06-22 | Paper |
| The Interval Constrained 3-Coloring Problem | 2010-04-27 | Paper |
| Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks | 2010-02-26 | Paper |
| Optimal algorithms for page migration in dynamic networks | 2009-12-10 | Paper |
| New algorithms for approximate Nash equilibria in bimatrix games | 2009-12-01 | Paper |
| Drawing (Complete) Binary Tanglegrams | 2009-03-03 | Paper |
| An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem | 2009-02-17 | Paper |
| New Results on Optimizing Rooted Triplets Consistency | 2009-01-29 | Paper |
| The approximation gap for the metric facility location problem is not yet closed | 2008-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3421457 | 2007-02-13 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
