Institut für Theoretische Informatik, Algorithmik
Suche
Institut für Theoretische Informatik, Algorithmik
Institut für Theoretische Informatik, Algorithmik
Institut für Theoretische Informatik, Algorithmik
Projekte
Abgeschlossene Projekte
Clusterung statischer und zeitbehafteter Graphen
Arbeiten zum ersten Förderabschnitt

Arbeiten zum ersten Förderabschnitt

Publikationen (Publications)

Artikel in Zeitschriften (Journal Articles)

  1. On Modularity Clustering.
    IEEE Transactions on Knowledge and Data Engineering, 20(2):172-188, February 2008.
    Ulrik Brandes, Daniel Delling, Marco Gaertler, Martin Höfer, Zoran Nikoloski, Robert Görke and Dorothea Wagner.
    [ url | pdf ]

Artikel in Tagungsbänden (Conference Articles)

  1. 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.
    Daniel Delling, Marco Gaertler, Robert Görke and Dorothea Wagner.
    [ pdf ]
  2. 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.
    Ulrik Brandes, Daniel Delling, Martin Höfer, Marco Gaertler, Zoran Nikoloski, Robert Görke and Dorothea Wagner.
    [ pdf ]
  3. 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.
    Daniel Delling, Marco Gaertler, Zoran Nikoloski, Robert Görke and Dorothea Wagner.
    [ html | pdf ]
  4. Engineering Comparators for Graph Clusterings.
    In: Proceedings of the European Conference of Complex Systems (ECCS'07), October 2007.
    As poster.
    Daniel Delling, Marco Gaertler, Robert Görke and Dorothea Wagner.
    [ html | pdf ]
  5. 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.
    Marco Gaertler, Robert Görke and Dorothea Wagner.
    [ html | pdf ]

Technische Berichte (Technical Reports)

  1. Comparing Clusterings - An Overview
    Technical Report 2006-04, Department of Informatics, Universität Karlsruhe (TH), 2007.
    Dorothea Wagner and Silke Wagner.
    [ url ]

Noch nicht publizierte Ergebnisse (Unpublished Results)

Unter Begutachtung (Submitted)

  1. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Eingereicht zu WADS, 2009
    Robert Görke, Tanja Hartmann and Dorothea Wagner
    [ pdf ]
    (inzwischen veröffentlicht, siehe Publikationen zum zweiten Förderabschnitt)
  2. ORCA Reduction and ContrAction Graph Clustering.
    Eingereicht zu AAIM, 2009
    Robert Görke, Daniel Delling, Christian Schulz, and Dorothea Wagner.
    [ pdf ]
    (inzwischen veröffentlicht, siehe Publikationen zum zweiten Förderabschnitt)
  3. Engineering Planar Separator Algorithms
    Eingereicht zu ACM JEA, 2009
    Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos Zaroliagis
    [ pdf ]
    (inzwischen veröffentlicht, siehe Publikationen zum zweiten Förderabschnitt)

Anstehende Einreichungen (Future Submissions)

  1. Smoothly Clustering Graphs that Change over Time.
    Wird zu einer Konferenz eingereicht [ pdf ]
  2. Computational Aspects of Significance-Driven Graph Clustering.
    Wird zur Zeitschrift JGAA eingereicht [ pdf ]
    (inzwischen veröffentlicht unter dem Titel Computational Aspects of Lucidity-Driven Graph Clustering, siehe Publikationen zum zweiten Förderabschnitt)

Abschlussarbeiten im Rahmen des Projekts (Theses)

Dissertationen (Doctoral Theses)

  1. Martin Holzer, June 2008.
    Engineering Planar-Separator and Shortest-Path Algorithms
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]

Diplomarbeiten (Master's Theses)

  1. Tanja Hartmann, October 2008.
    Clustering Dynamic Graphs with Guaranteed Quality
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]
  2. Stefanie Nagel, October 2008.
    Optimisation of Clustering Algorithms for the Identification of Customer Profiles from Shopping Cart Data
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]
  3. Florian Hübner, May 2008.
    The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]
  4. Dieter Glaser, February 2008.
    Zeitexpandiertes Graphenclustern - Modellierung und Experimente
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]

Studienarbeiten (Student Projects)

  1. Christian Schulz, June 2008.
    Design and experimental evaluation of a local graph clustering algorithm
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]
  2. Manuel Krings, February 2008.
    LP-basierte Heuristiken für Graphenclusterung mit Modularity als Qualitätsmaß
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]
  3. Steffen Lang, April 2007.
    Protein domain decomposition using spectral graph partitioning
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]
  4. Myriam Freidinger, February 2007.
    Minimale Schnitte und Schnittbäume
    Department of Informatics, Universität Karlsruhe (TH).
    [ url ]

Publikationsliste der Antragstellerin D. Wagner für 2004-2009

Monographien (Monographs)

  1. Algorithmics of Large and Complex Networks.
    Lecture Notes in Computer Science. Springer, 2009.
    to appear.
    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 Watternhofer.
    [ html ]

Tagungsbände (Proceedings)

  1. Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08).
    SIAM, April 2008.
    Jointly edited with Ian Munro.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.

Buchbeiträge (Book Chapters)

  1. Engineering Label-Constrained Shortest-Path Algorithms.
    In: Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, 2009.
    to appear.
    Joint work with Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, and Madhav V. Marathe.
  2. High-Performance Multi-Level Routing.
    In: Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, 2009.
    accepted for publication, to appear.
    Joint work with Daniel Delling, Martin Holzer, Kirill Müller, and Frank Schulz.
    [ pdf ]
  3. Engineering Route Planning Algorithms.
    In: Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science. Springer, 2009.
    to appear.
    Joint work with Daniel Delling, Peter Sanders, and Dominik Schultes.
    [ pdf ]
  4. Highway Hierarchies Star.
    In: Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, 2009.
    accepted for publication, to appear.
    Joint work with Daniel Delling, Peter Sanders, and Dominik Schultes.
    [ pdf ]
  5. 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 ]
  6. 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 ]
  7. 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.
  8. 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.

Artikel in Zeitschriften (Journal Articles)

  1. Experimental Study on Speed-Up Techniques for Timetable Information Systems.
    Networks, 2009.
    accepted for publication, to appear.
    Joint work with Reinhard Bauer and Daniel Delling.
    [ pdf ]
  2. 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 ]
  3. 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 ]
  4. 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 ]
  5. 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.
  6. 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 ]
  7. 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.
  8. Completely Connected Clustered Graphs.
    Journal of Discrete Algorithms, 4(2):313-323, 2006.
    Joint work with Sabine Cornelsen.
    [ html ]
  9. Combining Speed-up Techniques for Shortest-Path Computations.
    ACM Journal of Experimental Algorithmics, 10, 2006.
    Joint work with Martin Holzer, Frank Schulz, and Thomas Willhalm.
  10. 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.
  11. 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 ]
  12. Approximating Clustering Coefficient and Transitivity.
    Journal of Graph Algorithms and Applications, 9(2):265-275, 2005.
    Joint work with Thomas Schank.
    [ html | pdf ]
  13. Geometric Containers for Efficient Shortest-Path Computation.
    ACM Journal of Experimental Algorithmics, 10:1.3, 2005.
    Joint work with Thomas Willhalm and Christos Zaroliagis.
  14. 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.
  15. 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 ]
  16. Netzwerkvisualisierung.
    it-Information Technology, 46(3):129-134, 2004.
    Joint work with Ulrik Brandes.
  17. 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 ]

Artikel in Tagungsbänden (Conference Articles)

  1. Dynamic Min-Cut Tree Clustering.
    In: Algorithms and Data Structures, 11th International WorkshopLecture Notes in Computer Science, Springer, to appear 2009.
    Robert Görke, Tanja Hartmann and Dorothea Wagner.
    [ pdf ]
  2. 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.
    Robert Görke, Daniel Delling, Christian Schulz, and Dorothea Wagner.
    [ pdf ]
  3. Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.
    In: Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), Lecture Notes in Computer Science. Springer, June 2009.
    Joint work with Reinhard Bauer.
  4. Pareto Paths with SHARC.
    In: Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09), Lecture Notes in Computer Science. Springer, June 2009.
    accepted for publication, to appear.
    Joint work with Daniel Delling.
  5. 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 ]
  6. 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 ]
  7. 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.
  8. 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 ]
  9. 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 ]
  10. 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 ]
  11. 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 ]
  12. Efficient Scheduling of Data Harvesting Trees.
    In: Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, 2008.
    Joint work with Bastian Katz and Steffen Mecke.
    [ pdf ]
  13. 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 ]
  14. 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 ]
  15. 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 ]
  16. 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 ]
  17. 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 ]
  18. 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 ]
  19. 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 ]
  20. 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 ]
  21. 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 ]
  22. 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 ]
  23. 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.
  24. 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), 2007.
    Joint work with Bastian Katz.
  25. 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 ]
  26. 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 ]
  27. 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 ]
  28. Highway Hierarchies Star.
    In: 9th DIMACS Implementation Challenge - Shortest Paths, November 2006.
    Joint work with Daniel Delling, Peter Sanders, and Dominik Schultes.
    [ html | pdf ]
  29. 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 ]
  30. 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 ]
  31. 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 ]
  32. 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 ]
  33. 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 ]
  34. Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
    In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06). SIAM, 2006.
    Joint work with Martin Holzer and Frank Schulz.
  35. 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 ]
  36. 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 ]
  37. 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.
  38. Partitioning Graphs to Speed Up Dijkstra's Algorithm.
    In: Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05), 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.
  39. Finding, Counting and Listing all Triangles in Large Graphs, an Experimental Study.
    In: Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05), Lecture Notes in Computer Science, pages 606-609. Springer, 2005.
    Joint work with Thomas Schank.
    [ html | pdf ]
  40. 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.
  41. 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.
  42. Locating New Stops in a Railway Network.
    In: Proceedings of ATMOS Workshop 2003, pages 13-23, 2004.
    Joint work with Horst W. Hamacher, Annegret Liebers, Anita Schöbel, and Frank Wagner.
    [ html | pdf ]
  43. The Station Location Problem on Two Intersecting Lines.
    In: Proceedings of ATMOS Workshop 2003, pages 52-64, 2004.
    Joint work with Flavia Mammana and Steffen Mecke.
    [ html | pdf ]
  44. 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 ]
  45. 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 ]
  46. Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.
    In: Proceedings of ATMOS Workshop 2003, pages 85-103, 2004.
    Joint work with Evangelia Pyrga, Frank Schulz, and Christos Zaroliagis.
  47. Dynamic Shortest Path Containers.
    In: Proceedings of ATMOS Workshop 2003, pages 65-84, 2004.
    Joint work with Thomas Willhalm and Christos Zaroliagis.
    [ pdf ]

Technische Berichte (Technical Reports)

  1. 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 ]
  2. Contracting Timetable Information Networks.
    Technical Report 144, Arrival Technical Report, 2008.
    Joint work with Daniel Delling, Kalliopi Giannakopoulou, and Christos Zaroliagis.
    [ pdf ]
  3. 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 ]
  4. 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 ]
  5. 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 ]
  6. 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 ]
  7. 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 ]
  8. 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 ]
  9. 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 ]
  10. Comparing Clusterings - An Overview.
    Technical Report 2006-04, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2006.
    Joint work with Silke Wagner.
    [ pdf ]
  11. 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 ]
  12. 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 ]
  13. 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 ]
  14. 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 ]