Veröffentlichungen

Engineering Label-Constrained Shortest-Path Algorithms.
In: Proceedings of the Ninth DIMACS Implementation Challenge on Shortest Paths (DIMACS 2006). AMS, 2009.
To appear.
Joint work with Chris Barrett, Keith Bisset, Goran Konjevod, Madhav Marathe, and Dorothea Wagner.

High-Performance Multi-Level Graphs.
In: Proceedings of the Ninth DIMACS Implementation Challenge on Shortest Paths (DIMACS 2006). AMS, 2009.
To appear.
Joint work with Daniel Delling, Kirill Müller, Frank Schulz, and Dorothea Wagner.

Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
Journal of Experimental Algorithmics, 13, 2008.
© ACM 2007. This is the authors' version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.
Joint work with Frank Schulz and Dorothea Wagner.
[ pdf ]

Combining Speed-up Techniques for Shortest-Path Computations.
Journal of Experimental Algorithmics, 10, 2006.
© ACM 2006. This is the authors' version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution.
Joint work with Frank Schulz, Dorothea Wagner, and Thomas Willhalm.
[ pdf ]

Engineering Label-Constrained Shortest-Path Algorithms.
In: Proceedings of the Fourth International Conference on Algorithmic Aspects in Information and Management (AAIM 2008), volume 5034 of LNCS, pages 27-37. Springer, June 2008.
Joint work with Chris Barrett, Keith Bisset, Goran Konjevod, Madhav Marathe, and Dorothea Wagner.
[ pdf ]

Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX 2006), volume 129 of Proceedings in Applied Mathematics, pages 156-170. SIAM, January 2006.
Joint work with Frank Schulz and Dorothea Wagner.
[ pdf ]

Engineering Planar Separator Algorithms.
In: Proceedings of the 13th European Symposium on Algorithms (ESA 2005), volume 3669 of LNCS, pages 628-639. Springer, October 2005.
Joint work with Grigorios Prasinos, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis.
[ pdf ]

Combining Speed-up Techniques for Shortest-Path Computations.
In: Proceedings of the Third International Workshop on Experimental and Efficient Algorithms (WEA 2004), volume 3059 of LNCS, pages 269-284. Springer, May 2004.
Joint work with Frank Schulz and Thomas Willhalm.
[ pdf ]

Engineering Planar-Separator and Shortest-Path Algorithms.
PhD thesis, Dept. of Informatics, University of Karlsruhe, Germany, August 2008.
[ pdf ]

Hierarchical Speed-up Techniques for Shortest-Path Algorithms.
Master's thesis, Dept. of Informatics, University of Konstanz, Germany, February 2003.
[ pdf ]

Label constrained shortest path algorithms: An experimental evaluation using transportation networks.
Technical report, Virginia Tech (USA), Arizona State University (USA), and Karlsruhe University (Germany), 2007.
Work presented at the workshop on the DIMACS Shortest-Path Challenge.
Joint work with Chris Barrett, Keith Bisset, Goran Konjevod, Madhav Marathe, and Dorothea Wagner.
[ pdf ]

High-Performance Multi-Level Graphs.
Technical report, Karlsruhe University, 2006.
Work presented at the workshop on the DIMACS Shortest-Path Challenge.
Joint work with Daniel Delling, Kirill Müller, Frank Schulz, and Dorothea Wagner.
[ pdf ]

Engineering Planar Separator Algorithms.
Technical Report 20, Dept. of Informatics, University of Karlsruhe, Germany, 2005.
Joint work with Grigorios Prasinos, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis.
[ pdf ]