Harald Räcke - RankMe

93 papers A* 31A 9B 12C 1Journal 34Unranked 4

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