Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke, Harald (2012) An O(log k)-competitive algorithm for generalized caching. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17-19 Jan 2012. Published in: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1681-1689.

Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke, Harald (2011) Almost tight bounds for reordering buffer management. In: STOC'11 Symposium on Theory of Computing Conference (Co-located with FCRC 2011), San Jose, CA, USA, 6-8 Jun 2011. Published in: STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing pp. 607-616.

Fischer, Simon, Raecke, Harald and Voecking, Berthold. (2010) Fast convergence to wardrop equilibria by adaptive sampling methods. SIAM Journal on Computing, Vol.39 (No.8). pp. 3700-3735. ISSN 0097-5397

Englert, Matthias, Raecke, Harald and Westermann, Matthias. (2010) Reordering buffers for general metric spaces. Theory of Computing, Vol.6 (No.1). pp. 27-46. ISSN 1557-2862

Englert, Matthias, Gupta, Anupam, Krauthgamer, Robert, Raecke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2010) Vertex sparsifiers : new results from old techniques. In: 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010)/14th International Workshop on Randomization and Computation (RANDOM 2010), Univ Politecnica Catalunya (UPC), Barcelona, Spain, 01-03 Sep 2010. Published in: Lecture Notes in Computer Science, Vol.6302 pp. 152-165.

Englert, Matthias, Gupta, A., Krauthgamer, Robert, Räcke, Harald, Talgam-Cohen, Inbal and Talwar, Kunal (2010) Vertex sparsifiers : new results from old techniques. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science (6302). Springer Verlag, pp. 152-165. ISBN 9783642153686

Englert, Matthias and Räcke, Harald (2009) Oblivious routing for the Lp-norm. In: 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, GA, October 25-27, 2009. Published in: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science pp. 32-40.

Räcke, Harald and Rosen, Adi (2009) Approximation algorithms for time-constrained scheduling on line networks. In: 21st ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Canada, August 11-13, 2009. Published in: SPAA '09: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architecture pp. 337-346.

Englert, Matthias and Räcke, Harald (2009) Oblivious routing for the L-p-norm. In: 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, GA, October 25-27, 2009. Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science pp. 32-40.

Räcke, Harald (2009) Survey on oblivious routing strategies. In: 5th Conference on Computability in Europe (CiE 2009), Heidelberg, Germany, July 19-24, 2009. Published in: Lecture Notes in Computer Science, Vol.5635 pp. 419-429.

Chawla, Shuchi, Gupta, Anupam and Raecke, Harald. (2008) Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Transactions on Algorithms , Vol.4 (No.2). ISSN 1549-6325

Raecke, Harald (2008) Optimal Hierarchical Decompositions for Congestion Minimization in Networks. In: 40th Annual ACM International Symposium on Theory of Computing, Victoria, Canada, May 17-20, 2008. Published in: Annual Proceedings of the 40th ACM Symposium on the Theory of Computing pp. 255-263.