| Title | Conference | Date | Author |
|---|---|---|---|
| Efficient Routing in Road Networks with Turn Costs | International Symposium on Experimental Algorithms (SEA 2011) |
May 2011 |
R. Geisberger, C. Vetter |
| Alternative Route Graphs in Road Networks | International ICST Conference on Theory and Practice of Algorithms |
April 2011 |
R. Bader, J. Dees, R. Geisberger, P. Sanders |
| A Comparison of High-Level Approaches for Speeding up Pathfinding | Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE 2010) |
October 2010 |
R. Geisberger, N. Sturtevant |
| Engineering Time-Dependent Many-to-Many Shortest Paths Computation | Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010) |
September 2010 |
R. Geisberger, P. Sanders |
| Fast Detour Computation for Ride Sharing | ATMOS 2010 |
September 2010 |
R. Geisberger, D. Luxen, P. Sanders, S. Neubauer, L. Volker |
| Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns | European Symposium on Algorithms (ESA 2010) |
September 2010 |
H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, C. Harrelson, V. Raychev, F. Viger |
| Heuristic Contraction Hierarchies with Approximation Guarantee | Symposium on Combinatorial Search (SoCS 2010) |
July 2010 |
Robert Geisberger, Dennis Schieferdecker |
| Contraction of Timetable Networks with Realistic Transfers | International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
R. Geisberger |
| Time-Dependent Contraction Hierarchies and Approximation | International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
G.V. Batz, R. Geisberger, S. Neubauer, P. Sanders |
| Route Planning with Flexible Objective Functions | Workshop on Algorithm Engineering and Experiments (ALENEX 2010) |
Januar 2010 | R. Geisberger, M. Kobitzsch, P. Sanders |
| Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks | International Workshop on Experimental Algorithms (WEA 2008) |
May/June 2008 | R. Geisberger, P. Sanders, D. Schultes, D. Delling |
| Better Approximation of Betweenness Centrality | Workshop on Algorithm Engineering and Experiments (ALENEX 2008) |
January 2008 | R. Geisberger, P. Sanders, D. Schultes |
| Titel | Autor | Quelle |
|---|---|---|
| Compressed Transmission of Route Descriptions | G.V. Batz, R. Geisberger, D. Luxen, P. Sanders |
Technical Report, November 22, 2010, Fakultät für Informatik, Karlsruher Institut für Technologie, arXiv:1011.4465v1 |
| Engineering Time-dependent One-To-All Computation | R. Geisberger |
Technical Report, October 5, 2010, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Defining and Computing Alternative Routes in Road Networks | J. Dees, R. Geisberger, P. Sanders, R. Bader |
Technical Report, February 23, 2010, Fakultät für Informatik, Karlsruher Institut für Technologie |
| Heuristic Contraction Hierarchies with Approximation Guarantee | R. Geisberger |
Technical Report, February 4, 2010, Fakultät für Informatik, Karlsruhe Institute of Technology |
| Contraction of Timetable Networks with Realistic Transfers | R. Geisberger |
Technical Report, August 11, 2009, Fakultät für Informatik, Universität Karlsruhe |
| Fast Detour Computation for Ride Sharing | R. Geisberger, D. Luxen, S. Neubauer, P. Sanders, L. Volker |
Technical Report, July 30, 2009, Fakultät für Informatik, Universität Karlsruhe |
| Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas | G.V. Batz, R. Geisberger, P. Sanders |
Technical Report, April 24, 2008, Fakultät für Informatik, Universität Karlsruhe |
| Titel | Betreuer | Datum | Typ |
|---|---|---|---|
| Advanced Route Planning in Transportation Networks | P. Sanders |
2011 | Dissertation |
| Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks | D. Schultes |
2008 | Diplomarbeit |
| Better Approximation of Betweeness Centrality | D. Schultes |
2008 | Studienarbeit |
| Title | Conference | Date |
|---|---|---|
| Fortgeschrittene Routenplanung in Transportnetzen | Promotionsprüfung |
Februar 2011 |
| Engineering Time-Dependent Many-to-Many Shortest Paths Computation | Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010) |
September 2010 |
| Heuristic Contraction Hierarchies with Approximation Guarantee | Symposium on Combinatorial Search (SoCS 2010) |
July 2010 |
| Contraction of Timetable Networks with Realistic Transfers | International Symposium on Experimental Algorithms (SEA 2010) |
May 2010 |
| Advanced Route Planning | University of Alberta |
April 2010 |
| Fast Route Planning | Transport Optimization Challanges in Contemporary Practise - Workshop |
May 2009 |
| Multi-Criteria, Contraction Hierarchies, Ride Sharing | Klausurtagung ITI Sanders |
December 2008 |
| Routing in Road Networks | Seminar in Distributed Computing, ETH Zürich |
October 2008 |
| Fast Route Planning | SPP1307 Algorithm Engineering Workshop at Google Zurich |
September 2008 |
| Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks | International Workshop on Experimental Algorithms (WEA 2008) |
May/June 2008 |
| Better Approximation of Betweenness Centrality | Workshop on Algorithm Engineering and Experiments (ALENEX 2008) |
January 2008 |
| Titel | Typ | Bearbeiter |
|---|---|---|
| Computing Alternative Routes in Road Networks | Diplomarbeit | Jonathan Dees |
| Planung energieeffizienter Routen in Straßennetzwerken | Diplomarbeit | Sabine Neubauer |
| Route Planning with Flexible Objective Functions | Diplomarbeit | Moritz Kobitzsch |
| Titel | type | place | time |
|---|---|---|---|
| Algorithmen I | lecture | Audimax |
Montag und Mittwoch, jeweils von 14 bis 15.30 Uhr |