Dorothea Wagner

375 papers A* 4A 51B 50C 32Misc 2Journal 142Unranked 56
YearRankTypeTitle / Venue / Authors
2025 J jnl
Customizable Contraction Hierarchies - A Survey.
CoRR
Thomas Bläsius, Valentin Buchhold, Dorothea Wagner, Tim Zeitz, Michael Zündorf
2023 J jnl
More Recent Advances in (Hyper)Graph Partitioning.
ACM Comput. Surv.
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
2023 J jnl
ULTRA: Unlimited Transfers for Efficient Multimodal Journey Planning.
Transp. Sci.
Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2022 J jnl
An Axiomatic Approach to Time-Dependent Shortest Path Oracles.
Algorithmica
Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis
2022 J jnl
More Recent Advances in (Hyper)Graph Partitioning.
CoRR
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
2022 — ch.
Skeleton-Based Clustering by Quasi-Threshold Editing.
Algorithms for Big Data
Ulrik Brandes, Michael Hamann, Luise Häuser, Dorothea Wagner
2021 A conf
Fast, Exact and Scalable Dynamic Ridesharing.
ALENEX
Valentin Buchhold, Peter Sanders, Dorothea Wagner
2021 B conf
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications.
SEA
Valentin Buchhold, Dorothea Wagner
2021 J jnl
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications.
CoRR
Valentin Buchhold, Dorothea Wagner
2021 J jnl
Open and autonomous. The basis for trust in science.
Inf. Serv. Use
Dorothea Wagner
2021 J jnl
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks.
Algorithms
Ben Strasser, Dorothea Wagner, Tim Zeitz
2021 B conf
The Complexity of Flow Expansion and Electrical Flow Expansion.
SOFSEM
Dorothea Wagner, Matthias Wolf
2020 B conf
Advanced Flow-Based Multilevel Hypergraph Partitioning.
SEA
Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner
2020 J jnl
Advanced Flow-Based Multilevel Hypergraph Partitioning.
CoRR
Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner
2020 C conf
An Efficient Solution for One-To-Many Multi-Modal Journey Planning.
ATMOS
Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2020 C conf
Customizable Contraction Hierarchies with Turn Costs.
ATMOS
Valentin Buchhold, Dorothea Wagner, Tim Zeitz, Michael Zündorf
2020 J jnl
Energy-Optimal Routes for Battery Electric Vehicles.
Algorithmica
Moritz Baum, Julian Dibbelt, Thomas Pajor, Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2020 B conf
Engineering Exact Quasi-Threshold Editing.
SEA
Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf
2020 J jnl
Engineering Exact Quasi-Threshold Editing.
CoRR
Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf
2020 A conf
Engineering Top-Down Weight-Balanced Trees.
ALENEX
Lukas Barth, Dorothea Wagner
2020 J jnl
Fast, Exact and Scalable Dynamic Ridesharing.
CoRR
Valentin Buchhold, Peter Sanders, Dorothea Wagner
2020 B conf
Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA.
SEA
Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2020 C conf
Integrating ULTRA and Trip-Based Routing.
ATMOS
Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2020 J jnl
Integrating public transport into mobiTopp.
Future Gener. Comput. Syst.
Lars Briem, H. Sebastian Buck, Nicolai Mallig, Peter Vortisch, Ben Strasser, Dorothea Wagner, Tobias Zündorf
2020 J jnl
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles.
CoRR
Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf
2020 J jnl
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles.
Transp. Sci.
Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf
2020 — conf
Negative Cycle Canceling with Neighborhood Heuristics for the Wind Farm Cabling Problem.
e-Energy
Sascha Gritzbach, Dorothea Wagner, Matthias Wolf
2020 — conf
Preventing Critical Edges when Designing Transmission Networks.
e-Energy
Dorothea Wagner, Matthias Wolf
2020 A conf
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks.
ESA
Ben Strasser, Dorothea Wagner, Tim Zeitz
2020 B conf
Zipping Segment Trees.
SEA
Lukas Barth, Dorothea Wagner
2020 J jnl
Zipping Segment Trees.
CoRR
Lukas Barth, Dorothea Wagner
2019 — conf
Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort.
SIGSPATIAL/GIS
Valentin Buchhold, Peter Sanders, Dorothea Wagner
2019 — conf
Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA.
SIGSPATIAL/GIS
Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2019 J jnl
Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA.
CoRR
Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2019 A conf
Engineering Negative Cycle Canceling for Wind Farm Cabling.
ESA
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2019 J jnl
Engineering Negative Cycle Canceling for Wind Farm Cabling.
CoRR
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2019 J jnl
Engineering Top-Down Weight-Balanced Trees.
CoRR
Lukas Barth, Dorothea Wagner
2019 A conf
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
ESA
Lars Gottesbüren, Michael Hamann, Dorothea Wagner
2019 J jnl
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
CoRR
Lars Gottesbüren, Michael Hamann, Dorothea Wagner
2019 J jnl
Fast Exact Computation of Isocontours in Road Networks.
ACM J. Exp. Algorithmics
Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner
2019 J jnl
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies.
Algorithms
Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner
2019 J jnl
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies.
CoRR
Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner
2019 J jnl
Geometric Heuristics for Rectilinear Crossing Minimization.
ACM J. Exp. Algorithmics
Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner
2019 — conf
Industrial Demand-Side Flexibility: A Benchmark Data Set.
e-Energy
Nicole Ludwig, Lukas Barth, Dorothea Wagner, Veit Hagenmeyer
2019 J jnl
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies.
ACM J. Exp. Algorithmics
Valentin Buchhold, Peter Sanders, Dorothea Wagner
2019 — conf
Shaving Peaks by Augmenting the Dependency Graph.
e-Energy
Lukas Barth, Dorothea Wagner
2019 J jnl
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles.
CoRR
Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner, Tobias Zündorf
2019 J jnl
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles.
Transp. Sci.
Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner, Tobias Zündorf
2019 J jnl
Space-efficient, Fast and Exact Routing in Time-dependent Road Networks.
CoRR
Ben Strasser, Dorothea Wagner, Tim Zeitz
2019 A conf
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution.
ESA
Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2019 J jnl
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution.
CoRR
Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2018 A conf
A Geometric Heuristic for Rectilinear Crossing Minimization.
ALENEX
Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner
2018 — conf
An equal opportunity concept for the coordinated research effort AESC.
ECSA (Companion)
Anne Koziolek, Peter Sanders, Dorothea Wagner
2018 — ch.
Benchmarking for Graph Clustering and Partitioning.
Encyclopedia of Social Network Analysis and Mining. 2nd Ed.
David A. Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, Dorothea Wagner
2018 J jnl
Connection Scan Algorithm.
ACM J. Exp. Algorithmics
Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
2018 — conf
Distributed Graph Clustering Using Modularity and Map Equation.
Euro-Par
Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz
2018 J jnl
Exploiting flexibility in smart grids at scale.
Comput. Sci. Res. Dev.
Lukas Barth, Dorothea Wagner
2018 — conf
How much demand side flexibility do we need?: Analyzing where to exploit flexibility in industrial processes.
e-Energy
Lukas Barth, Veit Hagenmeyer, Nicole Ludwig, Dorothea Wagner
2018 J jnl
I/O-Efficient Generation of Massive Graphs Following the
ACM J. Exp. Algorithmics
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
2018 A conf
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
ESA
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
2018 J jnl
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
CoRR
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
2018 J jnl
Poster abstract: graph-theoretic model for observability in multi-carrier energy distribution networks.
Comput. Sci. Res. Dev.
Sören Hohmann, Heiko Maaß, Carina Mieth, Martin Pfeifer, Dorothea Wagner, Franziska Wegner
2018 J jnl
Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization.
Energy Inform.
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2018 B conf
Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies.
SEA
Valentin Buchhold, Peter Sanders, Dorothea Wagner
2018 — conf
The Maximum Transmission Switching Flow Problem.
e-Energy
Alban Grastien, Ignaz Rutter, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2018 J jnl
Towards negative cycle canceling in wind farm cable layout optimization.
Energy Inform.
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf
2017 — conf
A Simulated-Annealing-Based Approach for Wind Farm Cabling.
e-Energy
Sebastian Lehmann, Ignaz Rutter, Dorothea Wagner, Franziska Wegner
2017 A* conf
Benchmark Generator for Dynamic Overlapping Communities in Networks.
ICDM
Neha Sengupta, Michael Hamann, Dorothea Wagner
2017 J jnl
Connection Scan Algorithm.
CoRR
Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
2017 B conf
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications.
SEA
Moritz Baum, Jonas Sauer, Dorothea Wagner, Tobias Zündorf
2017 C conf
Eco-aware vehicle routing in urban environments.
ISCC
Julian Dibbelt, Dionisis D. Kehagias, Grammati E. Pantziou, Damianos Gavalas, Charalampos Konstantopoulos, Dorothea Wagner, Kalliopi Giannakopoulou, Spyros C. Kontogiannis, Christos D. Zaroliagis
2017 B conf
Efficient Traffic Assignment for Public Transit Networks.
SEA
Lars Briem, H. Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner, Tobias Zündorf
2017 A conf
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
ALENEX
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner
2017 C conf
Improved Oracles for Time-Dependent Road Networks.
ATMOS
Spyros C. Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
2017 J jnl
Improved Oracles for Time-Dependent Road Networks.
CoRR
Spyros C. Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
2017 — conf
Integrating public transport into mobiTopp.
ANT/SEIT
Lars Briem, H. Sebastian Buck, Nicolai Mallig, Peter Vortisch, Ben Strasser, Dorothea Wagner, Tobias Zündorf
2017 J jnl
Local Community Detection Based on Small Cliques.
Algorithms
Michael Hamann, Eike Röhrs, Dorothea Wagner
2017 A conf
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles.
ESA
Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf
2017 C conf
Multimodal route and tour planning in urban environments.
ISCC
Julian Dibbelt, Charalampos Konstantopoulos, Dorothea Wagner, Damianos Gavalas, Spyros C. Kontogiannis, Christos D. Zaroliagis, Vlasios Kasapakis, Grammati E. Pantziou
2017 C conf
Public Transit Routing with Unrestricted Walking.
ATMOS
Dorothea Wagner, Tobias Zündorf
2017 J jnl
Simple Distributed Graph Clustering using Modularity and Map Equation.
CoRR
Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz
2017 — conf
Time-Dependent Route Planning for Truck Drivers.
ICCL
Alexander Kleff, Christian Bräuer, Frank Schulz, Valentin Buchhold, Moritz Baum, Dorothea Wagner
2016 J jnl
Algorithmic Methods for Optimization in Public Transport (Dagstuhl Seminar 16171).
Dagstuhl Reports
Leo G. Kroon, Anita Schöbel, Dorothea Wagner
2016 — ch.
Clustering Evolving Networks.
Algorithm Engineering
Tanja Hartmann, Andrea Kappes, Dorothea Wagner
2016 J jnl
Customizable Contraction Hierarchies.
ACM J. Exp. Algorithmics
Julian Dibbelt, Ben Strasser, Dorothea Wagner
2016 B conf
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences.
SEA
Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner
2016 A conf
Engineering Oracles for Time-Dependent Road Networks.
ALENEX
Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
2016 B conf
Fast Exact Computation of Isochrones in Road Networks.
SEA
Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner
2016 B conf
Hierarchical Time-Dependent Oracles.
ISAAC
Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis
2016 J jnl
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
CoRR
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner
2016 J jnl
Optimal Orthogonal Graph Drawing with Convex Bend Costs.
ACM Trans. Algorithms
Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2016 — ch.
Route Planning in Transportation Networks.
Algorithm Engineering
Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2016 J jnl
Search-space size in contraction hierarchies.
Theor. Comput. Sci.
Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner
2016 J jnl
Structure-Preserving Sparsification Methods for Social Networks.
CoRR
Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner
2016 J jnl
Structure-preserving sparsification methods for social networks.
Soc. Netw. Anal. Min.
Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner
2016 J jnl
Towards route planning algorithms for electric vehicles with realistic constraints.
Comput. Sci. Res. Dev.
Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner
2015 A conf
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.
ALENEX
Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
2015 J jnl
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences.
CoRR
Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner
2015 A conf
Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs.
SDM
Patricia Iglesias Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, Tanja Hartmann, Dorothea Wagner
2015 J jnl
Engineering Oracles for Time-Dependent Road Networks.
CoRR
Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
2015 J jnl
Fast Computation of Isochrones in Road Networks.
CoRR
Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner
2015 J jnl
Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs.
CoRR
Julian Dibbelt, Ben Strasser, Dorothea Wagner
2015 A conf
Fast Quasi-Threshold Editing.
ESA
Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner
2015 J jnl
Fast Quasi-Threshold Editing.
CoRR
Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner
2015 — conf
Fast exact shortest path and distance queries on road networks with parametrized costs.
SIGSPATIAL/GIS
Julian Dibbelt, Ben Strasser, Dorothea Wagner
2015 — book
Gems of Combinatorial Optimization and Graph Algorithms
Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner
2015 — ch.
Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies.
Gems of Combinatorial Optimization and Graph Algorithms
Ben Strasser, Dorothea Wagner
2015 J jnl
Hierarchical Oracles for Time-Dependent Networks.
CoRR
Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis
2015 J jnl
Online dynamic power management with hard real-time guarantees.
Theor. Comput. Sci.
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2015 — conf
Operating Power Grids with Few Flow Control Buses.
e-Energy
Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner
2015 J jnl
Operating Power Grids with Few Flow Control Buses.
CoRR
Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner
2015 J jnl
Route Planning in Transportation Networks.
CoRR
Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015 — conf
Shortest feasible paths with charging stops for battery electric vehicles.
SIGSPATIAL/GIS
Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner, Tobias Zündorf
2015 B conf
Structure-Preserving Sparsification of Social Networks.
ASONAM
Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, Dorothea Wagner
2015 J jnl
Structure-Preserving Sparsification of Social Networks.
CoRR
Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, Dorothea Wagner
2015 — conf
Towards Realistic Flow Control in Power Grid Operation.
D-A-CH EI
Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner
2015 C conf
Towards Realistic Pedestrian Route Planning.
ATMOS
Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner
2014 A ed.
Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings
ESA
Andreas S. Schulz, Dorothea Wagner
2014 J jnl
Arbitrary Transmission Power in the SINR Model: Local Broadcasting, Coloring and MIS.
CoRR
Fabian Fuchs, Dorothea Wagner
2014 — ch.
Benchmarking for Graph Clustering and Partitioning.
Encyclopedia of Social Network Analysis and Mining
David A. Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, Dorothea Wagner
2014 J jnl
Clustering Evolving Networks.
CoRR
Tanja Hartmann, Andrea Kappes, Dorothea Wagner
2014 J jnl
Column-Based Graph Layouts.
J. Graph Algorithms Appl.
Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter, Dorothea Wagner
2014 A conf
Connection Scan Accelerated.
ALENEX
Ben Strasser, Dorothea Wagner
2014 B conf
Customizable Contraction Hierarchies.
SEA
Julian Dibbelt, Ben Strasser, Dorothea Wagner
2014 J jnl
Customizable Contraction Hierarchies.
CoRR
Julian Dibbelt, Ben Strasser, Dorothea Wagner
2014 C conf
Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time.
ATMOS
Julian Dibbelt, Ben Strasser, Dorothea Wagner
2014 J jnl
EATCS Fellows 2015 - Call for Nominations.
Bull. EATCS
Dorothea Wagner
2014 B conf
Erratum: Customizable Contraction Hierarchies.
SEA
Julian Dibbelt, Ben Strasser, Dorothea Wagner
2014 J jnl
Experiments on Density-Constrained Graph Clustering.
ACM J. Exp. Algorithmics
Robert Görke, Andrea Kappes, Dorothea Wagner
2014 J jnl
Generalizing Geometric Graphs.
J. Graph Algorithms Appl.
Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2014 B conf
Graph Clustering with Surprise: Complexity and Exact Solutions.
SOFSEM
Tobias Fleck, Andrea Kappes, Dorothea Wagner
2014 B conf
Local Broadcasting with Arbitrary Transmission Power in the SINR Model.
SIROCCO
Fabian Fuchs, Dorothea Wagner
2014 A conf
Online Dynamic Power Management with Hard Real-Time Guarantees.
STACS
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2014 J jnl
Orthogonal Graph Drawing with Flexibility Constraints.
Algorithmica
Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2014 C conf
Speed-Consumption Tradeoff for Electric Vehicle Route Planning.
ATMOS
Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, Dorothea Wagner
2014 J jnl
User-Constrained Multimodal Route Planning.
ACM J. Exp. Algorithmics
Julian Dibbelt, Thomas Pajor, Dorothea Wagner
2013 — conf
A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs.
ICA3PP (2)
Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner
2013 J jnl
Algorithm Engineering (Dagstuhl Seminar 13391).
Dagstuhl Reports
Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner
2013 J jnl
Algorithm Engineering.
Inform. Spektrum
Peter Sanders, Dorothea Wagner
2013 J jnl
Algorithm Engineering.
Inform. Spektrum
Peter Sanders, Dorothea Wagner
2013 J jnl
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
CoRR
Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner
2013 J jnl
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
CoRR
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
2013 B conf
Computing Multimodal Journeys in Practice.
SEA
Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck
2013 J jnl
Dynamic Gomory-Hu Tree Construction - fast and simple.
CoRR
Tanja Hartmann, Dorothea Wagner
2013 J jnl
Dynamic graph clustering combining modularity and smoothness.
ACM J. Exp. Algorithmics
Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, Dorothea Wagner
2013 B conf
Efficient Computation of Jogging Routes.
SEA
Andreas Gemsa, Thomas Pajor, Dorothea Wagner, Tobias Zündorf
2013 — conf
Energy-optimal routes for electric vehicles.
SIGSPATIAL/GIS
Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner
2013 J jnl
Graph Clustering with Surprise: Complexity and Exact Solutions.
CoRR
Tobias Fleck, Andrea Kappes, Dorothea Wagner
2013 — ed.
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings
Graph Partitioning and Graph Clustering
David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner
2013 J jnl
Hierarchies of Predominantly Connected Communities
CoRR
Michael Hamann, Tanja Hartmann, Dorothea Wagner
2013 B conf
Hierarchies of Predominantly Connected Communities.
WADS
Michael Hamann, Tanja Hartmann, Dorothea Wagner
2013 J jnl
Identifikation von Clustern in Graphen.
Inform. Spektrum
Robert Görke, Tanja Hartmann, Andrea Kappes, Dorothea Wagner
2013 B conf
Intriguingly Simple and Fast Transit Routing.
SEA
Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
2013 C conf
On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model.
ALGOSENSORS
Fabian Fuchs, Dorothea Wagner
2013 J jnl
On the Complexity of Partitioning Graphs for Arc-Flags.
J. Graph Algorithms Appl.
Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner
2013 J jnl
Online Power-Managing Strategy with Hard Real-Time Guarantees
CoRR
Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2013 — conf
Optimal Orthogonal Graph Drawing with Convex Bend Costs.
ICALP (1)
Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2013 — conf
Search-Space Size in Contraction Hierarchies.
ICALP (1)
Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner
2013 — ch.
Social Networks.
Handbook of Graph Drawing and Visualization
Ulrik Brandes, Linton C. Freeman, Dorothea Wagner
2013 J jnl
Static and Dynamic Aspects of Scientific Collaboration Networks.
CoRR
Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner
2013 J jnl
The density maximization problem in graphs.
J. Comb. Optim.
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2012 — conf
An Efficient Generator for Clustered Dynamic Random Networks.
MedAlg
Robert Görke, Roland Kluge, Andrea Schumm, Christian Staudt, Dorothea Wagner
2012 — book
Ausgezeichnete Informatikdissertationen 2011
Ausgezeichnete Informatikdissertationen
Abraham Bernstein, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2012 A conf
Column-Based Graph Layouts.
GD
Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner
2012 B conf
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
ISAAC
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
2012 — conf
Complete hierarchical cut-clustering: A case study on expansion and modularity.
Graph Partitioning and Graph Clustering
Michael Hamann, Tanja Hartmann, Dorothea Wagner
2012 J jnl
Dynamic Graph Clustering Using Minimum-Cut Trees.
J. Graph Algorithms Appl.
Robert Görke, Tanja Hartmann, Dorothea Wagner
2012 A conf
Experiments on Density-Constrained Graph Clustering.
ALENEX
Robert Görke, Andrea Schumm, Dorothea Wagner
2012 B conf
Fast and Simple Fully-Dynamic Cut Tree Construction.
ISAAC
Tanja Hartmann, Dorothea Wagner
2012 — conf
Force-directed tracking in wireless networks using signal strength and step recognition.
ICL-GNSS
Markus Völker, Dorothea Wagner, Johannes Schmid, Tobias Gädeke, Klaus D. Müller-Glaser
2012 J jnl
Higher Order City Voronoi Diagrams
CoRR
Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner
2012 — conf
Higher Order City Voronoi Diagrams.
SWAT
Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner
2012 C conf
On the Complexity of Partitioning Graphs for Arc-Flags.
ATMOS
Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner
2012 J jnl
Optimal Orthogonal Graph Drawing with Convex Bend Costs
CoRR
Thomas Bläsius, Ignaz Rutter, Dorothea Wagner
2012 — conf
Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks.
MedAlg
Fabian Fuchs, Markus Völker, Dorothea Wagner
2012 B conf
Static and Dynamic Aspects of Scientific Collaboration Networks.
ASONAM
Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner
2012 J jnl
The Shortcut Problem - Complexity and Algorithms.
J. Graph Algorithms Appl.
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner
2012 A conf
User-Constrained Multi-Modal Route Planning.
ALENEX
Julian Dibbelt, Thomas Pajor, Dorothea Wagner
2011 B conf
Algorithm Engineering for Route Planning - An Update -.
ISAAC
Dorothea Wagner
2011 J jnl
Algorithm Engineering.
it Inf. Technol.
Peter Sanders, Dorothea Wagner
2011 — book
Algorithms Unplugged
Algorithms Unplugged
Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2011 — conf
An Experimental Study on Generating Planar Graphs.
FAW-AAIM
Sascha Meinert, Dorothea Wagner
2011 — book
Ausgezeichnete Informatikdissertationen 2010
Ausgezeichnete Informatikdissertationen
Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2011 J jnl
Computing large matchings in planar graphs with fixed minimum degree.
Theor. Comput. Sci.
Robert Franke, Ignaz Rutter, Dorothea Wagner
2011 — conf
Connecting Two Trees with Optimal Routing Cost.
CCCG
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner
2011 B conf
Density-Constrained Graph Clustering.
WADS
Robert Görke, Andrea Schumm, Dorothea Wagner
2011 J jnl
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
CoRR
Dennis Schieferdecker, Markus Völker, Dorothea Wagner
2011 B conf
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks.
SEA
Dennis Schieferdecker, Markus Völker, Dorothea Wagner
2011 J jnl
Experimental study of speed up techniques for timetable information systems.
Networks
Reinhard Bauer, Daniel Delling, Dorothea Wagner
2011 J jnl
Experiments on Density-Constrained Graph Clustering
CoRR
Robert Görke, Andrea Schumm, Dorothea Wagner
2011 B conf
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.
WADS
Christof Doll, Tanja Hartmann, Dorothea Wagner
2011 A conf
Generalizing Geometric Graphs.
GD
Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2011 B conf
Generating Time Dependencies in Road Networks.
SEA
Sascha Meinert, Dorothea Wagner
2011 — ch.
Maximum Flows - Towards the Stadium During Rush Hour.
Algorithms Unplugged
Robert Görke, Steffen Mecke, Dorothea Wagner
2011 B conf
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling.
SEA
Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner
2011 Misc conf
The Density Maximization Problem in Graphs.
COCOON
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
2010 — book
Ausgezeichnete Informatikdissertationen 2008
Ausgezeichnete Informatikdissertationen
Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2010 — book
Ausgezeichnete Informatikdissertationen 2009
Ausgezeichnete Informatikdissertationen
Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2010 J jnl
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm.
ACM J. Exp. Algorithmics
Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner
2010 J jnl
Computational Aspects of Lucidity-Driven Graph Clustering.
J. Graph Algorithms Appl.
Robert Görke, Marco Gaertler, Florian Hübner, Dorothea Wagner
2010 J jnl
Determining and interpreting correlations in lipidomic networks found in glioblastoma cells.
BMC Syst. Biol.
Robert Görke, Anke Meyer-Bäse, Dorothea Wagner, Huan He, Mark R. Emmett, Charles A. Conrad
2010 B conf
Energy efficient scheduling with power control for wireless networks.
WiOpt
Bastian Katz, Markus Völker, Dorothea Wagner
2010 — conf
Enumerating and Generating Labeled k-degenerate Graphs.
ANALCO
Reinhard Bauer, Marcus Krug, Dorothea Wagner
2010 B conf
Gateway Decompositions for Constrained Reachability Problems.
SEA
Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner
2010 B conf
Modularity-Driven Clustering of Dynamic Graphs.
SEA
Robert Görke, Pascal Maillard, Christian Staudt, Dorothea Wagner
2010 A conf
Orthogonal Graph Drawing with Flexibility Constraints.
GD
Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner
2010 C conf
Preprocessing Speed-Up Techniques Is Hard.
CIAC
Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner
2010 B conf
Space-Efficient SHARC-Routing.
SEA
Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner
2010 C conf
Synthetic Road Networks.
AAIM
Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner
2009 A conf
Accelerating Multi-modal Route Planning by Access-Nodes.
ESA
Daniel Delling, Thomas Pajor, Dorothea Wagner
2009 — ed.
Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126]
Algorithmics of Large and Complex Networks
Jürgen Lerner, Dorothea Wagner, Katharina A. Zweig
2009 B conf
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study.
SEA
Reinhard Bauer, Dorothea Wagner
2009 B conf
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.
ISAAC
Robert Franke, Ignaz Rutter, Dorothea Wagner
2009 B conf
Dynamic Graph Clustering Using Minimum-Cut Trees.
WADS
Robert Görke, Tanja Hartmann, Dorothea Wagner
2009 C conf
Efficient Route Planning in Flight Networks.
ATMOS
Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis
2009 — conf
Engineering Route Planning Algorithms.
Algorithmics of Large and Complex Networks
Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
2009 — ch.
Engineering Time-Expanded Graphs for Faster Timetable Information.
Robust and Online Large-Scale Optimization
Daniel Delling, Thomas Pajor, Dorothea Wagner
2009 J jnl
Engineering planar separator algorithms.
ACM J. Exp. Algorithmics
Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos D. Zaroliagis
2009 — conf
Group-Level Analysis and Visualization of Social Networks.
Algorithmics of Large and Complex Networks
Michael Baur, Ulrik Brandes, Jürgen Lerner, Dorothea Wagner
2009 C conf
Orca Reduction and ContrAction Graph Clustering.
AAIM
Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner
2009 B conf
Pareto Paths with SHARC.
SEA
Daniel Delling, Dorothea Wagner
2009 J jnl
Preface.
ACM J. Exp. Algorithmics
J. Ian Munro, Dorothea Wagner
2009 J jnl
The Continuous Stop Location Problem in Public Transportation Networks.
Asia Pac. J. Oper. Res.
Anita Schöbel, Horst W. Hamacher, Annegret Liebers, Dorothea Wagner
2009 B conf
The Shortcut Problem - Complexity and Approximation.
SOFSEM
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
2009 — ch.
Time-Dependent Route Planning.
Robust and Online Large-Scale Optimization
Daniel Delling, Dorothea Wagner
2008 — conf
08191 Working Group Report - Visualization of Trajectories.
Graph Drawing with Applications to Bioinformatics and Social Sciences
Stephen P. Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen G. Kobourov, Anna Lubiw, Dorothea Wagner
2008 J jnl
Augmenting
Networks Heterog. Media
Michael Baur, Marco Gaertler, Robert Görke, Marcus Krug, Dorothea Wagner
2008 — book
Ausgezeichnete Informatikdissertationen 2007
Ausgezeichnete Informatikdissertationen
Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner
2008 — conf
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.
WEA
Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner
2008 C conf
Efficient Scheduling of Data-Harvesting Trees.
ALGOSENSORS
Bastian Katz, Steffen Mecke, Dorothea Wagner
2008 C conf
Engineering Comparators for Graph Clusterings.
AAIM
Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner
2008 C conf
Engineering Label-Constrained Shortest-Path Algorithms.
AAIM
Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner
2008 C conf
Engineering Time-Expanded Graphs for Faster Timetable Information.
ATMOS
Daniel Delling, Thomas Pajor, Dorothea Wagner
2008 J jnl
Engineering multilevel overlay graphs for shortest-path queries.
ACM J. Exp. Algorithmics
Martin Holzer, Frank Schulz, Dorothea Wagner
2008 J jnl
Guest Editor's Foreword.
J. Graph Algorithms Appl.
Michael Kaufmann, Dorothea Wagner
2008 C conf
Link Scheduling in Local Interference Models.
ALGOSENSORS
Bastian Katz, Markus Völker, Dorothea Wagner
2008 — ch.
Maximale Flüsse - Die ganze Stadt will zum Stadion.
Taschenbuch der Algorithmen
Dorothea Wagner, Robert Görke, Steffen Mecke
2008 J jnl
On Modularity Clustering.
IEEE Trans. Knowl. Data Eng.
Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner
2008 A ed.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008
ALENEX
J. Ian Munro, Dorothea Wagner
2008 — book
Taschenbuch der Algorithmen
Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner
2007 — conf
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks.
SOFSEM (1)
Markus Maier, Steffen Mecke, Dorothea Wagner
2007 C ed.
Algorithmic Methods for Railway Optimization, International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers
ATMOS
Frank Geraets, Leo G. Kroon, Anita Schöbel, Dorothea Wagner, Christos D. Zaroliagis
2007 — ed.
Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures [result from a Dagstuhl seminar].
Algorithms for Sensor and Ad Hoc Networks
Dorothea Wagner, Roger Wattenhofer
2007 A conf
Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
ALENEX
Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner
2007 J jnl
Efficient models for timetable information in public transportation systems.
ACM J. Exp. Algorithmics
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
2007 J jnl
Engineering graph clustering: Models and experimental evaluation.
ACM J. Exp. Algorithmics
Ulrik Brandes, Marco Gaertler, Dorothea Wagner
2007 C conf
Experimental Study on Speed-Up Techniques for Timetable Information Systems.
ATMOS
Reinhard Bauer, Daniel Delling, Dorothea Wagner
2007 A ed.
Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers
GD
Michael Kaufmann, Dorothea Wagner
2007 — conf
Landmark-Based Routing in Dynamic Graphs.
WEA
Daniel Delling, Dorothea Wagner
2007 A conf
LunarVis - Analytic Visualizations of Large Graphs.
GD
Robert Görke, Marco Gaertler, Dorothea Wagner
2007 — conf
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks.
SOFSEM (1)
Bastian Katz, Marco Gaertler, Dorothea Wagner
2007 A conf
Minimizing the Area for Planar Straight-Line Grid Drawings.
GD
Marcus Krug, Dorothea Wagner
2007 B conf
On Finding Graph Clusterings with Maximum Modularity.
WG
Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner
2007 C conf
Significance-Driven Graph Clustering.
AAIM
Marco Gaertler, Robert Görke, Dorothea Wagner
2007 A conf
Speed-Up Techniques for Shortest-Path Computations.
STACS
Dorothea Wagner, Thomas Willhalm
2006 — conf
06091 Abstracts Collection -- Data Structures.
Data Structures
Lars Arge, Robert Sedgewick, Dorothea Wagner
2006 — conf
06091 Executive Summary -- Data Structures.
Data Structures
Lars Arge, Robert Sedgewick, Dorothea Wagner
2006 — ed.
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005
Algorithmic Aspects of Large and Complex Networks
Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner
2006 — book
Ausgezeichnete Informatikdissertationen 2005
Ausgezeichnete Informatikdissertationen
Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Dorothea Wagner
2006 — book
Ausgezeichnete Informatikdissertationen 2006
Ausgezeichnete Informatikdissertationen
Dorothea Wagner, et al.
2006 J jnl
Completely connected clustered graphs.
J. Discrete Algorithms
Sabine Cornelsen, Dorothea Wagner
2006 — ed.
Data Structures, 26.02. - 03.03.2006
Data Structures
Lars Arge, Robert Sedgewick, Dorothea Wagner
2006 — conf
Engineering Label-Constrained Shortest-Path Algorithms.
The Shortest Path Problem
Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner
2006 A conf
Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.
ALENEX
Martin Holzer, Frank Schulz, Dorothea Wagner
2006 — conf
High-Performance Multi-Level Routing.
The Shortest Path Problem
Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner
2006 — conf
Highway Hierarchies Star.
The Shortest Path Problem
Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
2006 J jnl
Partitioning graphs to speedup Dijkstra's algorithm.
ACM J. Exp. Algorithmics
Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
2005 — conf
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks.
Algorithmic Aspects of Large and Complex Networks
Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner
2005 — conf
A Hybrid Model for Drawing Dynamic and Evolving Graphs.
Algorithmic Aspects of Large and Complex Networks
Marco Gaertler, Dorothea Wagner
2005 A conf
A Hybrid Model for Drawing Dynamic and Evolving Graphs.
GD
Marco Gaertler, Dorothea Wagner
2005 J jnl
Approximating Clustering Coefficient and Transitivity.
J. Graph Algorithms Appl.
Thomas Schank, Dorothea Wagner
2005 — book
Ausgezeichnete Informatikdissertationen 2004
Ausgezeichnete Informatikdissertationen
Thomas Dreier, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Rüdiger Reischuk, Dietmar Saupe, Dorothea Wagner
2005 J jnl
Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles.
J. Graph Algorithms Appl.
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
2005 J jnl
Combining speed-up techniques for shortest-path computations.
ACM J. Exp. Algorithmics
Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm
2005 — ed.
Data Structures, 22.-27. February 2004
Data Structures
Susanne Albers, Robert Sedgewick, Dorothea Wagner
2005 — conf
Drawing Graphs to Speed Up Shortest-Path Computations.
ALENEX/ANALCO
Dorothea Wagner, Thomas Willhalm
2005 A conf
Engineering Planar Separator Algorithms.
ESA
Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
2005 — conf
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study.
WEA
Thomas Schank, Dorothea Wagner
2005 J jnl
Geometric containers for efficient shortest-path computation.
ACM J. Exp. Algorithmics
Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
2005 A conf
Graph-Drawing Contest Report.
GD
Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner
2005 — conf
Partitioning Graphs to Speed Up Dijkstra's Algorithm.
WEA
Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
2005 C conf
Station Location - Complexity and Approximation.
ATMOS
Steffen Mecke, Anita Schöbel, Dorothea Wagner
2004 — conf
04091 Abstracts Collection - Data Structures.
Data Structures
Susanne Albers, Robert Sedgewick, Dorothea Wagner
2004 — conf
04261 Abstracts Collection - Algorithmic Methods for Railway Optimization.
Algorithmic Methods for Railway Optimization
Leo G. Kroon, Dorothea Wagner, Frank Geraets, Christos D. Zaroliagis
2004 — ed.
Algorithmic Methods for Railway Optimization, 20.06. - 25.06.2004
Algorithmic Methods for Railway Optimization
Leo G. Kroon, Frank Geraets, Dorothea Wagner, Christos D. Zaroliagis
2004 — ch.
Analysis and Visualization of Social Networks.
Graph Drawing Software
Ulrik Brandes, Dorothea Wagner
2004 — book
Ausgezeichnete Informatikdissertationen 2003
Ausgezeichnete Informatikdissertationen
Heinz Beilner, Thomas Dreier, Markus Gross, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner
2004 J jnl
Drawing Graphs on Two and Three Lines.
J. Graph Algorithms Appl.
Sabine Cornelsen, Thomas Schank, Dorothea Wagner
2004 A conf
Drawing the AS Graph in 2.5 Dimensions.
GD
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner
2004 — conf
Experimental Comparison of Shortest Path Approaches for Timetable Information.
ALENEX/ANALC
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
2004 J jnl
Foreword: Special Issue of Journal of Discrete Algorithms on the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '2000) held June 15-17, 2000 in Konstanz, Germany.
J. Discrete Algorithms
Ulrik Brandes, Dorothea Wagner
2004 J jnl
Generating node coordinates for shortest-path computations in transportation networks.
ACM J. Exp. Algorithmics
Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
2004 J jnl
How to draw the minimum cuts of a planar graph.
Comput. Geom.
Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner
2004 J jnl
Netzwerkvisualisierung.
it Inf. Technol.
Ulrik Brandes, Dorothea Wagner
2004 A conf
Solving Geometric Covering Problems by Data Reduction.
ESA
Steffen Mecke, Dorothea Wagner
2004 C conf
Timetable Information: Models and Algorithms.
ATMOS
Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
2003 B conf
Algorithms and Models for Railway Optimization.
WADS
Dorothea Wagner
2003 — conf
Analysis and Visualization of Social Networks.
WEA
Dorothea Wagner
2003 A conf
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles.
GD
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
2003 J jnl
Communicating Centrality in Policy Network Drawings.
IEEE Trans. Vis. Comput. Graph.
Ulrik Brandes, Patrick Kenis, Dorothea Wagner
2003 B conf
Completely Connected Clustered Graphs.
WG
Sabine Cornelsen, Dorothea Wagner
2003 J jnl
DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke".
it Inf. Technol.
Dorothea Wagner
2003 C conf
Dynamic Shortest Paths Containers.
ATMOS
Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
2003 A conf
Experiments on Graph Clustering Algorithms.
ESA
Ulrik Brandes, Marco Gaertler, Dorothea Wagner
2003 A conf
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
ESA
Dorothea Wagner, Thomas Willhalm
2003 C conf
The Station Location Problem on Two Intersecting Lines.
ATMOS
Maria Flavia Mammana, Steffen Mecke, Dorothea Wagner
2003 C conf
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.
ATMOS
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
2002 C ed.
Algorithmic Methods and Models for Optimization of Railways, ATMOS 2002, ICALP 2002 Satellite Workshop, Malaga, Spain, July 13, 2002
ATMOS
Dorothea Wagner
2002 — book
Ausgezeichnete Informatikdissertationen 2002
Ausgezeichnete Informatikdissertationen
Heinz Beilner, Herbert Fiedler, Markus Gross, Oliver Günther, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner
2002 A conf
Drawing Graphs on Two and Three Lines.
GD
Sabine Cornelsen, Thomas Schank, Dorothea Wagner
2002 C conf
Preface.
ATMOS
Dorothea Wagner
2002 A conf
Sketch-Driven Orthogonal Graph Drawing.
GD
Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner
2002 A conf
Using Multi-level Graphs for Timetable Information in Railway Systems.
ALENEX
Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
2001 — ed.
Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings
Stefan Näher, Dorothea Wagner
2001 — book
Ausgezeichnete Informatikdissertationen 2001
Ausgezeichnete Informatikdissertationen
Heinz Beilner, Herbert Fiedler, Oliver Günther, Steffen Hölldobler, Günter Hotz, Peter Liggesmeyer, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner
2001 — ed.
Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999).
Drawing Graphs
Michael Kaufmann, Dorothea Wagner
2001 J jnl
Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections.
J. Soc. Struct.
Ulrik Brandes, Jörg Raab, Dorothea Wagner
2001 J jnl
Guest Editors' Foreword.
J. Graph Algorithms Appl.
Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
2001 C conf
Locating New Stops in a Railway Network.
ATMOS
Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner
2001 B conf
Planarity of the 2-Level Cactus Model.
WG
Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
2001 A conf
Travel Planning with Self-Made Maps.
ALENEX
Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
2001 A conf
Visone.
GD
Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner
2000 J jnl
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs.
Algorithmica
Ulrik Brandes, Dorothea Wagner
2000 — book
Ausgezeichnete Informatikdissertationen 1999
Herbert Fiedler, Oliver Günther, Werner Grass, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner
2000 — book
Ausgezeichnete Informatikdissertationen 2000
Ausgezeichnete Informatikdissertationen
Herbert Fiedler, Werner Grass, Oliver Günther, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner
2000 — conf
Contextual Visualization of Actor Status in Social Networks.
VisSym
Ulrik Brandes, Dorothea Wagner
2000 J jnl
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
ACM J. Exp. Algorithmics
Frank Schulz, Dorothea Wagner, Karsten Weihe
2000 J jnl
Dynamic WWW Structures in 3D.
J. Graph Algorithms Appl.
Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm
2000 J jnl
Editorial: Discrete algorithm engineering.
Softw. Pract. Exp.
Dorothea Wagner, Karsten Weihe
2000 A conf
Fast Layout Methods for Timetable Graphs.
GD
Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner
2000 J jnl
Foreword.
Algorithmica
Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
2000 B ed.
Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings
WG
Ulrik Brandes, Dorothea Wagner
2000 A conf
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract).
GD
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
2000 J jnl
On the Complexity of Partial Order Properties.
Order
Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner
2000 J jnl
On the Hardness of Recognizing Bundles in Time Table Graphs.
Int. J. Found. Comput. Sci.
Annegret Liebers, Dorothea Wagner, Karsten Weihe
2000 J jnl
Using Graph Layout to Visualize Train Interconnection Data.
J. Graph Algorithms Appl.
Ulrik Brandes, Dorothea Wagner
1999 J jnl
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks.
Discret. Appl. Math.
Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe
1999 A conf
Centrality in Policy Network Drawings.
GD
Ulrik Brandes, Patrick Kenis, Dorothea Wagner
1999 — conf
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport.
WAE
Frank Schulz, Dorothea Wagner, Karsten Weihe
1999 — conf
Empirical Design of Geometric Algorithms.
SCG
Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
1999 B conf
On the Hardness of Recognizing Bundles in Time Table Graphs.
WG
Annegret Liebers, Dorothea Wagner, Karsten Weihe
1999 J jnl
Wiring edge-disjoint layouts.
Comput. Geom.
Ruth Kuchem, Dorothea Wagner
1999 — ch.
Über das Zeichnen von Graphen.
Angewandte Mathematik, insbesondere Informatik
Ulrik Brandes, Dorothea Wagner
1998 B conf
Dynamic Grid Embedding with Few Bends and Changes.
ISAAC
Ulrik Brandes, Dorothea Wagner
1998 A conf
Using Graph Layout to Visualize Train Interconnection Data.
GD
Ulrik Brandes, Dorothea Wagner
1997 A conf
A Bayesian Paradigm for Dynamic Graph Layout.
GD
Ulrik Brandes, Dorothea Wagner
1997 A conf
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract).
ESA
Ulrik Brandes, Dorothea Wagner
1997 J jnl
The Vertex-Disjoint Menger Problem in Planar Graphs.
SIAM J. Comput.
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1996 J jnl
C++ im Nebenfachstudium: Konzepte und Erfahrungen.
Inform. Spektrum
Annegret Liebers, Dorothea Wagner, Karsten Weihe
1996 J jnl
Efficient Parallel Matrix Inversion on Interconnection Networks.
J. Parallel Distributed Comput.
Andreas Schikarski, Dorothea Wagner
1996 J jnl
Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.
Int. J. Found. Comput. Sci.
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1996 J jnl
Optimizing Area for Three-Layer Knock-Knee Channel Routing.
Algorithmica
Ruth Kuchem, Dorothea Wagner, Frank Wagner
1996 A conf
Wiring Edge-Disjoint Layouts.
GD
Ruth Kuchem, Dorothea Wagner
1995 J jnl
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.
Comb.
Dorothea Wagner, Karsten Weihe
1995 — conf
An Animated Library of Combinatorial VLSI-Routing Algorithms.
SCG
Dorothea Wagner, Karsten Weihe
1994 Misc conf
Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated.
VLSI Design
Paul Molitor, Uwe Sparmann, Dorothea Wagner
1994 J jnl
Wiring Knock-Knee Layouts: A Global Approach.
IEEE Trans. Computers
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
1993 A conf
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs.
ESA
Dorothea Wagner, Karsten Weihe
1993 B conf
Between Min Cut and Graph Bisection.
MFCS
Dorothea Wagner, Frank Wagner
1993 — conf
Efficient algorithms for disjoint paths in planar graphs.
Combinatorial Optimization
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1993 B conf
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.
ISAAC
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1993 J jnl
Modeling Hypergraphs by Graphs with the Same Mincut Properties.
Inf. Process. Lett.
Edmund Ihler, Dorothea Wagner, Frank Wagner
1993 J jnl
Optimal routing through dense chanels.
Int. J. Comput. Geom. Appl.
Dorothea Wagner
1993 J jnl
Routing through a Dense Channel with Minimum Total Wire Length.
J. Algorithms
Michael Formann, Dorothea Wagner, Frank Wagner
1993 A* conf
The Vertex-Disjoint Menger Problem in Planar Graphs.
SODA
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1992 J jnl
An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem.
Discret. Appl. Math.
Dorothea Wagner, Frank Wagner
1992 J jnl
Book review.
ZOR Methods Model. Oper. Res.
Dorothea Wagner
1992 B conf
On the Complexity of Partial Order Properties.
WG
Stefan Felsner, Dorothea Wagner
1992 B conf
Wiring Knock-Knee Layouts: A Global Appoach.
ISAAC
Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
1991 — conf
A New Approach to Knock-Knee Channel Routing.
ISA
Dorothea Wagner
1991 J jnl
A generalization of the zero-one principle for sorting algorithms.
Discret. Appl. Math.
Dorothea Wagner, Frank Wagner
1991 A* conf
Routing through a Dense Channel with Minimum Total Wire Length.
SODA
Michael Formann, Dorothea Wagner, Frank Wagner
1991 J jnl
α-Vertex separator is NP-hard even for 3-regular graphs.
Computing
Rudolf Müller, Dorothea Wagner
1990 J jnl
Decomposition of k-ary relations.
Discret. Math.
Dorothea Wagner
1989 A* conf
Area-Optimal Three-Layer Channel Routing
FOCS
Ruth Kuchem, Dorothea Wagner, Frank Wagner