| Publication | Date of Publication | Type |
|---|
| 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 |
| Simpler and Better Algorithms for Minimum-Norm Load Balancing | 2022-05-11 | Paper |
| A constant-factor approximation for directed latency in quasi-polynomial time | 2022-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009558 | 2021-08-04 | Paper |
| On the Integrality Gap of the Prize-Collecting Steiner Forest LP | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002699 | 2021-07-28 | Paper |
| Approximate multi-matroid intersection via iterative refinement | 2020-08-28 | Paper |
| Improved Algorithms for MST and Metric-TSP Interdiction | 2020-05-27 | Paper |
| Approximate multi-matroid intersection via iterative refinement | 2020-02-06 | Paper |
| Approximation algorithms for minimum norm and ordered optimization problems | 2020-01-30 | Paper |
| Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions | 2020-01-30 | Paper |
| Achieving target equilibria in network routing games without knowing the latency functions | 2019-12-12 | Paper |
| Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract) | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743446 | 2019-05-10 | Paper |
| Black-box reductions for cost-sharing mechanism design | 2019-03-29 | Paper |
| Approximation Algorithms for Minimum-Load k -Facility Location | 2018-11-13 | Paper |
| Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications | 2018-11-05 | Paper |
| Fault-tolerant facility location | 2018-11-05 | Paper |
| Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems | 2018-10-26 | Paper |
| Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers | 2017-12-19 | Paper |
| Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract) | 2017-10-05 | Paper |
| Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract) | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365144 | 2017-09-29 | Paper |
| Compact, provably-good LPs for orienteering and regret-bounded vehicle routing | 2017-08-31 | Paper |
| MIN-MAX theorems for packing and covering odd \((u,v)\)-trails | 2017-08-31 | Paper |
| Welfare maximization and truthfulness in mechanism design with ordinal preferences | 2017-05-19 | Paper |
| Learning mixtures of arbitrary distributions over large discrete domains | 2017-05-19 | Paper |
| Approximation Algorithms for Minimum-Load k-Facility Location | 2017-03-22 | Paper |
| Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications | 2017-03-22 | Paper |
| Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems | 2016-08-10 | Paper |
| Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems | 2016-08-10 | Paper |
| An approximation scheme for stochastic linear programming and its application to stochastic integer programs | 2015-12-04 | Paper |
| Learning Arbitrary Statistical Mixtures of Discrete Distributions | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501301 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501373 | 2015-08-03 | Paper |
| Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing | 2015-06-26 | Paper |
| Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players | 2015-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934708 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934723 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921761 | 2014-10-13 | Paper |
| The effectiveness of stackelberg strategies and tolls for network congestion games | 2014-09-09 | Paper |
| Truthful and Near-Optimal Mechanism Design via Linear Programming | 2014-02-17 | Paper |
| The effectiveness of lloyd-type methods for the k-means problem | 2014-02-17 | Paper |
| Improved Approximation Guarantees for Lower-Bounded Facility Location | 2013-09-13 | Paper |
| Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization | 2012-11-29 | Paper |
| Approximability of the firefighter problem. Computing cuts over time | 2012-04-26 | Paper |
| LP-based approximation algorithms for capacitated facility location | 2012-02-22 | Paper |
| Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems | 2011-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579377 | 2010-08-06 | Paper |
| Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm | 2010-06-22 | Paper |
| Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity | 2009-12-17 | Paper |
| Truthful mechanism design for multidimensional scheduling via cycle monotonicity | 2009-08-27 | Paper |
| Approximation Algorithms for Data Placement Problems | 2009-08-20 | Paper |
| Optimal Power-Down Strategies | 2008-10-28 | Paper |
| Approximation Algorithms for 2-Stage Stochastic Optimization Problems | 2008-04-17 | Paper |
| Approximation Algorithms for Graph Homomorphism Problems | 2007-08-28 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Primal-dual algorithms for connected facility location problems | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471365 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411292 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501673 | 2000-09-04 | Paper |
