Dorothea Wagner Algorithm Engineering e s i g Route Planning D - PowerPoint PPT Presentation

Dorothea Wagner Algorithm Engineering e s i g Route Planning D n E Graph Clustering x p e e z r Graph Drawing i y Algorithmics m l a e n n Social Network Analysis A t Sensor Networks t n e I m m p e l Energy Networks . . . 1 Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group

Route Planning fast shortest path computations (on-board and off-board) practical applications (Google, Microsoft, Nokia, telenav, ...) time dependence and dynamic traffic data flexible objectives (e.g. , travel time vs. cost) and constraints (e.g. , vehicle size, weight, toll roads) public transport multimodal route planning alternative routes intelligent point-of-interest search theory Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group

Graph Clustering network analysis and exploration (social, biological, technical, ...) compute densely connected = subgraphs (clusters) evaluate structure and function of clusters dynamic networks new cluster temporal tracing of clusters G 0 G 1 G 2 Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group

Graph Drawing algorithms for visualizing graphs in the plane applications: sociology, biology, UML-diagrams, ... examples of our research: constrained planar graph drawings (e.g., point set embedding, extending partial drawings) alternative drawing conventions argument maps ? + Dorothea Wagner – Dagstuhl 2016 Institute of Theoretical Informatics Algorithmics Group