| Balanced graph partitioning K Andreev, H Räcke Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004 | 728 | 2004 |
| 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 | 366 | 2008 |
| Minimizing congestion in general networks H Racke The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 354 | 2002 |
| Optimal oblivious routing in polynomial time Y Azar, E Cohen, A Fiat, H Kaplan, H Racke Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 278 | 2003 |
| Fast convergence to Wardrop equilibria by adaptive sampling methods S Fischer, H Räcke, B Vöcking Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 158 | 2006 |
| 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 | 139 | 2003 |
| Oblivious network design A Gupta, MT Hajiaghayi, H Räcke Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 116 | 2006 |
| 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 | 107 | 2003 |
| Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut S Chawla, A Gupta, H Räcke ACM Transactions on Algorithms (TALG) 4 (2), 1-18, 2008 | 105 | 2008 |
| 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 | 103 | 2009 |
| 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 | 97 | 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 | 84 | 2014 |
| The expander hierarchy and its applications to dynamic graph algorithms G Goranci, H Räcke, T Saranurak, Z Tan Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 75 | 2021 |
| 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 | 66 | 2014 |
| Online scheduling for sorting buffers H Räcke, C Sohler, M Westermann European Symposium on Algorithms, 820-832, 2002 | 65 | 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 | 63 | 2002 |
| 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 | 52 | 2007 |
| Approximation algorithms for data management in networks C Krick, H Räcke, M Westermann Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001 | 52 | 2001 |
| 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 | 50 | 2007 |
| Survey on oblivious routing strategies H Räcke Mathematical Theory and Computational Practice: 5th Conference on …, 2009 | 45 | 2009 |
