Publications

Books

  1. Algorithmics of Large and Complex Networks.
    volume 5515 of Lecture Notes in Computer Science. Springer, 2009.
    Jointly edited with Jürgen Lerner and Katharina A. Zweig.
  2. Taschenbuch der Algorithmen.
    Springer, 2008.
    Jointly edited with Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, and Heribert Vollmer.
    [ html ]
  3. Algorithmic Methods for Railway Optimization.
    volume 4359 of Lecture Notes in Computer Science. Springer, 2007.
    Joint work with Frank Geraets, Leo G. Kroon, Anita Schöbel, and Christos Zaroliagis.
  4. Algorithms for Sensor and Ad Hoc Networks.
    volume 4621 of Lecture Notes in Computer Science. Springer, 2007.
    Jointly edited with Roger Wattenhofer.
    [ html ]
  5. Drawing Graphs: Methods and Models.
    volume 2025 of Lecture Notes in Computer Science. Springer, 2001.
    Jointly edited with Michael Kaufmann.
    [ html ]

Conference proceedings

  1. Special issue of the ACM Journal on Experimental Algorithms devoted to selected papers from ALENEX 2008.
    volume 14. ACM Press, May 2009.
    Jointly edited with Ian Munro.
  2. Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08).
    SIAM, April 2008.
    Jointly edited with Ian Munro.
  3. Ausgezeichnete Informatikdissertationen 2007.
    GI-Edition-Lecture Notes in Informatics (LNI), 2008.
    Jointly edited with Abraham Bernstein, Thomas Dreier, Steffen Hölldober, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, and Harald Störrle.
  4. Special issue of the Journal of Graph Algorithms and Applications devoted to the 14th International Symposium on Graph Drawing (GD'06).
    volume 12, 2008.
    Jointly edited with Michael Kaufmann.
  5. Proceedings of the 14th International Symposium on Graph Drawing (GD'06).
    volume 4372 of Lecture Notes in Computer Science. Springer, January 2007.
    Jointly edited with Michael Kaufmann.
  6. Ausgezeichnete Informatikdissertationen 2006.
    volume D-7 of GI-Edition-Lecture Notes in Informatics (LNI), 2007.
    Jointly edited with Abraham Bernstein, Thomas Dreier, Steffen Hölldober, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Rüdiger Reischuk, Dietmar Saupe, and Myra Spiliopoulou.
  7. Ausgezeichnete Informatikdissertationen 2005.
    volume D-6 of GI-Edition-Lecture Notes in Informatics (LNI), 2006.
    Jointly edited with Abraham Bernstein, Thomas Dreier, Steffen Hölldober, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, and Myra Spiliopoulou.
  8. Ausgezeichnete Informatikdissertationen 2004.
    volume D-5 of GI-Edition-Lecture Notes in Informatics (LNI), 2005.
    Jointly edited with Thomas Dreier, Oliver Günther, Steffen Hölldober, Klaus-Peter Löhr, Paul Molitor, Rüdiger Reischuk, and Dietmar Saupe.
  9. Ausgezeichnete Informatikdissertationen 2003.
    volume D-4 of GI-Edition-Lecture Notes in Informatics (LNI), 2004.
    Jointly edited with Heinz Beilner, Thomas Dreier, Markus Gross, Oliver Günther, Steffen Hölldober, Klaus-Peter Löhr, and Rüdiger Reischuk.
  10. Special issue of the Journal of Discrete Algorithms devoted to the 26th Workshop on Graph Theoretic Concepts in Computer Science(WG'00).
    volume 2. Elsevier B.V., 2004.
    Jointly edited with Ulrik Brandes.
  11. Ausgezeichnete Informatikdissertationen 2002.
    volume D-3 of GI-Edition-Lecture Notes in Informatics (LNI), 2003.
    Jointly edited with Heinz Beilner, Herbert Fiedler, Markus Gross, Oliver Günther, Steffen Hölldober, Günter Hotz, Klaus-Peter Löhr, and Rüdiger Reischuk.
  12. Proceedings of the 2nd Workshop on Algorithmic MeThods and Models for Optimization of RailwayS (ATMOS'02).
    volume 66 of Electronic Notes in Theoretical Computer Science. Elsevier B.V., 2002.

  13. Ausgezeichnete Informatikdissertationen 2001.
    volume D-2 of GI-Edition-Lecture Notes in Informatics (LNI), 2002.
    Jointly edited with Heinz Beilner, Herbert Fiedler, Oliver Günther, Steffen Hölldober, Günter Hotz, Peter Liggesmeyer, Klaus-Peter Löhr, and Rüdiger Reischuk.
  14. Special issue of the ACM Journal on Experimental Algorithms devoted to the 4th Workshop on Algorithm Engineering (WAE'00).
    volume 7, 2002.
    Jointly edited with Stefan Näher.
  15. Ausgezeichnete Informatikdissertationen 2000.
    volume D-1 of GI-Edition-Lecture Notes in Informatics (LNI), 2001.
    Jointly edited with Herbert Fiedler, Werner Grass, Oliver Günther, Steffen Hölldober, Günter Hotz, Rüdiger Reischuk, and Bernhard Seeger.
  16. Special issue of the Journal of Graph Algorithms and Applications devoted to the Dagstuhl Workshop on Graph Algorithms and Applications (1998).
    volume 5, 2001.
    Jointly edited with Takao Nishizeki and Roberto Tamassia.
  17. Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00).
    volume 1982 of Lecture Notes in Computer Science. Springer, 2001.
    Jointly edited with Stefan Näher.
  18. Ausgezeichnete Informatikdissertationen 1999.
    Teubner, 2000.
    Jointly edited with Herbert Fiedler, Oliver Günther, Werner Grass, Steffen Hölldober, Günter Hotz, Rüdiger Reischuk, and Bernhard Seeger.
  19. Discrete Algorithms Engineering, special issue of the journal Software-Practice and Experience.
    volume 30. Wiley, 2000.
    Jointly edited with Karsten Weihe.
  20. Special issue of the journal Algorithmica devoted to the Dagstuhl Workshop on Graph Algorithms and Applications (1996).
    volume 26, 2000.
    Jointly edited with Takao Nishizeki and Roberto Tamassia.
  21. Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'00).
    volume 1928 of Lecture Notes in Computer Science. Springer, 2000.
    Jointly edited with Ulrik Brandes.

Book chapters

  1. Engineering Label-Constrained Shortest-Path Algorithms.
    In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book. American Mathematical Society, 2009.
    to appear.
    Joint work with Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, and Madhav V. Marathe.
  2. Group-Level Analysis and Visualization of Social Networks.
    In: Algorithmics of Large and Complex Networks, volume 5515 of Lecture Notes in Computer Science, pages 330-358. Springer, 2009.
    Joint work with Michael Baur, Ulrik Brandes, and Jürgen Lerner.
    [ pdf ]
  3. High-Performance Multi-Level Routing.
    In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book, pages 73-92. American Mathematical Society, 2009.
    Joint work with Daniel Delling, Martin Holzer, Kirill Müller, and Frank Schulz.
    [ pdf ]
  4. Engineering Time-Expanded Graphs for Faster Timetable Information.
    In: Robust and Online Large-Scale Optimization, volume 5868 of Lecture Notes in Computer Science, pages 182-206. Springer, 2009.
    Joint work with Daniel Delling and Thomas Pajor.
    [ pdf ]
  5. Engineering Route Planning Algorithms.
    In: Algorithmics of Large and Complex Networks, volume 5515 of Lecture Notes in Computer Science, pages 117-139. Springer, 2009.
    Joint work with Daniel Delling, Peter Sanders, and Dominik Schultes.
    [ pdf ]
  6. Highway Hierarchies Star.
    In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74 of DIMACS Book, pages 141-174. American Mathematical Society, 2009.
    Joint work with Daniel Delling, Peter Sanders, and Dominik Schultes.
    [ pdf ]
  7. Time-Dependent Route Planning.
    In: Robust and Online Large-Scale Optimization, volume 5868 of Lecture Notes in Computer Science, pages 207-230. Springer, 2009.
    Joint work with Daniel Delling.
    [ pdf ]
  8. Multi-scale Anchor-free Distributed Positioning in Sensor Networks.
    In: Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects, volume 7 of Lecture Notes in Electrical Engineering. Springer, October 2008.
    Joint work with Bastian Katz.
    [ html ]
  9. Maximale Flüsse - Die ganze Stadt will zum Stadion.
    In: Taschenbuch der Algorithmen, pages 361-372. Springer, 2008.
    Joint work with Steffen Mecke and Robert Görke.
    [ html | pdf ]
  10. Visualizing Large and Complex Networks.
    In: Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science, volume 2 of Complex Systems and Interdisciplinary Science, pages 115-132. World Scientific Publishing, 2007.
    Joint work with Marco Gaertler.
  11. Timetable Information: Models and Algorithms.
    In: Algorithmic Methods for Railway Optimization, volume 4359 of Lecture Notes in Computer Science, pages 67-90. Springer, 2007.
    Joint work with Matthias Müller-Hannemann, Frank Schulz, and Christos Zaroliagis.
  12. visone - Analysis and Visualization of Social Networks.
    In: Graph Drawing Software, pages 321-340. Springer, 2003.
    Joint work with Ulrik Brandes.
    [ html ]
  13. Über das Zeichnen von Graphen.
    In: Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik, pages 58-80. Vieweg, 1999.
    Joint work with Ulrik Brandes.
  14. Minimal spannende Bäume.
    In: Prinzipien des Multimediales Lehrbuch Algorithmenentwurfs. Multimediales Lehrbuch, pages 173-182. Spektrum Akademischer Verlag, 1998.
  15. Combinatorial Topics in VLSI Design, Annotated Bibliography.
    In: Annotated Bibliographies in Combinatorial Optimization, pages 429-444. Wiley, 1997.
    Joint work with Rolf H. Möhring.
  16. VLSI Network Design: a Survey.
    In: Handbooks in Operations Research/Management Science, Volume on Networks, pages 625-712. North-Holland, 1995.
    Joint work with Rolf H. Möhring and Frank Wagner.
  17. Survey on Efficient Algorithms for Disjoint Paths Problems in Planar Graphs.
    In: DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, Volume 20 on the Year of Combinatorial Optimization, pages 295-354. American Mathematical Society, 1995.
    Joint work with Heike Ripphausen-Lipa and Karsten Weihe.

Journal articles

  1. The Continuous Stop Location Problem in Public Transportation Networks.
    Asia-Pacific Journal of Operational Research (APJOR), 26(1):13-30, February 2009.
    Joint work with Anita Schöbel, Horst W. Hamacher, and Annegret Liebers.
  2. Experimental Study on Speed-Up Techniques for Timetable Information Systems.
    Networks, 2009.
    to appear.
    Joint work with Reinhard Bauer and Daniel Delling.
    [ pdf ]
  3. Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
    ACM Journal of Experimental Algorithmics, 13:2.5:1-2.5:26, December 2008.
    Joint work with Martin Holzer and Frank Schulz.
    [ pdf ]
  4. Augmenting k-Core Generation with Preferential Attachment.
    Networks and Heterogeneous Media, 3(2):277-294, June 2008.
    Joint work with Michael Baur, Marco Gaertler, Robert Görke, and Marcus Krug.
    [ html | pdf ]
  5. On Modularity Clustering.
    IEEE Transactions on Knowledge and Data Engineering, 20(2):172-188, February 2008.
    Joint work with Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Höfer, and Zoran Nikoloski.
    [ html ]
  6. Modelling Overlay-Underlay Correlations Using Visualization.
    Telektronikk, 104(1):114-125, 2008.
    Joint work with Vinay Aggarwal, Anja Feldmann, Marco Gaertler, and Robert Görke.
  7. Engineering Graph Clustering: Models and Experimental Evaluation.
    ACM Journal of Experimental Algorithmics, 12(1.1):1-26, 2007.
    Joint work with Ulrik Brandes and Marco Gaertler.
    [ html | pdf ]
  8. Efficient Models for Timetable Information in Public Transportation Systems.
    ACM Journal of Experimental Algorithmics, 12:Article 2.4, 2007.
    Joint work with Evangelia Pyrga, Frank Schulz, and Christos Zaroliagis.
  9. Completely Connected Clustered Graphs.
    Journal of Discrete Algorithms, 4(2):313-323, 2006.
    Joint work with Sabine Cornelsen.
    [ html ]
  10. Combining Speed-up Techniques for Shortest-Path Computations.
    ACM Journal of Experimental Algorithmics, 10:2.5, 2006.
    Joint work with Martin Holzer, Frank Schulz, and Thomas Willhalm.
  11. Partitioning Graphs to Speedup Dijkstra's Algorithm.
    ACM Journal of Experimental Algorithmics, 11:2.8, 2006.
    Joint work with Rolf H. Möhring, Heiko Schilling, Birk Schütz, and Thomas Willhalm.
  12. Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles.
    Journal of Graph Algorithms and Applications, 9(1):99-115, 2005.
    Joint work with Ulrik Brandes and Sabine Cornelsen.
    [ pdf ]
  13. Approximating Clustering Coefficient and Transitivity.
    Journal of Graph Algorithms and Applications, 9(2):265-275, 2005.
    Joint work with Thomas Schank.
    [ html | pdf ]
  14. Geometric Containers for Efficient Shortest-Path Computation.
    ACM Journal of Experimental Algorithmics, 10:1.3, 2005.
    Joint work with Thomas Willhalm and Christos Zaroliagis.
  15. How to Draw the Minimum Cuts of a Planar Graph.
    Computational Geometry: Theory and Applications, 29:117-133, 2004.
    Joint work with Ulrik Brandes, Sabine Cornelsen, and Christian Fiess.
  16. Generating Node Coordinates for Shortest-Path Computations in Transportation Networks.
    ACM Journal of Experimental Algorithmics, 9:1-16, 2004.
    Joint work with Ulrik Brandes, Frank Schulz, and Thomas Willhalm.
    [ html ]
  17. Netzwerkvisualisierung.
    it-Information Technology, 46(3):129-134, 2004.
    Joint work with Ulrik Brandes.
  18. Drawing Graphs on Two and Three Lines.
    Journal of Graph Algorithms and Applications, 8(2):161-177, 2004.
    Joint work with Sabine Cornelsen and Thomas Schank.
    [ pdf ]
  19. Communicating Centrality in Policy Network Drawings.
    IEEE Transactions on Visualization and Computer Graphics, 9(2):241-253, 2003.
    Joint work with Ulrik Brandes and Patrick Kenis.
    [ pdf ]
  20. Additive Tree Spanners.
    SIAM Journal on Discrete Mathematics, 17(2):332-340, 2003.
    Joint work with Dieter Kratsch, Hoang-Oanh Le, Haiko Müller, and Erich Prisner.
    [ html ]
  21. DFG-Schwerpunktprogramm Algorithmik großer und komplexer Netzwerke.
    it-Information Technology, 3:162-169, 2003.
  22. Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections.
    Journal of Social Structure, 2(4), October 2001.
    Joint work with Ulrik Brandes and Jörg Raab.
    [ pdf ]
  23. Dynamic Web Structures in 3D.
    Journal of Graph Algorithms and Applications, 4(3):183-191, 2000.
    Joint work with Ulrik Brandes, Vanessa Kääb, Andres Löh, and Thomas Willhalm.
    [ html ]
  24. A Linear Time Algorithm for the Arc Disjoint Menger Problem in Directed Planar Graphs.
    Algorithmica, 28(1):16-36, 2000.
    Joint work with Ulrik Brandes.
    [ html | pdf ]
  25. Using Graph Layout to Visualize Train Connection Data.
    Journal of Graph Algorithms and Applications, 4(3):135-155, 2000.
    Joint work with Ulrik Brandes.
    [ html ]
  26. Visualisierung von Verkehrsdaten.
    DMV Mitteilungen, 1-2000:11-16, 2000.
    Joint work with Ulrik Brandes.
  27. The Complexity of Partial Order Properties.
    ORDER, 17(2):179-193, 2000.
    Joint work with Stefan Felsner, Ravi Kant, and C. Pandu Rangan.
  28. On the Hardness of Recognizing Bundles in Time Table Graphs.
    International Journal of Foundations of Computer Science, 11(3):467-484, 2000.
    Joint work with Annegret Liebers and Karsten Weihe.
  29. Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
    ACM Journal of Experimental Algorithmics, 5:12, 2000.
    Joint work with Frank Schulz and Karsten Weihe.
  30. Explorations into the Visualization of Policy Networks.
    Journal of Theoretical Politics, 11(1):75-106, 1999.
    Joint work with Ulrik Brandes, Patrick Kenis, Jörg Raab, and Volker Schneider.
    [ pdf ]
  31. PlaNet-A Software Package for Algorithms and Heuristics on Planar Networks.
    Discrete Applied Mathematics, 92:91-110, 1999.
    Joint work with Ulrik Brandes, Gabriele Neyer, Wolfram Schlickenrieder, and Karsten Weihe.
    [ pdf ]
  32. Lower-Power and Min-Crosstalk Channel Routing for Deep Submicron Layout Design.
    VLSI Design, 10(1), 1999.
    Joint work with J. D. Cho and S. H. Nam.
  33. Wiring Planar Layouts.
    Computational Geometry, 14:255-273, 1999.
    Joint work with Ruth Kuchem.
  34. The vertex-disjoint Menger problem in planar graphs.
    SIAM Journal on Computing, 26(2):331-349, 1997.
    Joint work with Heike Ripphausen-Lipa and Karsten Weihe.
  35. C++ im Nebenfachstudium: Konzepte und Erfahrungen.
    Informatik Spektrum, 19(5):262-265, October 1996.
    Joint work with Annegret Liebers and Karsten Weihe.
    [ html | pdf ]
  36. Optimizing Area for Three-Layer Knock-Knee Channel Routing.
    Algorithmica, 15(5):496-519, May 1996.
    Joint work with Ruth Kuchem and Frank Wagner.
    [ html | pdf ]
  37. Terra incognita. (Rezension des dtv-Atlas zur Informatik).
    Informatik Spektrum, 19(1):44-45, February 1996.
    Joint work with Friedemann Mattern.
    [ pdf ]
  38. Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.
    International Journal of Foundations of Computer Science, 7(2):95-110, 1996.
    Joint work with Heike Ripphausen-Lipa and Karsten Weihe.
  39. Efficient Parallel Matrix Inversion on Interconnection Networks.
    Journal of Parallel and Distributed Computing, 34(2):196-201, 1996.
    Joint work with Andreas Schikarski.
  40. A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.
    Combinatorica, 15(1):135-150, March 1995.
    Joint work with Karsten Weihe.
    [ html | pdf ]
  41. Wiring Knock-Knee Layouts: A Global Approach.
    IEEE Transactions on Computers, 43(5):581-489, May 1994.
    Joint work with Majid Sarrafzadeh, Frank Wagner, and Karsten Weihe.
    [ html | pdf ]
  42. Book review of Paths, Flows, and VLSI-Layout by A. Schrijver and L. Lovasz (B. Korte, H. J. Promel and R. L. Graham (eds.)).
    Mathematical Methods of Operations Research, 38(1):102-103, February 1993.
    [ html | pdf ]
  43. Routing through a Dense Channel with Minimum Total Wire Length.
    Journal of Algorithms, 15(2):267-283, 1993.
    Joint work with Michael Formann and Frank Wagner.
    [ html ]
  44. Optimal Routing Through Dense Chanels.
    International Journal of Computational Geometry and Applications, 3(3):269-289, 1993.
  45. Simple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs.
    CWI Quarterly, 6(3):219-240, 1993.
    [ html ]
  46. Modeling Hypergraphs by Graphs with the Same Mincut Properties.
    Information Processing Letters, 45(4):171-175, 1993.
    Joint work with Edmund Ihler and Frank Wagner.
  47. Book Review of Computational Graph Theory by Gottfried Tinhofer, Ernst Mayr, Hartmut Noltemeier and Maciej Syslo (eds.), Springer-Verlag, 1990, 282 p.
    Mathematical Methods of Operations Research, 36(1):106-109, 1992.
    Book Review.
  48. An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.
    Discrete Applied Mathematics, 40(1):73-81, 1992.
    Joint work with Frank Wagner.
    [ html ]
  49. α-Vertex Separator is NP-Hard Even for 3-Regular Graphs.
    Computing, 46:343-353, 1991.
    Joint work with Rudolf Müller.
  50. A Generalization of the Zero-One Principle for Sorting Algorithms.
    Discrete Applied Mathematics, 30:265-273, 1991.
    Joint work with Frank Wagner.
    [ html ]
  51. Decomposition of Partial Orders.
    ORDER, 6:335-350, 1990.
  52. Decomposition of k-ary Relations.
    Discrete Mathematics, 81:303-322, 1990.
  53. alpha-Vertex Separator is NP-Hard Even for 3-Regular Graphs.
    Methods of Operations Research, 62:291-293, 1990.
    Extended Abstract.
    Joint work with Rudolf Müller.
    [ html | pdf ]
  54. Channel Routing Under Different Optimization Criteria.
    Methods of Operations Research, 62:295-305, 1990.
    Joint work with Frank Wagner.
  55. Graph Separation is NP-Complete.
    Methods of Operations Research, 60:269-274, 1989.
    Joint work with Frank Wagner.

Conference articles

  1. Accelerating Multi-Modal Route Planning by Access-Nodes.
    In: Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09), volume 5757 of Lecture Notes in Computer Science, pages 587-598. Springer, September 2009.
    Joint work with Daniel Delling and Thomas Pajor.
    [ pdf ]
  2. Dynamic Graph Clustering Using Minimum-Cut Trees.
    In: Algorithms and Data Structures, 11th International Workshop, volume 5664 of Lecture Notes in Computer Science. Springer, August 2009.
    Joint work with Robert Görke and Tanja Hartmann.
    [ html | pdf ]
  3. Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.
    In: Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), volume 5526 of Lecture Notes in Computer Science. Springer, June 2009.
    Joint work with Reinhard Bauer.
    [ pdf ]
  4. ORCA Reduction and ContrAction Graph Clustering.
    In: Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09), volume 5564 of Lecture Notes in Computer Science, pages 152-165. Springer, June 2009.
    Joint work with Daniel Delling, Robert Görke, and Christian Schulz.
    [ pdf ]
  5. Pareto Paths with SHARC.
    In: Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), volume 5526 of Lecture Notes in Computer Science, pages 125-136. Springer, June 2009.
    Joint work with Daniel Delling.
    [ pdf ]
  6. The Shortcut Problem - Complexity and Approximation.
    In: Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), volume 5404 of Lecture Notes in Computer Science, pages 105-116. Springer, January 2009.
    Joint work with Reinhard Bauer, Gianlorenzo D'Angelo, and Daniel Delling.
    [ pdf ]
  7. Efficient Route Planning in Flight Networks.
    In: Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09), Dagstuhl Seminar Proceedings, 2009.
    Joint work with Daniel Delling, Thomas Pajor, and Christos Zaroliagis.
    [ pdf ]
  8. Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.
    In: Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09), Lecture Notes in Computer Science. Springer, 2009.
    to appear.
    Joint work with Robert Franke and Ignaz Rutter.
  9. Engineering Time-Expanded Graphs for Faster Timetable Information.
    In: Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08), Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, September 2008.
    Joint work with Daniel Delling and Thomas Pajor.
    [ pdf ]
  10. Engineering Label-Constrained Shortest-Path Algorithms.
    In: Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), volume 5034 of Lecture Notes in Computer Science, pages 27-37. Springer, June 2008.
    Joint work with Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, and Madhav V. Marathe.
  11. Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.
    In: Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), volume 5038 of Lecture Notes in Computer Science, pages 303-318. Springer, June 2008.
    Joint work with Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, and Dominik Schultes.
    [ pdf ]
  12. Engineering Comparators for Graph Clusterings.
    In: Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), volume 5034 of Lecture Notes in Computer Science, pages 131-142. Springer, June 2008.
    Joint work with Daniel Delling, Marco Gaertler, and Robert Görke.
    [ pdf ]
  13. Fingerprints - Means For Visual Analytics.
    In: Proceedings of the 15th International Symposium on Graph Drawing (GD'07), volume 4875 of Lecture Notes in Computer Science. Springer, January 2008.
    as poster, see http://i11www.iti.uni-karlsruhe.de/algobib/files/ggw-fmfva-08.pdf.
    Joint work with Marco Gaertler and Robert Görke.
    [ html | pdf ]
  14. LunarVis - Analytic Visualizations of Large Graphs.
    In: Proceedings of the 15th International Symposium on Graph Drawing (GD'07), volume 4875 of Lecture Notes in Computer Science, pages 352-364. Springer, January 2008.
    Joint work with Robert Görke and Marco Gaertler.
    [ html | pdf ]
  15. Efficient Scheduling of Data Harvesting Trees.
    In: Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, pages 43-56, 2008.
    Joint work with Bastian Katz and Steffen Mecke.
    [ html | pdf ]
  16. Link Scheduling in Local Interference Models.
    In: Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, pages 57-71, 2008.
    Joint work with Bastian Katz and Markus Völker.
    [ html | pdf ]
  17. Minimizing the Area for Planar Straight-Line Grid Drawings.
    In: Proceedings of the 15th International Symposium on Graph Drawing (GD'07), volume 4875 of Lecture Notes in Computer Science, pages 207-212. Springer, January 2008.
    Joint work with Marcus Krug.
    [ pdf ]
  18. A Visualization-Driven Approach to Overlay-Underlay Engineering.
    In: Proceedings of the Final Workshop of DELIS, HNI-Verlagsschriftenreihe, pages 81-97. Heinz Nixdorf Institut, Universität Paderborn, December 2007.
    Joint work with Vinay Aggarwal, Anja Feldmann, Marco Gaertler, and Robert Görke.
    [ pdf ]
  19. On Finding Graph Clusterings with Maximum Modularity.
    In: Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), volume 4769 of Lecture Notes in Computer Science, pages 121-132. Springer, October 2007.
    Joint work with Ulrik Brandes, Daniel Delling, Martin Höfer, Marco Gaertler, Robert Görke, and Zoran Nikoloski.
    [ pdf ]
  20. Generating Graphs with Predefined k-Core Structure.
    In: Proceedings of the European Conference of Complex Systems (ECCS'07), October 2007.
    Online proceedings http://cssociety.org/ECCS07-Programme.
    Joint work with Michael Baur, Marco Gaertler, Robert Görke, and Marcus Krug.
    [ html | pdf ]
  21. Evaluating Clustering Techniques - An Engineering Approach Inspired by Unit-Tests.
    In: Proceedings of the European Conference of Complex Systems (ECCS'07), October 2007.
    as poster.
    Joint work with Daniel Delling, Marco Gaertler, Robert Görke, and Zoran Nikoloski.
    [ html | pdf ]
  22. Engineering Comparators for Graph Clusterings.
    In: Proceedings of the European Conference of Complex Systems (ECCS'07), October 2007.
    as poster.
    Joint work with Daniel Delling, Marco Gaertler, and Robert Görke.
    [ html | pdf ]
  23. Landmark-Based Routing in Dynamic Graphs.
    In: Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), volume 4525 of Lecture Notes in Computer Science, pages 52-65. Springer, June 2007.
    Joint work with Daniel Delling.
    [ html | pdf ]
  24. Significance-Driven Graph Clustering.
    In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07), Lecture Notes in Computer Science, pages 11-26. Springer, June 2007.
    Joint work with Marco Gaertler and Robert Görke.
    [ html | pdf ]
  25. Experimental Study on Speed-Up Techniques for Timetable Information Systems.
    In: Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07), pages 209-225. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.
    Joint work with Reinhard Bauer and Daniel Delling.
    [ html | pdf ]
  26. Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks.
    In: Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), volume 4362 of Lecture Notes in Computer Science, pages 330-341. Springer, January 2007.
    Joint work with Marco Gaertler and Bastian Katz.
    [ html | pdf ]
  27. Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
    In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), pages 36-45. SIAM, 2007.
    Joint work with Sebastian Knopp, Peter Sanders, Dominik Schultes, and Frank Schulz.
  28. Multi-scale Anchor-free Distributed Positioning in Sensor Networks.
    In: Proceedings of the International Workshop on Theoretical and Algorithmic Aspects of Sensor Networks (WTASA'07), pages 64-74, 2007.
    Joint work with Bastian Katz.
    [ pdf ]
  29. Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks.
    In: Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), volume 4362 of Lecture Notes in Computer Science, pages 410-421. Springer, January 2007.
    Joint work with Markus Maier and Steffen Mecke.
    [ pdf ]
  30. Speed-Up Techniques for Shortest-Path Computations.
    In: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07), volume 4393 of Lecture Notes in Computer Science, pages 23-36. Springer, 2007.
    Joint work with Thomas Willhalm.
    [ pdf ]
  31. High-Performance Multi-Level Graphs.
    In: 9th DIMACS Implementation Challenge - Shortest Paths, November 2006.
    Joint work with Daniel Delling, Martin Holzer, Kirill Müller, and Frank Schulz.
    [ html | pdf ]
  32. Highway Hierarchies Star.
    In: 9th DIMACS Implementation Challenge - Shortest Paths, November 2006.
    Joint work with Daniel Delling, Peter Sanders, and Dominik Schultes.
    [ html | pdf ]
  33. Generating Significant Graph Clusterings.
    In: Proceedings of the European Conference of Complex Systems (ECCS'06), September 2006.
    Online Proceedings http://cssociety.org/tiki-index.php?page=ECCS'06+Programme.
    Joint work with Daniel Delling and Marco Gaertler.
    [ html | pdf ]
  34. How to Cluster Evolving Graphs.
    In: Proceedings of the European Conference of Complex Systems (ECCS'06), September 2006.
    online available at http://complexsystems.lri.fr/FinalReview/FILES/PDF/p103.pdf.
    Joint work with Marco Gaertler, Robert Görke, and Silke Wagner.
    [ html | pdf ]
  35. Analysis of Overlay-Underlay Topology Correlation using Visualization.
    In: Proceedings of the 5th IADIS International Conference WWW/Internet Geometry, 2006.
    awarded as outstanding paper.
    Joint work with Vinay Aggarwal, Anja Feldmann, Marco Gaertler, and Robert Görke.
    [ pdf ]
  36. Graph Drawing Contest Report.
    In: Proceedings of the 13th International Symposium on Graph Drawing (GD'05), volume 3843 of Lecture Notes in Computer Science, pages 528-531. Springer, January 2006.
    Joint work with Christian A. Duncan and Stephen G. Kobourov.
    [ html ]
  37. A Hybrid Model for Drawing Dynamic and Evolving Graphs.
    In: Proceedings of the 13th International Symposium on Graph Drawing (GD'05), volume 3843 of Lecture Notes in Computer Science, pages 189-200. Springer, January 2006.
    Joint work with Marco Gaertler.
    [ html | pdf ]
  38. Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
    In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06), pages 156-170. SIAM, 2006.
    Joint work with Martin Holzer and Frank Schulz.
  39. Station Location - Complexity and Approximation.
    In: Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.
    Joint work with Steffen Mecke and Anita Schöbel.
    [ html | pdf ]
  40. Drawing the AS Graph in 2.5 Dimensions.
    In: Proceedings of the 12th International Symposium on Graph Drawing (GD'04), volume 3383 of Lecture Notes in Computer Science, pages 43-48. Springer, January 2005.
    Joint work with Michael Baur, Ulrik Brandes, and Marco Gaertler.
    [ html | pdf ]
  41. Engineering Planar Separator Algorithms.
    In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05), volume 3669 of Lecture Notes in Computer Science, pages 628-639. Springer, 2005.
    Joint work with Martin Holzer, Grigorios Prasinos, Frank Schulz, and Christos Zaroliagis.
  42. Partitioning Graphs to Speed Up Dijkstra's Algorithm.
    In: Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05), volume 3503 of Lecture Notes in Computer Science, pages 189-202. Springer, 2005.
    Joint work with Rolf H. Möhring, Heiko Schilling, Birk Schütz, and Thomas Willhalm.
  43. Finding, Counting and Listing all Triangles in Large Graphs, an Experimental Study.
    In: Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05), volume 3503 of Lecture Notes in Computer Science, pages 606-609. Springer, 2005.
    Joint work with Thomas Schank.
    [ html | pdf ]
  44. Drawing Graphs to Speed Up Shortest-Path Computations.
    In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05), pages 15-24. SIAM, 2005.
    Joint work with Thomas Willhalm.
  45. Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles.
    In: Proceedings of the 11th International Symposium on Graph Drawing (GD'03), volume 2912 of Lecture Notes in Computer Science, pages 357-368. Springer, January 2004.
    Joint work with Ulrik Brandes and Sabine Cornelsen.
  46. Locating New Stops in a Railway Network.
    In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03), volume 92 of Electronic Notes in Theoretical Computer Science, pages 13-23, 2004.
    Joint work with Horst W. Hamacher, Annegret Liebers, Anita Schöbel, and Frank Wagner.
    [ html | pdf ]
  47. The Station Location Problem on Two Intersecting Lines.
    In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03), volume 92 of Electronic Notes in Theoretical Computer Science, pages 52-64, 2004.
    Joint work with Flavia Mammana and Steffen Mecke.
    [ html | pdf ]
  48. Solving Geometric Covering Problems by Data Reduction.
    In: Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04), volume 3221 of Lecture Notes in Computer Science, pages 760-771, 2004.
    Joint work with Steffen Mecke.
    [ html | pdf ]
  49. Experimental Comparison of Shortest Path Approaches for Timetable Information.
    In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04), pages 88-99. SIAM, 2004.
    Joint work with Evangelia Pyrga, Frank Schulz, and Christos Zaroliagis.
    [ pdf ]
  50. Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.
    In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03), volume 92 of Electronic Notes in Theoretical Computer Science, pages 85-103, 2004.
    Joint work with Evangelia Pyrga, Frank Schulz, and Christos Zaroliagis.
  51. Dynamic Shortest Path Containers.
    In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03), volume 92 of Electronic Notes in Theoretical Computer Science, pages 65-84, 2004.
    Joint work with Thomas Willhalm and Christos Zaroliagis.
    [ pdf ]
  52. Sketch-Driven Orthogonal Graph Drawing.
    In: Proceedings of the 10th International Symposium on Graph Drawing (GD'00), volume 2528 of Lecture Notes in Computer Science, pages 1-11. Springer, January 2003.
    Joint work with Ulrik Brandes, Markus Eiglsperger, and Michael Kaufmann.
  53. Experiments on Graph Clustering Algorithms.
    In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), volume 2832 of Lecture Notes in Computer Science, pages 568-579. Springer, 2003.
    Joint work with Ulrik Brandes and Marco Gaertler.
    [ html ]
  54. Drawing Graphs on Two and Three Lines.
    In: Proceedings of the 10th International Symposium on Graph Drawing (GD'00), volume 2528 of Lecture Notes in Computer Science, pages 31-41. Springer, January 2003.
    Joint work with Sabine Cornelsen and Thomas Schank.
    [ pdf ]
  55. Completely Connected Clustered Graphs.
    In: Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03), volume 2880 of Lecture Notes in Computer Science, pages 168-179. Springer, 2003.
    Joint work with Sabine Cornelsen.
    [ html ]
  56. Algorithms and Models for Railway Optimization.
    In: Algorithms and Data Structures, 8th International Workshop, volume 2748 of Lecture Notes in Computer Science, pages 198-206. Springer, 2003.
    [ html ]
  57. Analysis and Visualization of Social Networks.
    In: Proceedings of the 2nd Workshop on Experimental Algorithms (WEA'03), volume 2647 of Lecture Notes in Computer Science, pages 261-266. Springer, 2003.
    Invited Talk.
  58. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
    In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), volume 2832 of Lecture Notes in Computer Science, pages 776-787. Springer, 2003.
    Joint work with Thomas Willhalm.
  59. visone - Software for Visual Social Network Analysis.
    In: Proceedings of the 9th International Symposium on Graph Drawing (GD'01), volume 2265 of Lecture Notes in Computer Science, pages 463-464. Springer, January 2002.
    Joint work with Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, and Jürgen Lerner.
    [ html | pdf ]
  60. Using Multi-Level Graphs for Timetable Information in Railway Systems.
    In: Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02), volume 2409 of Lecture Notes in Computer Science, pages 43-59. Springer, 2002.
    Joint work with Frank Schulz and Christos Zaroliagis.
    [ pdf ]
  61. How to Draw the Minimum Cuts of a Planar Graph.
    In: Proceedings of the 8th International Symposium on Graph Drawing (GD'00), volume 1984 of Lecture Notes in Computer Science, pages 103-114. Springer, January 2001.
    Joint work with Ulrik Brandes and Sabine Cornelsen.
    [ html | pdf ]
  62. Fast Layout Methods for Timetable Graphs.
    In: Proceedings of the 8th International Symposium on Graph Drawing (GD'00), volume 1984 of Lecture Notes in Computer Science, pages 127-138. Springer, January 2001.
    Joint work with Ulrik Brandes, Galina Shubina, and Roberto Tamassia.
    [ html | pdf ]
  63. Travel Planning with Self-Made Maps.
    In: Proceedings of the 3rd International Workshop on Algorithm Engineering and Experiments (ALENEX'01), volume 2153 of Lecture Notes in Computer Science, pages 132-144. Springer, 2001.
    Joint work with Ulrik Brandes, Frank Schulz, and Thomas Willhalm.
    [ html | pdf ]
  64. Planarity of the Two-Level Cactus Representation.
    In: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01), volume 2204 of Lecture Notes in Computer Science, pages 91-102. Springer, 2001.
    Joint work with Sabine Cornelsen and Yefim Dinitz.
    [ html | pdf ]
  65. Centrality in Policy Network Drawings.
    In: Proceedings of the 7th International Symposium on Graph Drawing (GD'99), volume 1731 of Lecture Notes in Computer Science, pages 250-258. Springer, January 2000.
    Joint work with Ulrik Brandes and Patrick Kenis.
    [ html | pdf ]
  66. Contextual Visualization of Actor Status in Social Networks.
    In: Proceedings of the 2nd Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym'00), pages 13-22. Springer, 2000.
    Joint work with Ulrik Brandes.
    [ pdf ]
  67. Dynamic web structures in 3d.
    In: Proceedings of the 6th International Symposium on Graph Drawing (GD'98), volume 1547 of Lecture Notes in Computer Science, pages 423-435. Springer, January 1999.
    Honorable Mention beim Graph Drawing Contest 1998, s. Graph-Drawing Contest Report by P. E.
    Joint work with Ulrik Brandes, Vanessa Kääb, Andres Löh, and Thomas Willhalm.
    [ html ]
  68. Using Graph Layout to Visualize Train Interconnection Data.
    In: Proceedings of the 6th International Symposium on Graph Drawing (GD'98), volume 1547 of Lecture Notes in Computer Science, pages 44-56. Springer, January 1999.
    Joint work with Ulrik Brandes.
    [ html | pdf ]
  69. On the Hardness of Recognizing Bundles in Time Table Graphs.
    In: Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99), volume 657 of Lecture Notes in Computer Science, pages 325-337. Springer, 1999.
    Joint work with Annegret Liebers and Karsten Weihe.
    [ html ]
  70. Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
    In: Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE'99), volume 1668 of Lecture Notes in Computer Science, pages 110-123. Springer, 1999.
    Joint work with Frank Schulz and Karsten Weihe.
    [ html ]
  71. Empirical Design of Geometric Algorithms.
    In: Proceedings of the 15th Annual ACM Symposium on Computational Geometry, pages 86-94. ACM Press, 1999.
    Joint work with Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, and Thomas Willhalm.
    [ html | pdf ]
  72. A Bayesian paradigm for dynamic graph layout.
    In: Proceedings of the 5th International Symposium on Graph Drawing (GD'97), volume 1353 of Lecture Notes in Computer Science, pages 236-247. Springer, January 1998.
    Joint work with Ulrik Brandes.
    [ html ]
  73. Dynamic Grid Embedding with Few Bends and Changes.
    In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98), volume 1533 of Lecture Notes in Computer Science, pages 89-98. Springer, 1998.
    Joint work with Ulrik Brandes.
    [ html | pdf ]
  74. A linear time algorithm for the arc disjoint Menger problem in planar directed graphs.
    In: Proceedings of the 5th Annual European Symposium on Algorithms (ESA'97), volume 1284 of Lecture Notes in Computer Science, pages 64-77. Springer, September 1997.
    Joint work with Ulrik Brandes.
  75. Wiring edge-disjoint layouts.
    In: Proceedings of the 4th International Symposium on Graph Drawing (GD'96), volume 1090 of Lecture Notes in Computer Science, pages 271-285. Springer, January 1997.
    Joint work with Ruth Kuchem.
  76. An animated library for combinatorial VLSI routing algorithms.
    In: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, pages 428-429. ACM Press, 1995.
    Joint work with Karsten Weihe.
  77. Two-layer wiring with pin preassignment is easier if the power supply nets are already generated.
    In: Proceedings of the 7th International Conference on VLSI Design, pages 149-154, 1994.
    Joint work with Paul Molitor and Uwe Sparmann.
  78. On the complexity of partial order properties.
    In: Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92), volume 657 of Lecture Notes in Computer Science, pages 225-235. Springer, June 1993.
    Joint work with Stefan Felsner.
  79. Linear time algorithms for disjoint two-face paths problem in planar graphs.
    In: Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93), volume 762 of Lecture Notes in Computer Science, pages 343-352. Springer, 1993.
    Joint work with Heike Ripphausen-Lipa and Karsten Weihe.
  80. The vertex-disjoint Menger-problem in planar graphs.
    In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pages 112-119, 1993.
    Joint work with Heike Ripphausen-Lipa and Karsten Weihe.
  81. Between Min Cut and Graph Bisection.
    In: MFCS '93: Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, volume 711 of Lecture Notes in Computer Science, pages 744-750, London, UK, 1993. Springer.
    Joint work with Frank Wagner.
  82. Between mincut and graph bisection.
    In: MFCS '93: Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, volume 711 of Lecture Notes in Computer Science, pages 744-750, London, UK, 1993. Springer.
    Joint work with Frank Wagner.
  83. A linear time algorithm for edge-disjoint paths in planar graphs.
    In: Proceedings of the 1st European Symposium on Algorithms (ESA'93), volume 726 of Lecture Notes in Computer Science, pages 744-750, 1993.
    Joint work with Karsten Weihe.
  84. Wiring knock-knee layouts: a global approach.
    In: Proceedings of the 3rd International Symposium on Algorithms and Computation (ISAAC'92), volume 650 of Lecture Notes in Computer Science, pages 388-399. Springer, 1992.
    Joint work with Majid Sarrafzadeh, Frank Wagner, and Karsten Weihe.
  85. Routing through a Dense Channel with Minimum Total Wire Length.
    In: Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'91), pages 475-482. ACM Press, 1991.
    Joint work with Michael Formann and Frank Wagner.
  86. A new approach to knock-knee channel routing.
    In: Proceedings of the 2nd International Symposium on Algorithms (ISA'91), volume 557 of Lecture Notes in Computer Science, pages 83-93. Springer, 1991.
  87. Area-Optimal Three-Layer Channel Routing.
    In: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89), pages 506-511, October 1989.
    Joint work with Ruth Kuchem and Frank Wagner.

Habilitation

  1. Discrete Algorithms for Routing in Chip Layout.
    Habilitation, Technische Universität Berlin, 1992.

Dissertation

  1. Die Splitdekomposition als Methode zur Zerlegung diskreter Strukturen.
    PhD thesis, Rheinisch Westfälische Technische Hochschule Aachen, 1986.

Technical reports

  1. Space-Efficient SHARC-Routing.
    Technical Report 2009-13, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2009.
    Joint work with Edith Brunel, Daniel Delling, and Andreas Gemsa.
    [ pdf ]
  2. Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.
    Technical Report 2009,6, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2009.
    Joint work with Reinhard Bauer.
    [ html | pdf ]
  3. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Technical report, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2009.
    Informatik, Uni Karlsruhe, TR 2009-10.
    Joint work with Robert Görke and Tanja Hartmann.
    [ html | pdf ]
  4. On the Complexity of Scheduling with Power Control in Geometric SINR.
    Technical Report 15, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2009.
    Joint work with Markus Völker and Bastian Katz.
    [ html | pdf ]
  5. Impact of Shortcuts on Speedup Techniques.
    Technical Report 2008-10, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2008.
    Joint work with Reinhard Bauer and Daniel Delling.
    [ pdf ]
  6. Contracting Timetable Information Networks.
    Technical Report 144, Arrival Technical Report, 2008.
    Joint work with Daniel Delling, Kalliopi Giannakopoulou, and Christos Zaroliagis.
    [ pdf ]
  7. Timetable Information Updating in Case of Delays: Modeling Issues.
    Technical Report 133, Arrival Technical Report, 2008.
    Joint work with Daniel Delling, Kalliopi Giannakopoulou, and Christos Zaroliagis.
    [ pdf ]
  8. The Complexity of the Shortcut Problem.
    Technical Report 117, Arrival Technical Report, 2007.
    Joint work with Reinhard Bauer, Gianlorenzo D'Angelo, and Daniel Delling.
    [ pdf ]
  9. Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems.
    Technical Report 2007-14, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2007.
    Joint work with Reinhard Bauer and Daniel Delling.
    [ html | pdf ]
  10. On Modularity - NP-Completeness and Beyond.
    Technical Report 2006-19, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2006.
    Joint work with Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Höfer, and Zoran Nikoloski.
    [ html | pdf ]
  11. How to Evaluate Clustering Techniques.
    Technical Report 2006-24, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2006.
    Joint work with Daniel Delling, Marco Gaertler, Robert Görke, and Zoran Nikoloski.
    [ html | pdf ]
  12. Experiments on Comparing Graph Clusterings.
    Technical Report 2006-16, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2006.
    Joint work with Daniel Delling, Marco Gaertler, and Robert Görke.
    [ html | pdf ]
  13. Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks.
    Technical Report 2006-17, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2006.
    Joint work with Marco Gaertler and Bastian Katz.
    [ html | pdf ]
  14. Comparing Clusterings - An Overview.
    Technical Report 2006-04, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2006.
    Joint work with Silke Wagner.
    [ html | pdf ]
  15. Analysis of Overlay-Underlay Topology Correlation using Visualization.
    Technical Report 2005-31, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2005.
    Joint work with Vinay Aggarwal, Anja Feldmann, Marco Gaertler, and Robert Görke.
    [ html | pdf ]
  16. Halfmoon - A new Paradigm for Complex Network Visualization.
    Technical Report 2005-29, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2005.
    Joint work with José Ignacio Alvarez-Hamelin, Marco Gaertler, and Robert Görke.
    [ html | pdf ]
  17. Drawing the AS Graph in Two and a Half Dimensions.
    Technical Report 2004-12, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2004.
    Joint work with Michael Baur, Ulrik Brandes, and Marco Gaertler.
    [ html | pdf ]
  18. Approximating Clustering-Coefficient and Transitivity.
    Technical Report 2004-9, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2004.
    Joint work with Thomas Schank.
    [ html ]
  19. The Continuous Stop Location Problem in Public Transportation Networks.
    Technical report, Universität Konstanz, 2003.
    Joint work with Anita Schöbel, Horst W. Hamacher, and Annegret Liebers.
  20. Dual Traversals of Planar Graphs.
    Technical report, Universität Konstanz, 2001.
    Joint work with Ulrik Brandes and Vanessa Kääb.
  21. Recognizing Bundles in Time Table Graphs-a Structural Approach.
    Technical Report 96, Universität Konstanz, 1999.
    Konstanzer Schriften in Mathematik und Informatik.
    Joint work with Annegret Liebers and Karsten Weihe.
  22. Random Field Models for Graph Layout.
    techreport 33, Universität Konstanz, 1997.
    Konstanzer Schriften in Mathematik und Informatik.
    Joint work with Ulrik Brandes.
  23. Edge-Disjoint Paths in Planar Graphs with Minimum Total Length.
    Technical Report 19, Universität Konstanz, 1996.
    Konstanzer Schriften in Mathematik und Informatik.
    Joint work with Ulrik Brandes and Gabriele Neyer.
  24. PlaNet-A Demonstration Package for Algorithms on Planar Networks.
    Technical Report 5, Universität Konstanz, 1996.
    Konstanzer Schriften in Mathematik und Informatik.
    Joint work with Gabriele Neyer, Wolfram Schlickenrieder, and Karsten Weihe.
  25. The Vertex-Disjoint Menger Problem in Planar Graphs.
    Technical Report 324, Fachbereich Mathematik, Technische Universität Berlin, 1992.
    Joint work with Heike Ripphausen-Lipa and Karsten Weihe.