Data management in hierarchical bus networks. - Friedhelm Meyer auf der Heide; Harald Räcke; Matthias Westermann (SPAA, 2000)

Online Scheduling for Sorting Buffers. - Harald Räcke; Christian Sohler; Matthias Westermann (ESA, 2002)

Minimizing Congestion in General Networks. - Harald Räcke (FOCS, 2002)

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. - Christof Krick; Friedhelm Meyer auf der Heide; Harald Räcke; Berthold Vöcking; Matthias Westermann (Theory Comput. Syst., 2002)

Smoothed Motion Complexity. - Valentina Damerow; Friedhelm Meyer auf der Heide; Harald Räcke; Christian Scheideler; Christian Sohler (ESA, 2003)

Data management and routing in general networks. - Harald Räcke (Ausgezeichnete Informatikdissertationen, 2003)

A practical algorithm for constructing oblivious routing schemes. - Marcin Bienkowski; Miroslaw Korzeniowski; Harald Räcke (SPAA, 2003)

Randomized Pursuit-Evasion In Graphs. - Micah Adler; Harald Räcke; Naveen Sivadasan; Christian Sohler; Berthold Vöcking (Comb. Probab. Comput., 2003)

Approximation Algorithms for Data Management in Networks. - Christof Krick; Harald Räcke; Matthias Westermann (Theory Comput. Syst., 2003)

Data management and routing in general networks. - Harald Räcke (2003)

Reducing State Changes with a Pipeline Buffer. - Jens Krokowski; Harald Räcke; Christian Sohler; Matthias Westermann (VMV, 2004)

Optimal oblivious routing in polynomial time. - Yossi Azar; Edith Cohen; Amos Fiat; Haim Kaplan; Harald Räcke (J. Comput. Syst. Sci., 2004)

Approximation algorithms for low-distortion embeddings into low-dimensional spaces. - Mihai Badoiu; Kedar Dhamdhere; Anupam Gupta 001; Yuri Rabinovich; Harald Räcke; R. Ravi 001; Anastasios Sidiropoulos (SODA, 2005)

Distributed online call control on general networks. - Harald Räcke; Adi Rosén (SODA, 2005)

Oblivious routing in directed graphs with random demands. - Mohammad Taghi Hajiaghayi; Jeong Han Kim; Tom Leighton; Harald Räcke (STOC, 2005)

Datenverwaltung und Routing in allgemeinen Netzwerken. - Harald Räcke (it Inf. Technol., 2005)

Improved embeddings of graph metrics into random trees. - Kedar Dhamdhere; Anupam Gupta 001; Harald Räcke (SODA, 2006)

Oblivious network design. - Anupam Gupta 001; Mohammad Taghi Hajiaghayi; Harald Räcke (SODA, 2006)

New lower bounds for oblivious routing in undirected graphs. - Mohammad Taghi Hajiaghayi; Robert D. Kleinberg; Frank Thomson Leighton; Harald Räcke (SODA, 2006)

An O(sqrt(n))-approximation algorithm for directed sparsest cut. - Mohammad Taghi Hajiaghayi; Harald Räcke (Inf. Process. Lett., 2006)

Balanced Graph Partitioning. - Konstantin Andreev; Harald Räcke (Theory Comput. Syst., 2006)

Oblivious routing on node-capacitated and directed graphs. - Mohammad Taghi Hajiaghayi; Robert D. Kleinberg; Harald Räcke; Tom Leighton (ACM Trans. Algorithms, 2007)

Minimizing average latency in oblivious routing. - Prahladh Harsha; Thomas P. Hayes; Hariharan Narayanan; Harald Räcke; Jaikumar Radhakrishnan (SODA, 2008)

Optimal hierarchical decompositions for congestion minimization in networks. - Harald Räcke (STOC, 2008)

Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. - Shuchi Chawla 001; Anupam Gupta 001; Harald Räcke (ACM Trans. Algorithms, 2008)

Survey on Oblivious Routing Strategies. - Harald Räcke (CiE, 2009)

Oblivious Routing for the Lp-norm. - Matthias Englert; Harald Räcke (FOCS, 2009)

Oblivious interference scheduling. - Alexander Fanghänel; Thomas Kesselheim; Harald Räcke; Berthold Vöcking (PODC, 2009)

Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. - Simon Fischer 001; Harald Räcke; Berthold Vöcking (SIAM J. Comput., 2010)

Reordering Buffers for General Metric Spaces. - Matthias Englert; Harald Räcke; Matthias Westermann (Theory Comput., 2010)

Approximation Algorithms for Time-Constrained Scheduling on Line Networks. - Harald Räcke; Adi Rosén (Theory Comput. Syst., 2011)

Optimal online buffer scheduling for block devices. - Anna Adamaszek; Artur Czumaj; Matthias Englert; Harald Räcke (STOC, 2012)

Smoothed analysis of left-to-right maxima with applications. - Valentina Damerow; Bodo Manthey; Friedhelm Meyer auf der Heide; Harald Räcke; Christian Scheideler; Christian Sohler; Till Tantau (ACM Trans. Algorithms, 2012)

Improved Guarantees for Tree Cut Sparsifiers. - Harald Räcke; Chintan Shah (ESA, 2014)

Online Stochastic Reordering Buffer Scheduling. - Hossein Esfandiari; MohammadTaghi Hajiaghayi; Mohammad Reza Khani; Vahid Liaghat; Hamid Mahini; Harald Räcke (ICALP (1), 2014)

Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. - Harald Räcke; Chintan Shah; Hanjo Täubig (SODA, 2014)

Vertex Sparsifiers: New Results from Old Techniques. - Matthias Englert; Anupam Gupta 001; Robert Krauthgamer; Harald Räcke; Inbal Talgam-Cohen; Kunal Talwar (SIAM J. Comput., 2014)

Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. - Sina Dehghani; Soheil Ehsani; Mohammad Taghi Hajiaghayi; Vahid Liaghat; Harald Räcke; Saeed Seddighin (ICALP, 2016)

Improved Approximation Algorithms for Balanced Partitioning Problems. - Harald Räcke; Richard Stotz (STACS, 2016)

Vertex Sparsification in Trees. - Gramoz Goranci; Harald Räcke (WAOA, 2016)

Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces. - Matthias Kohler; Harald Räcke (ICALP, 2017)

Reordering Buffers with Logarithmic Diameter Dependency for Trees. - Matthias Englert; Harald Räcke (SODA, 2017)

Online Degree-Bounded Steiner Network Design. - Sina Dehghani; Soheil Ehsani; MohammadTaghi Hajiaghayi; Vahid Liaghat; Harald Räcke (CoRR, 2017)

Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. - Harald Räcke; Roy Schwartz 002; Richard Stotz (SPAA, 2018)

Compact Oblivious Routing. - Harald Räcke; Stefan Schmid 001 (ESA, 2019)

Polylogarithmic Guarantees for Generalized Reordering Buffer Management. - Matthias Englert; Harald Räcke; Richard Stotz (FOCS, 2019)

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. - Anastasios Sidiropoulos; Mihai Badoiu; Kedar Dhamdhere; Anupam Gupta 001; Piotr Indyk; Yuri Rabinovich; Harald Räcke; R. Ravi 001 (SIAM J. Discret. Math., 2019)

An O(log k)-Competitive Algorithm for Generalized Caching. - Anna Adamaszek; Artur Czumaj; Matthias Englert; Harald Räcke (ACM Trans. Algorithms, 2019)

Compact Oblivious Routing in Weighted Graphs. - Philipp Czerner; Harald Räcke (ESA, 2020)

Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time. - Tobias Forner; Harald Räcke; Stefan Schmid 001 (APOCS, 2021)

It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. - Robin Münk; Matthias Rost; Harald Räcke; Stefan Schmid 001 (Networking, 2021)

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. - Gramoz Goranci; Harald Räcke; Thatchaphol Saranurak; Zihan Tan (SODA, 2021)

Tight Bounds for Online Graph Partitioning. - Monika Henzinger; Stefan Neumann 003; Harald Räcke; Stefan Schmid 001 (SODA, 2021)

Approximate Dynamic Balanced Graph Partitioning. - Harald Räcke; Stefan Schmid 001; Ruslan Zabrodin (SPAA, 2022)

Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. - Bernhard Haeupler; Harald Räcke; Mohsen Ghaffari 001 (STOC, 2022)

Almost Tight Bounds for Reordering Buffer Management. - Anna Adamaszek; Artur Czumaj; Matthias Englert; Harald Räcke (SIAM J. Comput., 2022)

Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. - Harald Räcke; Stefan Schmid 001; Ruslan Zabrodin (SPAA, 2023)

Dynamic Maintenance of Monotone Dynamic Programs and Applications. - Monika Henzinger; Stefan Neumann 003; Harald Räcke; Stefan Schmid 001 (STACS, 2023)

Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search. - Harald Räcke; Stefan Schmid 001; Radu Vintan (INFOCOM, 2024)

Electrical Flows for Polylogarithmic Competitive Oblivious Routing. - Gramoz Goranci; Monika Henzinger; Harald Räcke; Sushant Sachdeva; A. R. Sricharan (ITCS, 2024)

Expander Hierarchies for Normalized Cuts on Graphs. - Kathrin Hanauer; Monika Henzinger; Robin Münk; Harald Räcke; Maximilian Vötsch (KDD, 2024)

XCut/XCut v1.0.0. - Kathrin Hanauer; Monika Henzinger; Robin Münk; Harald Räcke; Maximilian Vötsch (Zenodo, 2024)

Incremental Approximate Maximum Flow via Residual Graph Sparsification. - Gramoz Goranci; Monika Henzinger; Harald Räcke; A. R. Sricharan (ICALP, 2025)

Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model. - Harald Räcke; Stefan Schmid 001; Ruslan Zabrodin (SPAA, 2025)