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
Mitarbeiter
Ehemalige Mitarbeiter
Frank Schulz
Veröffentlichungen

Veröffentlichungen

Buchbeiträge

  1. Timetable information: Models and algorithms.
    In: Leo Kroon, Anita Schöbel, Dorothea Wagner, Frank Wagner, and Christos Zaroliagis, editors, Algorithmic Methods for Railway Optimization. Springer.
    To appear.
    Joint work with Matthias Müller-Hannemann, Dorothea Wagner, and Christos Zaroliagis.
    [ pdf ]

Artikel in Zeitschriften

  1. Combining speed-up techniques for shortest-path computations.
    Journal of Experimental Algorithmics, 2006.
    To appear. © ACM. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.
    Joint work with Martin Holzer and Thomas Willhalm.
    [ pdf ]
  2. Generating node coordinates for shortest-path computations in transportation networks.
    Journal of Experimental Algorithmics, 9(1.1), 2004.
    © ACM, 2004. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.
    Joint work with Ulrik Brandes, Dorothea Wagner, and Thomas Willhalm.
    [ pdf ]
  3. Dijkstra's algorithm on-line: An empirical case study from public railroad transport.
    Journal of Experimental Algorithmics, 5(12), 2000.
    © ACM, 2000. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.
    Joint work with Dorothea Wagner and Karsten Weihe.
    [ pdf ]

Artikel in Tagungsbänden

  1. High-performance multi-level graphs.
    In: DIMACS Implementation Challenge - Shortest Paths, 2006.
    To appear (first draft available here).
    Joint work with Daniel Delling, Martin Holzer, Kirill Müller, and Dorothea Wagner.
    [ pdf ]
  2. Routing by landmarks.
    In: Swiss Transport Research Conference, 2006.
    Joint work with David Caduff, Urs-Jakob Rüetschi, Sabine Timpf, and Alexander Wolff.
    [ pdf ]
  3. Engineering multi-level overlay graphs for shortest-path queries.
    In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 2006.
    To appear.
    Joint work with Martin Holzer and Dorothea Wagner.
    [ pdf ]
  4. Engineering planar separator algorithms.
    In: Proceedings of the 13th European Symposium on Algorithms (ESA), volume 3669 of LNCS, pages 628-639. Springer, 2005.
    Joint work with Martin Holzer, Grigorios Prasinos, Dorothea Wagner, and Christos Zaroliagis.
    [ html | pdf ]
  5. Combining speed-up techniques for shortest-path computations.
    In: Proceedings Third International Workshop on Experimental and Efficient Algorithms (WEA), volume 3059 of LNCS, pages 269-284. Springer, 2004.
    Joint work with Martin Holzer and Thomas Willhalm.
    [ pdf ]
  6. Experimental comparison of shortest path approaches for timetable information.
    In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 88-99. SIAM, 2004.
    Joint work with Evangelia Pyrga, Dorothea Wagner, and Christos Zaroliagis.
    [ pdf ]
  7. Towards realistic modeling of time-table information through the time-dependent approach.
    In: Proceedings of the ATMOS Workshop 2003, volume 92 of ENTCS, pages 85-103. Elsevier, 2004.
    Joint work with Evangelia Pyrga, Dorothea Wagner, and Christos Zaroliagis.
    [ pdf ]
  8. Using multi-level graphs for timetable information in railway systems.
    In: Proceedings 4th Workshop on Algorithm Engineering and Experiments (ALENEX), volume 2409 of LNCS, pages 43-59. Springer, 2002.
    Joint work with Dorothea Wagner and Christos Zaroliagis.
    [ pdf ]
  9. Travel planning with self-made maps.
    In: Proceedings 3rd Workshop on Algorithm Engineering and Experiments (ALENEX), volume 2153 of LNCS, pages 132-144. Springer, 2001.
    Joint work with Ulrik Brandes, Dorothea Wagner, and Thomas Willhalm.
    [ pdf ]
  10. Dijkstra's algorithm on-line: An empirical case study from public railroad transport.
    In: Proceedings 3rd International Workshop on Algorithm Engineering (WAE), volume 1668 of LNCS, pages 110-123. Springer, 1999.
    Joint work with Dorothea Wagner and Karsten Weihe.
    [ pdf ]

Dissertation

  1. Timetable information and shortest paths.
    PhD thesis, Universität Karlsruhe (TH), Fakultät Informatik, 2005.
    [ html | pdf | ps ]

Diplomarbeit

  1. Efficient algorithms for a timetable information system.
    Master's thesis, Universität Konstanz, Fachbereich Informatik und Informationswissenschaft, 2000.
    [ pdf ]

Technische Berichte

  1. Engineering planar separator algorithms.
    Technical Report 20, Universität Karlsruhe (TH), Fakultät für Informatik, 2005.
    Joint work with Martin Holzer, Grigorios Prasinos, Dorothea Wagner, and Christos Zaroliagis.
    [ html | pdf ]
  2. Efficient models for timetable information in public transportation systems.
    Technical Report 39, DELIS Technical Report, 2004.
    Submitted to the Journal of Experimental Algorithimcs.
    Joint work with Evangelia Pyrga, Dorothea Wagner, and Christos Zaroliagis.
    [ html | pdf ]
  3. Two approaches for time-table information: A comparison of models and performance.
    Technical Report 190, Preprints in Mathematics and Computer Science at University of Konstanz, July 2003.
    Joint work with Evangelia Pyrga, Dorothea Wagner, and Christos Zaroliagis.
    [ pdf ]
  4. Generating node coordinates for shortest-path computations in transportation networks.
    Technical Report 174, Konstanzer Schriften in Mathematik und Informatik, May 2002.
    Joint work with Ulrik Brandes, Dorothea Wagner, and Thomas Willhalm.
    [ html | pdf ]