Harald Räcke

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 35

Top Venues

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
Expander Hierarchies for Normalized Cuts on Graphs. KDD (2024)
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
Expander Hierarchies for Normalized Cuts on Graphs. CoRR (2024)
Harald Räcke, Stefan Schmid, Radu Vintan
Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search. INFOCOM (2024)
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. ITCS (2024)
Harald Räcke, Stefan Schmid, Ruslan Zabrodin
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. SPAA (2023)
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. CoRR (2023)
Harald Räcke, Stefan Schmid, Ruslan Zabrodin
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. CoRR (2023)
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Dynamic Maintenance of Monotone Dynamic Programs and Applications. CoRR (2023)
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Dynamic Maintenance of Monotone Dynamic Programs and Applications. STACS (2023)
Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. STOC (2022)
Harald Räcke, Stefan Schmid, Ruslan Zabrodin
Approximate Dynamic Balanced Graph Partitioning. SPAA (2022)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Almost Tight Bounds for Reordering Buffer Management. SIAM J. Comput. 51 (3) (2022)
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Tight Bounds for Online Graph Partitioning. SODA (2021)
Robin Münk, Matthias Rost, Stefan Schmid, Harald Räcke
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. CoRR (2021)
Robin Münk, Matthias Rost, Harald Räcke, Stefan Schmid
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints. Networking (2021)
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. SODA (2021)
Tobias Forner, Harald Räcke, Stefan Schmid
Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time. APOCS (2021)
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR (2020)
Philipp Czerner, Harald Räcke
Compact Oblivious Routing in Weighted Graphs. CoRR (2020)
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Tight Bounds for Online Graph Partitioning. CoRR (2020)
Philipp Czerner, Harald Räcke
Compact Oblivious Routing in Weighted Graphs. ESA (2020)
Matthias Englert, Harald Räcke, Richard Stotz
Polylogarithmic Guarantees for Generalized Reordering Buffer Management. FOCS (2019)
Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33 (1) (2019)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
)-Competitive Algorithm for Generalized Caching. ACM Trans. Algorithms 15 (1) (2019)
Harald Räcke, Stefan Schmid
Compact Oblivious Routing. ESA (2019)
Harald Räcke, Roy Schwartz, Richard Stotz
Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. SPAA (2018)
Harald Räcke, Stefan Schmid
Compact Oblivious Routing. CoRR (2018)
Matthias Englert, Harald Räcke
Reordering Buffers with Logarithmic Diameter Dependency for Trees. SODA (2017)
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke
Online Degree-Bounded Steiner Network Design. CoRR (2017)
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. CoRR (2017)
Matthias Kohler, Harald Räcke
Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces. ICALP (2017)
Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. ICALP (2016)
Harald Räcke, Richard Stotz
Improved Approximation Algorithms for Balanced Partitioning Problems. STACS (2016)
Gramoz Goranci, Harald Räcke
Vertex Sparsification in Trees. CoRR (2016)
Gramoz Goranci, Harald Räcke
Vertex Sparsification in Trees. WAOA (2016)
Harald Räcke, Chintan Shah, Hanjo Täubig
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. SODA (2014)
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
Vertex Sparsifiers: New Results from Old Techniques. SIAM J. Comput. 43 (4) (2014)
Harald Räcke, Chintan Shah
Improved Guarantees for Tree Cut Sparsifiers. ESA (2014)
Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke
Online Stochastic Reordering Buffer Scheduling. ICALP (1) (2014)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Optimal online buffer scheduling for block devices. STOC (2012)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
)-competitive algorithm for generalized caching. SODA (2012)
Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau
Smoothed analysis of left-to-right maxima with applications. ACM Trans. Algorithms 8 (3) (2012)
Harald Räcke, Adi Rosén
Approximation Algorithms for Time-Constrained Scheduling on Line Networks. Theory Comput. Syst. 49 (4) (2011)
Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke
Almost tight bounds for reordering buffer management. STOC (2011)
Simon Fischer, Harald Räcke, Berthold Vöcking
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods. SIAM J. Comput. 39 (8) (2010)
Matthias Englert, Harald Räcke, Matthias Westermann
Reordering Buffers for General Metric Spaces. Theory Comput. 6 (1) (2010)
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM (2010)
Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
Vertex Sparsifiers: New Results from Old Techniques CoRR (2010)
Harald Räcke
Survey on Oblivious Routing Strategies. CiE (2009)
Matthias Englert, Harald Räcke
Oblivious Routing for the Lp-norm. FOCS (2009)
Harald Räcke, Adi Rosén
Approximation algorithms for time-constrained scheduling on line networks. SPAA (2009)
Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking
Oblivious interference scheduling. PODC (2009)
Harald Räcke
Optimal hierarchical decompositions for congestion minimization in networks. STOC (2008)
Shuchi Chawla, Anupam Gupta, Harald Räcke
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Trans. Algorithms 4 (2) (2008)
Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan
Minimizing average latency in oblivious routing. SODA (2008)
Matthias Englert, Harald Räcke, Matthias Westermann
Reordering buffers for general metric spaces. STOC (2007)
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton
Oblivious routing on node-capacitated and directed graphs. ACM Trans. Algorithms 3 (4) (2007)
Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke
Oblivious network design. SODA (2006)
Simon Fischer, Harald Räcke, Berthold Vöcking
Fast convergence to Wardrop equilibria by adaptive sampling methods. STOC (2006)
Mohammad Taghi Hajiaghayi, Harald Räcke
An O(sqrt(n))-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97 (4) (2006)
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke
New lower bounds for oblivious routing in undirected graphs. SODA (2006)
Konstantin Andreev, Harald Räcke
Balanced Graph Partitioning. Theory Comput. Syst. 39 (6) (2006)
Kedar Dhamdhere, Anupam Gupta, Harald Räcke
Improved embeddings of graph metrics into random trees. SODA (2006)
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke
Oblivious routing on node-capacitated and directed graphs. SODA (2005)
Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos
Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA (2005)
Harald Räcke, Adi Rosén
Distributed online call control on general networks. SODA (2005)
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke
Oblivious routing in directed graphs with random demands. STOC (2005)
Shuchi Chawla, Anupam Gupta, Harald Räcke
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA (2005)
Harald Räcke
Datenverwaltung und Routing in allgemeinen Netzwerken. it Inf. Technol. 47 (4) (2005)
Konstantin Andreev, Harald Räcke
Balanced graph partitioning. SPAA (2004)
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. 69 (3) (2004)
Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann
Reducing State Changes with a Pipeline Buffer. VMV (2004)
Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke
A practical algorithm for constructing oblivious routing schemes. SPAA (2003)
Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
Randomized Pursuit-Evasion In Graphs. Comb. Probab. Comput. 12 (3) (2003)
Harald Räcke
Data management and routing in general networks. Ausgezeichnete Informatikdissertationen (2003)
Christof Krick, Harald Räcke, Matthias Westermann
Approximation Algorithms for Data Management in Networks. Theory Comput. Syst. 36 (5) (2003)
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
Optimal oblivious routing in polynomial time. STOC (2003)
Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler
Smoothed Motion Complexity. ESA (2003)
Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory Comput. Syst. 35 (2) (2002)
Harald Räcke, Christian Sohler, Matthias Westermann
Online Scheduling for Sorting Buffers. ESA (2002)
Harald Räcke
Minimizing Congestion in General Networks. FOCS (2002)
Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
Randomized Pursuit-Evasion in Graphs. ICALP (2002)
Christof Krick, Harald Räcke, Matthias Westermann
Approximation algorithms for data management in networks. SPAA (2001)
Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann
Data management in hierarchical bus networks. SPAA (2000)
Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. SPAA (1999)

Harald Räcke.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Harald Räcke