| Almost Tight Bounds for Reordering Buffer Management | 0 | 0.34 | 2022 |
| Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time. | 0 | 0.34 | 2021 |
| Tight Bounds for Online Graph Partitioning | 0 | 0.34 | 2021 |
| The Expander Hierarchy and its Applications to Dynamic Graph Algorithms | 1 | 0.35 | 2021 |
| Compact Oblivious Routing in Weighted Graphs | 0 | 0.34 | 2020 |
| Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. | 0 | 0.34 | 2017 |
| Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces. | 1 | 0.37 | 2017 |
| Reordering Buffers with Logarithmic Diameter Dependency for Trees. | 2 | 0.38 | 2017 |
| Improved Approximation Algorithms for Balanced Partitioning Problems. | 2 | 0.38 | 2016 |
| Vertex Sparsification in Trees. | 0 | 0.34 | 2016 |
| Improved Guarantees for Tree Cut Sparsifiers. | 1 | 0.36 | 2014 |
| Computing cut-based hierarchical decompositions in almost linear time | 4 | 0.40 | 2014 |
| An O(log k)-competitive algorithm for generalized caching | 14 | 0.77 | 2012 |
| Optimal online buffer scheduling for block devices | 5 | 0.45 | 2012 |
| Smoothed analysis of left-to-right maxima with applications | 5 | 0.43 | 2012 |
| Approximation Algorithms for Time-Constrained Scheduling on Line Networks | 3 | 0.40 | 2011 |
| Almost tight bounds for reordering buffer management | 16 | 0.75 | 2011 |
| Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods | 48 | 2.90 | 2010 |
| Vertex Sparsifiers: New Results from Old Techniques. | 20 | 0.79 | 2010 |
| Oblivious Routing for the Lp-norm | 4 | 0.43 | 2009 |
| Oblivious interference scheduling | 47 | 1.73 | 2009 |
| Survey on Oblivious Routing Strategies | 16 | 0.79 | 2009 |
| Optimal hierarchical decompositions for congestion minimization in networks | 90 | 3.10 | 2008 |
| Minimizing average latency in oblivious routing | 7 | 0.50 | 2008 |
| Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut | 41 | 2.91 | 2008 |
| Reordering buffers for general metric spaces | 20 | 1.02 | 2007 |
| New lower bounds for oblivious routing in undirected graphs | 7 | 0.72 | 2006 |
| Oblivious network design | 29 | 1.13 | 2006 |
| Improved embeddings of graph metrics into random trees | 6 | 0.60 | 2006 |
| An O(sqrt(n))-approximation algorithm for directed sparsest cut | 2 | 0.39 | 2006 |
| Data Management And Routing In General Networks | 0 | 0.34 | 2005 |
| Oblivious routing in directed graphs with random demands | 15 | 0.76 | 2005 |
| Distributed online call control on general networks | 6 | 0.50 | 2005 |
| Approximation algorithms for low-distortion embeddings into low-dimensional spaces | 38 | 1.54 | 2005 |
| Optimal oblivious routing in polynomial time | 81 | 5.10 | 2004 |
| Balanced graph partitioning | 58 | 2.24 | 2004 |
| Reducing State Changes with a Pipeline Buffer | 14 | 1.11 | 2004 |
| Data management and routing in general networks. | 2 | 0.39 | 2003 |
| A practical algorithm for constructing oblivious routing schemes | 49 | 2.61 | 2003 |
| Smoothed Motion Complexity | 13 | 0.78 | 2003 |
| Minimizing Congestion in General Networks | 96 | 5.23 | 2002 |
| Online Scheduling for Sorting Buffers | 30 | 1.83 | 2002 |
| Approximation algorithms for data management in networks | 21 | 1.21 | 2001 |
| Data management in networks: experimental evaluation of a provably good strategy | 7 | 0.54 | 1999 |
