Balanced graph partitioning K Andreev, H Racke Theory of Computing Systems 39 (6), 929-939, 2006 | 566 | 2006 |

Minimizing congestion in general networks H Racke The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 292 | 2002 |

Optimal hierarchical decompositions for congestion minimization in networks H Räcke Proceedings of the fortieth annual ACM symposium on Theory of computing, 255-264, 2008 | 275 | 2008 |

Optimal oblivious routing in polynomial time Y Azar, E Cohen, A Fiat, H Kaplan, H Räcke Journal of Computer and System Sciences 69 (3), 383-394, 2004 | 252 | 2004 |

Fast convergence to Wardrop equilibria by adaptive sampling methods S Fischer, H Räcke, B Vöcking SIAM Journal on Computing 39 (8), 3700-3735, 2010 | 141 | 2010 |

A practical algorithm for constructing oblivious routing schemes M Bienkowski, M Korzeniowski, H Räcke Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 121 | 2003 |

Oblivious interference scheduling A Fanghänel, T Kesselheim, H Räcke, B Vöcking Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 104 | 2009 |

Randomized pursuit-evasion in graphs M Adler, H Räcke, N Sivadasan, C Sohler, B Vöcking Combinatorics, Probability and Computing 12 (3), 225-244, 2003 | 101 | 2003 |

Oblivious network design A Gupta, MT Hajiaghayi, H Räcke Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 89 | 2006 |

Approximation algorithms for low-distortion embeddings into low-dimensional spaces M Badoiu, K Dhamdhere, A Gupta, Y Rabinovich, H Räcke, R Ravi, ... SODA 5, 119-128, 2005 | 88 | 2005 |

Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut S Chawla, A Gupta, H Racke SIAM, 2005 | 71 | 2005 |

Vertex sparsifiers: New results from old techniques M Englert, A Gupta, R Krauthgamer, H Racke, I Talgam-Cohen, K Talwar SIAM Journal on Computing 43 (4), 1239-1262, 2014 | 66 | 2014 |

Online scheduling for sorting buffers H Räcke, C Sohler, M Westermann European Symposium on Algorithms, 820-832, 2002 | 59 | 2002 |

Randomized pursuit-evasion in graphs M Adler, H Räcke, N Sivadasan, C Sohler, B Vöcking International Colloquium on Automata, Languages, and Programming, 901-912, 2002 | 58 | 2002 |

Approximation algorithms for data management in networks C Krick, H Räcke, M Westermann Theory of Computing Systems 36 (5), 497-519, 2003 | 49 | 2003 |

Reordering buffers for general metric spaces M Englert, H Räcke, M Westermann Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 46 | 2007 |

Oblivious routing on node-capacitated and directed graphs MT Hajiaghayi, RD Kleinberg, H Räcke, T Leighton ACM Transactions on Algorithms (TALG) 3 (4), 51-es, 2007 | 45 | 2007 |

Computing cut-based hierarchical decompositions in almost linear time H Räcke, C Shah, H Täubig Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 38 | 2014 |

Oblivious routing in directed graphs with random demands MT Hajiaghayi, JH Kim, T Leighton, H Räcke Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 38 | 2005 |

Survey on oblivious routing strategies H Räcke Conference on Computability in Europe, 419-429, 2009 | 37 | 2009 |