| 2026 | STOC | An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time. | Monika Henzinger, Robin Mnk, Harald Rcke |
| 2026 | STOC | Nonuniform Graph Partitioning with Just a Little Flex. | Neil Olver, Harald Rcke, Stefan Schmid |
| 2025 | ESA | Efficient Contractions of Dynamic Graphs - With Applications. | Monika Henzinger, Evangelos Kosinas, Robin Mnk, Harald Rcke |
| 2025 | ICALP | Incremental Approximate Maximum Flow via Residual Graph Sparsification. | Gramoz Goranci, Monika Henzinger, Harald Rcke, A. R. Sricharan |
| 2025 | SPAA | Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model. | Harald Rcke, Stefan Schmid, Ruslan Zabrodin |
| 2024 | INFOCOM | Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search. | Harald Rcke, Stefan Schmid, Radu Vintan |
| 2024 | KDD | Expander Hierarchies for Normalized Cuts on Graphs. | Kathrin Hanauer, Monika Henzinger, Robin Mnk, Harald Rcke, Maximilian Vtsch |
| 2023 | STACS | Dynamic Maintenance of Monotone Dynamic Programs and Applications. | Monika Henzinger, Stefan Neumann, Harald Rcke, Stefan Schmid |
| 2023 | SPAA | Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. | Harald Rcke, Stefan Schmid, Ruslan Zabrodin |
| 2022 | STOC | Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. | Bernhard Haeupler, Harald Rcke, Mohsen Ghaffari |
| 2022 | SPAA | Approximate Dynamic Balanced Graph Partitioning. | Harald Rcke, Stefan Schmid, Ruslan Zabrodin |
| 2021 | Networking | It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. | Robin Mnk, Matthias Rost, Harald Rcke, Stefan Schmid |
| 2021 | SODA | The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. | Gramoz Goranci, Harald Rcke, Thatchaphol Saranurak, Zihan Tan |
| 2021 | SODA | Tight Bounds for Online Graph Partitioning. | Monika Henzinger, Stefan Neumann, Harald Rcke, Stefan Schmid |
| 2020 | ESA | Compact Oblivious Routing in Weighted Graphs. | Philipp Czerner, Harald Rcke |
| 2019 | ESA | Compact Oblivious Routing. | Harald Rcke, Stefan Schmid |
| 2019 | FOCS | Polylogarithmic Guarantees for Generalized Reordering Buffer Management. | Matthias Englert, Harald Rcke, Richard Stotz |
| 2018 | SPAA | Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. | Harald Rcke, Roy Schwartz, Richard Stotz |
| 2017 | ICALP | Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces. | Matthias Kohler, Harald Rcke |
| 2017 | SODA | Reordering Buffers with Logarithmic Diameter Dependency for Trees. | Matthias Englert, Harald Rcke |
| 2016 | ICALP | Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. | Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Rcke, Saeed Seddighin |
| 2016 | STACS | Improved Approximation Algorithms for Balanced Partitioning Problems. | Harald Rcke, Richard Stotz |
| 2016 | WAOA | Vertex Sparsification in Trees. | Gramoz Goranci, Harald Rcke |
| 2014 | ESA | Improved Guarantees for Tree Cut Sparsifiers. | Harald Rcke, Chintan Shah |
| 2014 | ICALP | Online Stochastic Reordering Buffer Scheduling. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Rcke |
| 2014 | SODA | Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. | Harald Rcke, Chintan Shah, Hanjo Tubig |
| 2012 | SODA | An | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Rcke |
| 2012 | STOC | Optimal online buffer scheduling for block devices. | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Rcke |
| 2011 | STOC | Almost tight bounds for reordering buffer management. | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Rcke |
| 2009 | CiE | Survey on Oblivious Routing Strategies. | Harald Rcke |
| 2009 | FOCS | Oblivious Routing for the Lp-norm. | Matthias Englert, Harald Rcke |
| 2009 | PODC | Oblivious interference scheduling. | Alexander Fanghnel, Thomas Kesselheim, Harald Rcke, Berthold Vcking |
| 2009 | SPAA | Approximation algorithms for time-constrained scheduling on line networks. | Harald Rcke, Adi Rosn |
| 2008 | SODA | Minimizing average latency in oblivious routing. | Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Rcke, Jaikumar Radhakrishnan |
| 2008 | STOC | Optimal hierarchical decompositions for congestion minimization in networks. | Harald Rcke |
| 2007 | STOC | Reordering buffers for general metric spaces. | Matthias Englert, Harald Rcke, Matthias Westermann |
| 2006 | SODA | Improved embeddings of graph metrics into random trees. | Kedar Dhamdhere, Anupam Gupta, Harald Rcke |
| 2006 | SODA | Oblivious network design. | Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Rcke |
| 2006 | SODA | New lower bounds for oblivious routing in undirected graphs. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Rcke |
| 2006 | STOC | Fast convergence to Wardrop equilibria by adaptive sampling methods. | Simon Fischer, Harald Rcke, Berthold Vcking |
| 2005 | SODA | Approximation algorithms for low-distortion embeddings into low-dimensional spaces. | Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Rcke, R. Ravi, Anastasios Sidiropoulos |
| 2005 | SODA | Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. | Shuchi Chawla, Anupam Gupta, Harald Rcke |
| 2005 | SODA | Oblivious routing on node-capacitated and directed graphs. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Rcke |
| 2005 | SODA | Distributed online call control on general networks. | Harald Rcke, Adi Rosn |
| 2005 | STOC | Oblivious routing in directed graphs with random demands. | Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Rcke |
| 2004 | SPAA | Balanced graph partitioning. | Konstantin Andreev, Harald Rcke |
| 2003 | ESA | Smoothed Motion Complexity. | Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Rcke, Christian Scheideler, Christian Sohler |
| 2003 | STOC | Optimal oblivious routing in polynomial time. | Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Rcke |
| 2003 | SPAA | A practical algorithm for constructing oblivious routing schemes. | Marcin Bienkowski, Miroslaw Korzeniowski, Harald Rcke |
| 2002 | ESA | Online Scheduling for Sorting Buffers. | Harald Rcke, Christian Sohler, Matthias Westermann |
| 2002 | FOCS | Minimizing Congestion in General Networks. | Harald Rcke |
| 2002 | ICALP | Randomized Pursuit-Evasion in Graphs. | Micah Adler, Harald Rcke, Naveen Sivadasan, Christian Sohler, Berthold Vcking |
| 2001 | SPAA | Approximation algorithms for data management in networks. | Christof Krick, Harald Rcke, Matthias Westermann |
| 2000 | SPAA | Data management in hierarchical bus networks. | Friedhelm Meyer auf der Heide, Harald Rcke, Matthias Westermann |
| 1999 | SPAA | Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. | Christof Krick, Friedhelm Meyer auf der Heide, Harald Rcke, Berthold Vcking, Matthias Westermann |