- Embeddings of Negative-type Metrics and An Improved Approximation to Generalized
- Approximation Algorithms for TimeConstrained Scheduling on Line Networks
- An O( # n)Approximation Algorithm For Directed Sparsest Cut Mohammad Taghi Hajiaghayi # Harald Racke +
- Minimizing Average Latency in Oblivious Routing Prahladh Harsha # Thomas P. Hayes # Hariharan Narayanan + Harald Racke #
- A Practical Algorithm for Constructing Oblivious Routing Marcin Bienkowski #
- Oblivious Routing for the Lp-norm Matthias Englert
- Oblivious Interference Scheduling Alexander Fanghnel
- Oblivious Network Design Anupam Gupta
- Improved Embeddings of Graph Metrics into Random Trees Kedar Dhamdhere Anupam Gupta Harald Racke
- Embeddings of Negative-type Metrics and An Improved Approximation to Generalized Sparsest Cut
- Oblivious Routing on Node-Capacitated and Directed Graphs Mohammad T. Hajiaghayi
- Distributed Online Call Control on General Networks Harald Racke
- Reducing State Changes with a Pipeline Buffer Jens Krokowski Harald Racke Christian Sohler Matthias Westermann
- Smoothed Motion Complexity Valentina Damerow1, Friedhelm Meyer auf der Heide2, Harald Racke2,
- Data Management in Hierarchical Bus Networks F. Meyer auf der Heide
- Balanced Graph Partitioning Konstantin Andreev Harald Racke
- Optimal Oblivious Routing in Polynomial Time Edith Cohen
- Randomized Pursuit-Evasion in Graphs Micah Adler
- Approximation Algorithms for Data Management in Networks
- Data Management and Routing in General Networks Harald Racke
- Approximation Algorithms for Data Management in Networks
- Randomized PursuitEvasion in Graphs Micah Adler # Harald Racke + Naveen Sivadasan # Christian Sohler +
- Optimal Hierarchical Decompositions for Congestion Minimization in Networks
- Minimizing Congestion in General Networks Harald Racke
- Optimal Hierarchical Decompositions for Congestion Minimization in Networks
- New Lower Bounds for Oblivious Routing in Undirected Graphs Mohammad T. Hajiaghayi
- Acknowledgements First of all, I would like to thank my advisor Professor Friedhelm Meyer auf der
- Oblivious Routing in Directed Graphs with Random MohammadTaghi Hajiaghayi #+ Jeong Han Kim # Tom Leighton # Harald R
- Randomized Pursuit-Evasion in Graphs Micah Adler1
- Approximation Algorithms for Data Management in Networks
- Distributed Online Call Control on General Networks Harald Racke # Adi Rosen +
- Optimal Oblivious Routing in Polynomial Time Yossi Azar # Edith Cohen + Amos Fiat # Haim Kaplan # Harald R
- Oblivious Routing on NodeCapacitated and Directed Graphs Mohammad T. Hajiaghayi # Robert D. Kleinberg #+# Tom Leighton #+ Harald Racke
- Data Management in Networks: Experimental Evaluation
- Smoothed Motion Complexity # Valentina Damerow 1 , Friedhelm Meyer auf der Heide 2 , Harald Racke 2 ,
- Data Management in Networks: Experimental Evaluation
- Embeddings of Negativetype Metrics and An Improved Approximation to Generalized
- Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
- Oblivious Routing for the L p norm Matthias Englert #
- Reordering Buffers for General Metric Spaces Matthias Englert
- Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
- Embeddings of Negativetype Metrics and An Improved Approximation to Generalized Sparsest Cut #
- Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
- Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces
- Approximation Algorithms for LowDistortion Embeddings Into LowDimensional Spaces
- Data Management and Routing in General Networks Harald Racke #
- Randomized PursuitEvasion in Graphs Micah Adler 1 , Harald Racke 2 # , Naveen Sivadasan 3 # , Christian Sohler 2 # , and
- New Lower Bounds for Oblivious Routing in Undirected Graphs Mohammad T. Hajiaghayi # Robert D. Kleinberg #+# Tom Leighton # Harald Racke
- Acknowledgements First of all, I would like to thank my advisor Professor Friedhelm Meyer auf der
- A Practical Algorithm for Constructing Oblivious Routing Marcin Bienkowski
- Online Scheduling for Sorting Buffers Harald Rcke1
- Oblivious Routing in Directed Graphs with Random MohammadTaghi Hajiaghayi
- n)-Approximation Algorithm For Directed Sparsest Cut Mohammad Taghi Hajiaghayi
- Minimizing Average Latency in Oblivious Routing Prahladh Harsha
- Balanced Graph Partitioning Konstantin Andreev # Harald R
- Reordering Buffers for General Metric Spaces # Matthias Englert
- Approximation Algorithms for Data Management in Networks #
- Minimizing Congestion in General Networks Harald Racke #
- Oblivious Interference Scheduling Alexander Fanghnel # , Thomas Kesselheim # , Harald Rcke + , Berthold Vcking #
- Balanced Graph Partitioning Konstantin Andreev
- Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
- Oblivious Routing on NodeCapacitated and Directed Graphs # Mohammad Thagi Hajiaghayi + Robert D. Kleinberg ## Tom Leighton #+
- Online Scheduling for Sorting Buffers # Harald Rcke 1 , Christian Sohler 1 , and Matthias Westermann 2
- Balanced Graph Partitioning Konstantin Andreev # Harald Racke +
- Oblivious Network Design Anupam Gupta # Mohammad T. Hajiaghayi + Harald Racke #
- Optimal Oblivious Routing in Polynomial Time Edith Cohen
- Data Management in Hierarchical Bus Networks F. Meyer auf der Heide #
- Improved Embeddings of Graph Metrics into Random Trees # Kedar Dhamdhere Anupam Gupta Harald Racke
- Oblivious Routing on Node-Capacitated and Directed Graphs Mohammad Thagi Hajiaghayi
- Approximation Algorithms for Time-Constrained Scheduling on Line Networks
- Optimal Oblivious Routing in Polynomial Time Yossi Azar # Edith Cohen + Amos Fiat # Haim Kaplan # Harald Racke #
