| 2008 |
| 19 | EE | Martin Holzer,
Frank Schulz,
Dorothea Wagner:
Engineering multilevel overlay graphs for shortest-path queries.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 18 | EE | Frank Schulz:
Trees with exponentially growing costs.
Inf. Comput. 206(5): 569-578 (2008) |
| 2007 |
| 17 | EE | Sebastian Knopp,
Peter Sanders,
Dominik Schultes,
Frank Schulz,
Dorothea Wagner:
Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
ALENEX 2007 |
| 16 | EE | Frank Schulz:
Modeling Sensor and Ad Hoc Networks.
Algorithms for Sensor and Ad Hoc Networks 2007: 21-36 |
| 15 | EE | Evangelia Pyrga,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Efficient models for timetable information in public transportation systems.
ACM Journal of Experimental Algorithmics 12: (2007) |
| 2005 |
| 14 | EE | Martin Holzer,
Grigorios Prasinos,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Engineering Planar Separator Algorithms.
ESA 2005: 628-639 |
| 13 | EE | Martin Holzer,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Combining speed-up techniques for shortest-path computations.
ACM Journal of Experimental Algorithmics 10: (2005) |
| 2004 |
| 12 | | Evangelia Pyrga,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Experimental Comparison of Shortest Path Approaches for Timetable Information.
ALENEX/ANALC 2004: 88-99 |
| 11 | EE | Matthias Müller-Hannemann,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Timetable Information: Models and Algorithms.
ATMOS 2004: 67-90 |
| 10 | EE | Martin Holzer,
Frank Schulz,
Thomas Willhalm:
Combining Speed-Up Techniques for Shortest-Path Computations.
WEA 2004: 269-284 |
| 9 | EE | Ulrik Brandes,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Generating node coordinates for shortest-path computations in transportation networks.
ACM Journal of Experimental Algorithmics 9: (2004) |
| 8 | EE | Evangelia Pyrga,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.
Electr. Notes Theor. Comput. Sci. 92: 85-103 (2004) |
| 2002 |
| 7 | EE | Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Using Multi-level Graphs for Timetable Information in Railway Systems.
ALENEX 2002: 43-59 |
| 2001 |
| 6 | EE | Ulrik Brandes,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Travel Planning with Self-Made Maps.
ALENEX 2001: 132-144 |
| 2000 |
| 5 | EE | Birgit Schappel,
Frank Schulz:
Mainz Rolling Brains 2000.
RoboCup 2000: 497-500 |
| 4 | EE | Frank Schulz,
Dorothea Wagner,
Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
ACM Journal of Experimental Algorithmics 5: 12 (2000) |
| 1999 |
| 3 | EE | Frank Schulz,
Dorothea Wagner,
Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
Algorithm Engineering 1999: 110-123 |
| 1998 |
| 2 | EE | Frank Schulz:
Two New Families of List Update Algorithms.
ISAAC 1998: 99-108 |
| 1996 |
| 1 | | Frank Schulz,
Elmar Schömer:
Self-Organizing Data Structures with Dependent Accesses.
ICALP 1996: 526-537 |