| Publication | Date of Publication | Type |
|---|
| Dynamic maintenance of monotone dynamic programs and applications | 2024-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147388 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147424 | 2024-01-15 | Paper |
| Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874505 | 2023-02-07 | Paper |
| Almost Tight Bounds for Reordering Buffer Management | 2022-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075823 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111364 | 2020-05-27 | Paper |
| Computing Cut-Based Hierarchical Decompositions in Almost Linear Time | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743509 | 2019-05-10 | Paper |
| An O (log k )-Competitive Algorithm for Generalized Caching | 2019-03-28 | Paper |
| Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces | 2019-03-12 | Paper |
| Oblivious routing on node-capacitated and directed graphs | 2018-11-05 | Paper |
| Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut | 2018-11-05 | Paper |
| Reordering Buffers with Logarithmic Diameter Dependency for Trees | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601910 | 2018-01-24 | Paper |
| Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering | 2017-12-19 | Paper |
| Vertex Sparsification in Trees | 2017-04-04 | Paper |
| Fast convergence to Wardrop equilibria by adaptive sampling methods | 2014-11-25 | Paper |
| Vertex Sparsifiers: New Results from Old Techniques | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921658 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921660 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921741 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921742 | 2014-10-13 | Paper |
| Improved Guarantees for Tree Cut Sparsifiers | 2014-10-08 | Paper |
| Smoothed analysis of left-to-right maxima with applications | 2014-09-09 | Paper |
| Oblivious Routing for the Lp-norm | 2014-07-25 | Paper |
| Oblivious interference scheduling | 2014-07-23 | Paper |
| Online Stochastic Reordering Buffer Scheduling | 2014-07-01 | Paper |
| Almost tight bounds for reordering buffer management | 2014-06-05 | Paper |
| Optimal online buffer scheduling for block devices | 2014-05-13 | Paper |
| Approximation algorithms for time-constrained scheduling on line networks | 2012-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002815 | 2011-05-24 | Paper |
| Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods | 2011-04-04 | Paper |
| Vertex Sparsifiers: New Results from Old Techniques | 2010-09-10 | Paper |
| Oblivious routing in directed graphs with random demands | 2010-08-16 | Paper |
| New lower bounds for oblivious routing in undirected graphs | 2010-08-16 | Paper |
| Oblivious network design | 2010-08-16 | Paper |
| Improved embeddings of graph metrics into random trees | 2010-08-16 | Paper |
| Optimal oblivious routing in polynomial time | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579444 | 2010-08-06 | Paper |
| Survey on Oblivious Routing Strategies | 2010-07-28 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut | 2009-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549655 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549709 | 2009-01-05 | Paper |
| Balanced graph partitioning | 2007-01-25 | Paper |
| Optimal oblivious routing in polynomial time | 2004-11-18 | Paper |
| Approximation algorithms for data management in networks | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737218 | 2004-08-11 | Paper |
| Randomized Pursuit-Evasion in Graphs | 2004-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411413 | 2003-07-08 | Paper |
| Data management in networks: Experimental evaluation of a provably good strategy | 2002-06-27 | Paper |
