Martin Holzer

According to our database, Martin Holzer authored at least 8 papers between 2004 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Engineering planar separator algorithms.

Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos D. Zaroliagis

ACM J. Exp. Algorithmics, 2009

2008

Engineering planar-separator and shortest-path algorithms.

Martin Holzer

PhD thesis, 2008

Engineering multilevel overlay graphs for shortest-path queries.

Martin Holzer, Frank Schulz, Dorothea Wagner

ACM J. Exp. Algorithmics, 2008

2006

High-Performance Multi-Level Routing.

Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner

Proceedings of the Shortest Path Problem, 2006

Engineering Label-Constrained Shortest-Path Algorithms.

Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner

Proceedings of the Shortest Path Problem, 2006

Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.

Martin Holzer, Frank Schulz, Dorothea Wagner

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Combining speed-up techniques for shortest-path computations.

Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm

ACM J. Exp. Algorithmics, 2005

2004

Combining Speed-Up Techniques for Shortest-Path Computations.

Martin Holzer, Frank Schulz, Thomas Willhalm

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004