Search the dblp DataBase
Frank Schulz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Using Multi-level Graphs for Timetable Information in Railway Systems. [Citation Graph (0, 0)][DBLP]
ALENEX, 2002, pp:43-59 [Conf] - Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
Travel Planning with Self-Made Maps. [Citation Graph (0, 0)][DBLP]
ALENEX, 2001, pp:132-144 [Conf] - Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Experimental Comparison of Shortest Path Approaches for Timetable Information. [Citation Graph (0, 0)][DBLP]
ALENEX/ANALC, 2004, pp:88-99 [Conf] - Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Engineering Planar Separator Algorithms. [Citation Graph (0, 0)][DBLP]
ESA, 2005, pp:628-639 [Conf] - Frank Schulz, Elmar Schömer
Self-Organizing Data Structures with Dependent Accesses. [Citation Graph (0, 0)][DBLP]
ICALP, 1996, pp:526-537 [Conf] - Frank Schulz
Two New Families of List Update Algorithms. [Citation Graph (0, 0)][DBLP]
ISAAC, 1998, pp:99-108 [Conf] - Birgit Schappel, Frank Schulz
Mainz Rolling Brains 2000. [Citation Graph (0, 0)][DBLP]
RoboCup, 2000, pp:497-500 [Conf] - Frank Schulz, Dorothea Wagner, Karsten Weihe
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. [Citation Graph (0, 0)][DBLP]
Algorithm Engineering, 1999, pp:110-123 [Conf] - Martin Holzer, Frank Schulz, Thomas Willhalm
Combining Speed-Up Techniques for Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
WEA, 2004, pp:269-284 [Conf] - Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:85-103 [Journal] - Frank Schulz, Dorothea Wagner, Karsten Weihe
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. [Citation Graph (0, 0)][DBLP]
ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:12- [Journal] - Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm
Combining speed-up techniques for shortest-path computations. [Citation Graph (0, 0)][DBLP]
ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal] - Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
Generating node coordinates for shortest-path computations in transportation networks. [Citation Graph (0, 0)][DBLP]
ACM Journal of Experimental Algorithms, 2004, v:9, n:, pp:- [Journal] - Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner
Computing Many-to-Many Shortest Paths Using Highway Hierarchies. [Citation Graph (0, 0)][DBLP]
ALENEX, 2007, pp:- [Conf] - Frank Schulz
Modeling Sensor and Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
Algorithms for Sensor and Ad Hoc Networks, 2007, pp:21-36 [Conf] - Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Efficient models for timetable information in public transportation systems. [Citation Graph (0, 0)][DBLP]
ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]
Timetable Information: Models and Algorithms. [Citation Graph (, )][DBLP]
Search in 0.014secs, Finished in 0.015secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002