{"79701":{"#nid":"79701","#data":{"type":"event","title":"CSE Lecture - Speaker: Dorothea Wagner","body":[{"value":"\u003Cp\u003ESpeaker:\u0026nbsp; \u003C\/p\u003E\u003Cp\u003EDorothea Wagner\u003C\/p\u003E\u003Cp\u003EKarlsruhe Institute of Technology (KIT)\u003C\/p\u003E\u003Cp\u003EInstitute of Theoretical Informatics\u003C\/p\u003E\u003Cp\u003EKarlsruhe, Germany\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003ETitle:\u0026nbsp;Algorithm Engineering for Route Planning - An Update \u2013\u003C\/p\u003E\u003Cp\u003EAbstract:\u0026nbsp;\u0026nbsp; 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\u0027s 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\u2019s algorithm.\u0026nbsp; 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.\u003C\/p\u003E\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\u003Cp\u003EBio: 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\u0026nbsp; applied to transportation systems, network analysis, data mining and visualization.\u003C\/p\u003E\u003Cp\u003EAmong 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 \u0026nbsp;of JDA (Journal on Discrete Algorithms) and of OASIcs \u0026nbsp;(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 \u0026nbsp;Science) and of \u0022Leitf\u00e4den der Informatik\u0022, B. G. Teubner.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":"","uid":"27330","created_gmt":"2012-01-20 14:41:23","changed_gmt":"2016-10-08 01:57:07","author":"Della Phinisee","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2012-02-21T11:00:00-05:00","event_time_end":"2012-02-21T12:00:00-05:00","event_time_end_last":"2012-02-21T12:00:00-05:00","gmt_time_start":"2012-02-21 16:00:00","gmt_time_end":"2012-02-21 17:00:00","gmt_time_end_last":"2012-02-21 17:00:00","rrule":null,"timezone":"America\/New_York"},"extras":["free_food"],"groups":[{"id":"1304","name":"High Performance Computing (HPC)"},{"id":"47223","name":"College of Computing"},{"id":"50877","name":"School of Computational Science and Engineering"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[{"id":"1795","name":"Seminar\/Lecture\/Colloquium"}],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[{"value":"\u003Cp\u003E\u003Ca href=\u0022mailto:della@cc.gatech.edu\u0022\u003EDella Phinisee\u003C\/a\u003E\u003C\/p\u003E","format":"limited_html"}],"email":[],"slides":[],"orientation":[],"userdata":""}}}