CSE Lecture - Speaker: Dorothea Wagner

Event Details
  • Date/Time:
    • Tuesday February 21, 2012 - Wednesday February 22, 2012
      11:00 am - 11:59 am
  • Location: Klaus Advanced Computing Bldg., room 1116W
  • Phone: (404) 894-5756
  • URL:
  • Email:
  • Fee(s):
  • Extras:

Della Phinisee


Summary Sentence: No summary sentence submitted.

Full Summary: No summary paragraph submitted.


Dorothea Wagner

Karlsruhe Institute of Technology (KIT)

Institute of Theoretical Informatics

Karlsruhe, Germany


Title: Algorithm Engineering for Route Planning - An Update –

Abstract:   Nowadays, route planning systems belong to the most frequently used information systems. The algorithmic core problem of such systems, i.e., the fast computation of shortest paths is a classical problem that can be solved by Dijkstra's shortest paths algorithm. However, algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to several million times faster than Dijkstra’s algorithm.  In particular, computing shortest paths in huge networks has become a showpiece of Algorithm Engineering demonstrating the engineering cycle that consists of design, analysis, implementation and experimental evaluation of practicable algorithms. We will provide a condensed overview of the techniques enabling this development.


Bio: Dorothea Wagner is a full professor for Informatics at the Karlsruhe Institute of Technology (KIT). She obtained her diploma and Ph.D. degrees in mathematics from the RWTH Aachen in 1983 and 1986 respectively, and 1992 the Habilitation degree from the TU Berlin. 1994 - 2003 she was a full professor for Computer Science at the Universitaet Konstanz. Her research interests include design and analysis of algorithms and algorithm engineering, graph algorithms, computational geometry and discrete optimization, particularly  applied to transportation systems, network analysis, data mining and visualization.

Among other activities she is vice president of the Deutsche Forschungsgemeinschaft (DFG) and speaker of the scientific advisory board of the Leibniz Center for Informatics Schloss Dagstuhl. She is Editor in Chief  of JDA (Journal on Discrete Algorithms) and of OASIcs  (OpenAccess Series in Informatics), and member of the editorial boards of JGAA (Journal of Graph Algorithms and Applications), CGTA (Computational Geometry: Theory and Applications), EPTCS (Electronic Proceedings in Theoretical Computer  Science) and of "Leitfäden der Informatik", B. G. Teubner.

Additional Information

In Campus Calendar

High Performance Computing (HPC), College of Computing, School of Computational Science and Engineering

Invited Audience
No audiences were selected.
No keywords were submitted.
  • Created By: Della Phinisee
  • Workflow Status: Published
  • Created On: Jan 20, 2012 - 9:41am
  • Last Updated: Oct 7, 2016 - 9:57pm