| Publication | Date of Publication | Type |
|---|
| Efficient algorithms and hardness results for the weighted \(k\)-server problem | 2025-01-14 | Paper |
| Poly-logarithmic competitiveness for the \(k\)-taxi problem | 2024-11-28 | Paper |
| Maintaining matroid intersections online | 2024-11-28 | Paper |
| Set covering with our eyes wide shut | 2024-11-28 | Paper |
| Graph searching with predictions | 2024-09-25 | Paper |
| Algorithms for uncertain environments: going beyond the worst-case (invited talk) | 2024-09-12 | Paper |
| Matroid-based TSP rounding for half-integral solutions | 2024-08-20 | Paper |
| The power of adaptivity for stochastic submodular cover | 2024-07-29 | Paper |
| Robust secretary and prophet algorithms for packing integer programs | 2024-07-19 | Paper |
| Online discrepancy with recourse for vectors and graphs | 2024-07-19 | Paper |
| An improved local search algorithm for \(k\)-median | 2024-07-19 | Paper |
| Minimizing completion times for stochastic jobs via batched free times | 2024-05-14 | Paper |
| A local search-based approach for set covering | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147253 | 2024-01-15 | Paper |
| Bag-Of-Tasks Scheduling on Related Machines | 2023-11-20 | Paper |
| Corrigendum: Metric Embedding via Shortest Path Decompositions | 2023-11-14 | Paper |
| A quasipolynomial (2 + ε )-approximation for planar sparsest cut | 2023-11-14 | Paper |
| Chasing convex bodies with linear competitive ratio (invited paper) | 2023-11-14 | Paper |
| Configuration balancing for stochastic requests | 2023-11-09 | Paper |
| Lipschitz selectors may not yield competitive algorithms for convex body chasing | 2023-10-12 | Paper |
| Robust Algorithms for the Secretary Problem | 2023-02-03 | Paper |
| Chasing Convex Bodies with Linear Competitive Ratio | 2022-12-08 | Paper |
| Stochastic makespan minimization in structured set systems (extended abstract) | 2022-10-14 | Paper |
| Non-adaptive stochastic score classification and explainable halfspace evaluation | 2022-08-16 | Paper |
| Matroid-based TSP rounding for half-integral solutions | 2022-08-16 | Paper |
| Caching with time windows and delays | 2022-07-22 | Paper |
| Non-Clairvoyant Precedence Constrained Scheduling. | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091192 | 2022-07-21 | Paper |
| Stochastic online metric matching | 2022-07-21 | Paper |
| Metric Embedding via Shortest Path Decompositions | 2022-04-20 | Paper |
| Optimal Bounds for the k -cut Problem | 2022-03-31 | Paper |
| Stochastic makespan minimization in structured set systems | 2022-03-22 | Paper |
| Random-Order Models | 2022-02-04 | Paper |
| Online Discrepancy with Recourse for Vectors and Graphs | 2021-11-11 | Paper |
| Fully-dynamic bin packing with little repacking | 2021-07-28 | Paper |
| Maximizing profit with convex costs in the random-order model | 2021-07-28 | Paper |
| Non-preemptive flow-time minimization via rejections | 2021-07-28 | Paper |
| A local-search algorithm for Steiner forest | 2021-06-15 | Paper |
| Stochastic load balancing on unrelated machines | 2021-06-03 | Paper |
| Chasing Convex Bodies with Linear Competitive Ratio | 2021-02-02 | Paper |
| The Karger-Stein algorithm is optimal for k-cut | 2021-01-19 | Paper |
| Caching with time windows | 2021-01-19 | Paper |
| The Markovian price of information | 2020-02-06 | Paper |
| The number of minimum \(k\)-cuts: improving the Karger-Stein bound | 2020-01-30 | Paper |
| Potential-function proofs for gradient methods | 2019-12-05 | Paper |
| A Nearly-Linear Bound for Chasing Nested Convex Bodies | 2019-10-15 | Paper |
| Losing Treewidth by Separating Subsets | 2019-10-15 | Paper |
| \(k\)-servers with a smile: online algorithms via projections | 2019-10-15 | Paper |
| Elastic Caching | 2019-10-15 | Paper |
| Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs | 2019-09-02 | Paper |
| Metric embedding via shortest path decompositions | 2019-08-22 | Paper |
| Maintaining assignments online: matching, scheduling, and flows | 2019-06-20 | Paper |
| Minimum \(d\)-dimensional arrangement with fixed points | 2019-06-20 | Paper |
| Online Steiner tree with deletions | 2019-06-20 | Paper |
| Towards \((1 + \varepsilon)\)-approximate flow sparsifiers | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743496 | 2019-05-10 | Paper |
| Scheduling heterogeneous processors isn't as easy as you think | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633940 | 2019-05-06 | Paper |
| Approximate clustering without the approximation | 2019-05-06 | Paper |
| Approximation algorithms for low-distortion embeddings into low-dimensional spaces | 2019-03-12 | Paper |
| Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut | 2018-11-05 | Paper |
| On the approximability of some network design problems | 2018-11-05 | Paper |
| On hierarchical routing in doubling metrics | 2018-11-05 | Paper |
| Algorithms for hub label optimization | 2018-11-05 | Paper |
| Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets | 2018-10-30 | Paper |
| Algorithms and adaptivity gaps for stochastic probing | 2018-07-16 | Paper |
| Adaptivity gaps for stochastic probing: submodular and XOS functions | 2018-07-16 | Paper |
| LAST but not least: online spanners for buy-at-bulk | 2018-07-16 | Paper |
| On the Lovász Theta Function for Independent Sets in Sparse Graphs | 2018-07-04 | Paper |
| An FPT algorithm beating 2-approximation for \(k\)-cut | 2018-03-15 | Paper |
| Stochastic load balancing on unrelated machines | 2018-03-15 | Paper |
| Approximation Algorithms for Aversion k-Clustering via Local k-Median | 2017-12-19 | Paper |
| Approximation algorithms for optimal decision trees and adaptive TSP problems | 2017-09-22 | Paper |
| A 2-competitive algorithm for online convex optimization with switching costs | 2017-08-31 | Paper |
| Simultaneous Optimization of Sensor Placements and Balanced Schedules | 2017-08-25 | Paper |
| Online and dynamic algorithms for set cover | 2017-08-17 | Paper |
| Catch them if you can | 2017-05-16 | Paper |
| How the experts algorithm can help solve LPs online | 2016-11-16 | Paper |
| Embedding tree metrics into low dimensional Euclidean spaces | 2016-09-29 | Paper |
| An improved integrality gap for asymmetric TSP paths | 2016-08-10 | Paper |
| The power of deferral: maintaining a constant-competitive Steiner tree online | 2016-01-07 | Paper |
| Efficient cost-sharing mechanisms for prize-collecting problems | 2015-08-31 | Paper |
| Greedy algorithms for Steiner forest | 2015-08-21 | Paper |
| On the Lovász theta function for independent sets in sparse graphs | 2015-08-21 | Paper |
| Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs | 2015-06-26 | Paper |
| Approximating sparse covering integer programs online | 2015-04-24 | Paper |
| Running Errands in Time: Approximation Algorithms for Stochastic Orienteering | 2015-04-01 | Paper |
| Quorum placement in networks, minimizing network congestion | 2015-03-10 | Paper |
| Quorum placement in networks to minimize access delays | 2015-03-10 | Paper |
| Provisioning a virtual private network: a network design problem for multicommodity flow | 2015-02-27 | Paper |
| A constant-factor approximation for stochastic Steiner forest | 2015-02-04 | Paper |
| Online and stochastic survivable network design | 2015-02-04 | Paper |
| Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs | 2015-01-19 | Paper |
| An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem | 2014-12-18 | Paper |
| A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching | 2014-12-02 | Paper |
| Dial a ride from \(k\)-forest | 2014-11-18 | Paper |
| Dial a ride from \(k\)-forest | 2014-11-18 | Paper |
| Vertex sparsifiers: new results from old techniques | 2014-11-14 | Paper |
| On hierarchical routing in doubling metrics | 2014-10-13 | Paper |
| Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut | 2014-10-13 | Paper |
| Approximation algorithms for low-distortion embeddings into low-dimensional spaces | 2014-10-13 | Paper |
| On the approximability of some network design problems | 2014-10-13 | Paper |
| How experts can solve LPs online | 2014-10-08 | Paper |
| A constant factor approximation algorithm for a class of classification problems | 2014-09-26 | Paper |
| Set connectivity problems in undirected graphs and the directed Steiner network problem | 2014-09-09 | Paper |
| Thresholded covering algorithms for robust and max-min optimization | 2014-08-29 | Paper |
| The power of deferral: maintaining a constant-competitive Steiner tree online | 2014-08-07 | Paper |
| Sparsest cut on bounded treewidth graphs: algorithms and hardness results | 2014-08-07 | Paper |
| Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits | 2014-07-30 | Paper |
| Welfare and profit maximization with production costs | 2014-07-30 | Paper |
| Changing bases: multistage optimization for matroids and matchings | 2014-07-01 | Paper |
| Privately releasing conjunctions and the statistical query barrier | 2014-06-05 | Paper |
| Differentially private combinatorial optimization | 2014-05-22 | Paper |
| A constant factor approximation algorithm for generalized MIN-sum set cover | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417728 | 2014-05-22 | Paper |
| Clustering under approximation stability | 2014-02-17 | Paper |
| Forest density estimation | 2014-02-03 | Paper |
| Privately releasing conjunctions and the statistical query barrier | 2013-11-14 | Paper |
| The Approximability of the Binary Paintshop Problem | 2013-10-04 | Paper |
| Set covering with our eyes closed | 2013-09-25 | Paper |
| Online primal-dual for non-linear optimization with applications to speed scaling | 2013-09-13 | Paper |
| The Online Metric Matching Problem for Doubling Metrics | 2013-08-12 | Paper |
| Approximating sparse covering integer programs online | 2013-08-12 | Paper |
| Algorithms for hub label optimization | 2013-08-06 | Paper |
| Multicast routing for energy minimization using speed scaling | 2013-04-19 | Paper |
| A stochastic probing problem with applications | 2013-03-19 | Paper |
| Thrifty algorithms for multistage robust optimization | 2013-03-19 | Paper |
| Packing interdiction and partial covering problems | 2013-03-19 | Paper |
| Online and Stochastic Survivable Network Design | 2013-03-19 | Paper |
| An improved integrality gap for asymmetric TSP paths | 2013-03-19 | Paper |
| When LP is the cure for your matching woes: improved bounds for stochastic matchings | 2012-12-06 | Paper |
| All-norms and all-\(L_p\)-norms approximation algorithms | 2012-10-19 | Paper |
| Approximating TSP on metrics with bounded global growth | 2012-09-12 | Paper |
| Approximation algorithms for VRP with stochastic demands | 2012-06-18 | Paper |
| Iterative Constructions and Private Data Release | 2012-06-15 | Paper |
| Sampling and cost-sharing: approximation algorithms for stochastic optimization problems | 2012-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096214 | 2011-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002765 | 2011-05-24 | Paper |
| A plant location guide for the unsure: approximation algorithms for min-Max location problems | 2011-04-27 | Paper |
| Making doubling metrics geodesic | 2011-03-02 | Paper |
| Vertex Sparsifiers: New Results from Old Techniques | 2010-09-10 | Paper |
| An improved approximation algorithm for requirement cut | 2010-09-07 | Paper |
| Thresholded Covering Algorithms for Robust and Max-min Optimization | 2010-09-07 | Paper |
| Scalably Scheduling Power-Heterogeneous Processors | 2010-09-07 | Paper |
| Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems | 2010-09-07 | Paper |
| When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract) | 2010-09-06 | Paper |
| Simpler and better approximation algorithms for network design | 2010-08-16 | Paper |
| Oblivious network design | 2010-08-16 | Paper |
| Approximating unique games | 2010-08-16 | Paper |
| Small hop-diameter sparse spanners for doubling metrics | 2010-08-16 | Paper |
| Improved embeddings of graph metrics into random trees | 2010-08-16 | Paper |
| Boosted sampling | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579386 | 2010-08-06 | Paper |
| Set connectivity problems in undirected graphs and the directed Steiner network problem | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579379 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579458 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579397 | 2010-08-06 | Paper |
| Ultra-low-dimensional embeddings for doubling metrics | 2010-07-14 | Paper |
| Metric embeddings with relaxed guarantees | 2010-01-06 | Paper |
| Scheduling with Outliers | 2009-10-28 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Small hop-diameter sparse spanners for doubling metrics | 2009-03-24 | Paper |
| Stochastic Steiner Tree with Non-uniform Inflation | 2009-02-17 | Paper |
| Approximation via cost sharing | 2008-12-21 | Paper |
| Dial a Ride from k-Forest | 2008-09-25 | Paper |
| Pricing Tree Access Networks with Connected Backbones | 2008-09-25 | Paper |
| An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching | 2008-09-25 | Paper |
| LP Rounding Approximation Algorithms for Stochastic Network Design | 2008-05-27 | Paper |
| How to Complete a Doubling Metric | 2008-04-15 | Paper |
| Spanners with Slack | 2008-03-11 | Paper |
| Cost-sharing mechanisms for network design | 2008-02-18 | Paper |
| Infrastructure Leasing Problems | 2007-11-29 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Approximation algorithms for the unsplittable flow problem | 2007-03-05 | Paper |
| Approximation algorithms for minimizing average distortion | 2006-10-25 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Embedding k-Outerplanar Graphs into l1 | 2006-06-01 | Paper |
| Building edge-failure resilient networks | 2006-03-21 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| On a bidirected relaxation for the MULTIWAY CUT problem | 2005-09-28 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Traveling with a Pez Dispenser (or, Routing Issues in MPLS) | 2005-02-21 | Paper |
| Cuts, trees and \(\ell_1\)-embeddings of graphs | 2005-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737544 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471340 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471328 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471339 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471301 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411277 | 2003-07-07 | Paper |
| An elementary proof of a theorem of Johnson and Lindenstrauss | 2003-03-19 | Paper |
| Steiner points in tree metrics don't (really) help | 2002-03-24 | Paper |
| Improved bandwidth approximation for trees and chordal graphs | 2001-10-10 | Paper |
| Embedding tree metrics into low-dimensional Euclidean spaces | 2000-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952701 | 2000-05-10 | Paper |
