Area-Optimal Three-Layer Channel Routing - Ruth Kuchem; Dorothea Wagner; Frank Wagner 001 (FOCS, 1989)

Decomposition of k-ary relations. - Dorothea Wagner (Discret. Math., 1990)

A New Approach to Knock-Knee Channel Routing. - Dorothea Wagner (ISA, 1991)

α-Vertex separator is NP-hard even for 3-regular graphs. - Rudolf Müller; Dorothea Wagner (Computing, 1991)

A generalization of the zero-one principle for sorting algorithms. - Dorothea Wagner; Frank Wagner 001 (Discret. Appl. Math., 1991)

Wiring Knock-Knee Layouts: A Global Appoach. - Majid Sarrafzadeh; Dorothea Wagner; Frank Wagner 001; Karsten Weihe (ISAAC, 1992)

On the Complexity of Partial Order Properties. - Stefan Felsner; Dorothea Wagner (WG, 1992)

An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. - Dorothea Wagner; Frank Wagner 001 (Discret. Appl. Math., 1992)

Book review. - Dorothea Wagner (ZOR Methods Model. Oper. Res., 1992)

Efficient algorithms for disjoint paths in planar graphs. - Heike Ripphausen-Lipa; Dorothea Wagner; Karsten Weihe (Combinatorial Optimization, 1993)

Between Min Cut and Graph Bisection. - Dorothea Wagner; Frank Wagner 001 (MFCS, 1993)

Optimal routing through dense chanels. - Dorothea Wagner (Int. J. Comput. Geom. Appl., 1993)

Modeling Hypergraphs by Graphs with the Same Mincut Properties. - Edmund Ihler; Dorothea Wagner; Frank Wagner 001 (Inf. Process. Lett., 1993)

Routing through a Dense Channel with Minimum Total Wire Length. - Michael Formann; Dorothea Wagner; Frank Wagner 001 (J. Algorithms, 1993)

Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated. - Paul Molitor; Uwe Sparmann; Dorothea Wagner (VLSI Design, 1994)

Wiring Knock-Knee Layouts: A Global Approach. - Majid Sarrafzadeh; Dorothea Wagner; Frank Wagner 001; Karsten Weihe (IEEE Trans. Computers, 1994)

An Animated Library of Combinatorial VLSI-Routing Algorithms. - Dorothea Wagner; Karsten Weihe (SCG, 1995)

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. - Dorothea Wagner; Karsten Weihe (Comb., 1995)

Optimizing Area for Three-Layer Knock-Knee Channel Routing. - Ruth Kuchem; Dorothea Wagner; Frank Wagner 001 (Algorithmica, 1996)

Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. - Heike Ripphausen-Lipa; Dorothea Wagner; Karsten Weihe (Int. J. Found. Comput. Sci., 1996)

C++ im Nebenfachstudium: Konzepte und Erfahrungen. - Annegret Liebers; Dorothea Wagner; Karsten Weihe (Inform. Spektrum, 1996)

Efficient Parallel Matrix Inversion on Interconnection Networks. - Andreas Schikarski; Dorothea Wagner (J. Parallel Distributed Comput., 1996)

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). - Ulrik Brandes; Dorothea Wagner (ESA, 1997)

A Bayesian Paradigm for Dynamic Graph Layout. - Ulrik Brandes; Dorothea Wagner (GD, 1997)

The Vertex-Disjoint Menger Problem in Planar Graphs. - Heike Ripphausen-Lipa; Dorothea Wagner; Karsten Weihe (SIAM J. Comput., 1997)

Dynamic Grid Embedding with Few Bends and Changes. - Ulrik Brandes; Dorothea Wagner (ISAAC, 1998)

Über das Zeichnen von Graphen. - Ulrik Brandes; Dorothea Wagner (Angewandte Mathematik, insbesondere Informatik, 1999)

Empirical Design of Geometric Algorithms. - Karsten Weihe; Ulrik Brandes; Annegret Liebers; Matthias Müller-Hannemann; Dorothea Wagner; Thomas Willhalm (SCG, 1999)

Centrality in Policy Network Drawings. - Ulrik Brandes; Patrick Kenis; Dorothea Wagner (GD, 1999)

Wiring edge-disjoint layouts. - Ruth Kuchem; Dorothea Wagner (Comput. Geom., 1999)

A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. - Ulrik Brandes; Wolfram Schlickenrieder; Gabriele Neyer; Dorothea Wagner; Karsten Weihe (Discret. Appl. Math., 1999)

How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). - Ulrik Brandes; Sabine Cornelsen; Dorothea Wagner (GD, 2000)

Fast Layout Methods for Timetable Graphs. - Ulrik Brandes; Galina Shubina; Roberto Tamassia; Dorothea Wagner (GD, 2000)

Contextual Visualization of Actor Status in Social Networks. - Ulrik Brandes; Dorothea Wagner (VisSym, 2000)

A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. - Ulrik Brandes; Dorothea Wagner (Algorithmica, 2000)

Foreword. - Takao Nishizeki; Roberto Tamassia; Dorothea Wagner (Algorithmica, 2000)

On the Hardness of Recognizing Bundles in Time Table Graphs. - Annegret Liebers; Dorothea Wagner; Karsten Weihe (Int. J. Found. Comput. Sci., 2000)

Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. - Frank Schulz 001; Dorothea Wagner; Karsten Weihe (ACM J. Exp. Algorithmics, 2000)

Dynamic WWW Structures in 3D. - Ulrik Brandes; Vanessa Kääb; Andres Löh; Dorothea Wagner; Thomas Willhalm (J. Graph Algorithms Appl., 2000)

Using Graph Layout to Visualize Train Interconnection Data. - Ulrik Brandes; Dorothea Wagner (J. Graph Algorithms Appl., 2000)

On the Complexity of Partial Order Properties. - Stefan Felsner; Ravi Kant; C. Pandu Rangan; Dorothea Wagner (Order, 2000)

Editorial: Discrete algorithm engineering. - Dorothea Wagner; Karsten Weihe (Softw. Pract. Exp., 2000)

Travel Planning with Self-Made Maps. - Ulrik Brandes; Frank Schulz 001; Dorothea Wagner; Thomas Willhalm (ALENEX, 2001)

Visone. - Michael Baur; Marc Benkert; Ulrik Brandes; Sabine Cornelsen; Marco Gaertler; Boris Köpf; Jürgen Lerner; Dorothea Wagner (GD, 2001)

Planarity of the 2-Level Cactus Model. - Sabine Cornelsen; Yefim Dinitz; Dorothea Wagner (WG, 2001)

Locating New Stops in a Railway Network. - Horst W. Hamacher; Annegret Liebers; Anita Schöbel; Dorothea Wagner; Frank Wagner 001 (ATMOS, 2001)

Guest Editors' Foreword. - Takao Nishizeki; Roberto Tamassia; Dorothea Wagner (J. Graph Algorithms Appl., 2001)

Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections. - Ulrik Brandes; Jörg Raab; Dorothea Wagner (J. Soc. Struct., 2001)

Using Multi-level Graphs for Timetable Information in Railway Systems. - Frank Schulz 001; Dorothea Wagner; Christos D. Zaroliagis (ALENEX, 2002)

Sketch-Driven Orthogonal Graph Drawing. - Ulrik Brandes; Markus Eiglsperger; Michael Kaufmann 001; Dorothea Wagner (GD, 2002)

Preface. - Dorothea Wagner (ATMOS, 2002)

Experiments on Graph Clustering Algorithms. - Ulrik Brandes; Marco Gaertler; Dorothea Wagner (ESA, 2003)

Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. - Dorothea Wagner; Thomas Willhalm (ESA, 2003)

Algorithms and Models for Railway Optimization. - Dorothea Wagner (WADS, 2003)

Analysis and Visualization of Social Networks. - Dorothea Wagner (WEA, 2003)

The Station Location Problem on Two Intersecting Lines. - Maria Flavia Mammana; Steffen Mecke; Dorothea Wagner (ATMOS, 2003)

Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. - Evangelia Pyrga; Frank Schulz 001; Dorothea Wagner; Christos D. Zaroliagis (ATMOS, 2003)

Dynamic Shortest Paths Containers. - Dorothea Wagner; Thomas Willhalm; Christos D. Zaroliagis (ATMOS, 2003)

DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke". - Dorothea Wagner (it Inf. Technol., 2003)

Communicating Centrality in Policy Network Drawings. - Ulrik Brandes; Patrick Kenis; Dorothea Wagner (IEEE Trans. Vis. Comput. Graph., 2003)

Analysis and Visualization of Social Networks. - Ulrik Brandes; Dorothea Wagner (Graph Drawing Software, 2004)

Experimental Comparison of Shortest Path Approaches for Timetable Information. - Evangelia Pyrga; Frank Schulz 001; Dorothea Wagner; Christos D. Zaroliagis (ALENEX/ANALC, 2004)

Timetable Information: Models and Algorithms. - Matthias Müller-Hannemann; Frank Schulz 001; Dorothea Wagner; Christos D. Zaroliagis (ATMOS, 2004)

04091 Abstracts Collection - Data Structures. - Susanne Albers; Robert Sedgewick; Dorothea Wagner (Data Structures, 2004)

04261 Abstracts Collection - Algorithmic Methods for Railway Optimization. - Leo G. Kroon; Dorothea Wagner; Frank Geraets; Christos D. Zaroliagis (Algorithmic Methods for Railway Optimization, 2004)

Solving Geometric Covering Problems by Data Reduction. - Steffen Mecke; Dorothea Wagner (ESA, 2004)

Drawing the AS Graph in 2.5 Dimensions. - Michael Baur; Ulrik Brandes; Marco Gaertler; Dorothea Wagner (GD, 2004)

How to draw the minimum cuts of a planar graph. - Ulrik Brandes; Sabine Cornelsen; Christian Fieß; Dorothea Wagner (Comput. Geom., 2004)

Netzwerkvisualisierung. - Ulrik Brandes; Dorothea Wagner (it Inf. Technol., 2004)

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. - Ulrik Brandes; Dorothea Wagner (J. Discrete Algorithms, 2004)

Generating node coordinates for shortest-path computations in transportation networks. - Ulrik Brandes; Frank Schulz 001; Dorothea Wagner; Thomas Willhalm (ACM J. Exp. Algorithmics, 2004)

Drawing Graphs on Two and Three Lines. - Sabine Cornelsen; Thomas Schank; Dorothea Wagner (J. Graph Algorithms Appl., 2004)

Drawing Graphs to Speed Up Shortest-Path Computations. - Dorothea Wagner; Thomas Willhalm (ALENEX/ANALCO, 2005)

Station Location - Complexity and Approximation. - Steffen Mecke; Anita Schöbel; Dorothea Wagner (ATMOS, 2005)

05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. - Stefano Leonardi 001; Friedhelm Meyer auf der Heide; Dorothea Wagner (Algorithmic Aspects of Large and Complex Networks, 2005)

Graph-Drawing Contest Report. - Christian A. Duncan; Stephen G. Kobourov; Dorothea Wagner (GD, 2005)

A Hybrid Model for Drawing Dynamic and Evolving Graphs. - Marco Gaertler; Dorothea Wagner (GD, 2005)

Partitioning Graphs to Speed Up Dijkstra's Algorithm. - Rolf H. Möhring; Heiko Schilling; Birk Schütz; Dorothea Wagner; Thomas Willhalm (WEA, 2005)

Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. - Thomas Schank; Dorothea Wagner (WEA, 2005)

Combining speed-up techniques for shortest-path computations. - Martin Holzer 001; Frank Schulz 001; Dorothea Wagner; Thomas Willhalm (ACM J. Exp. Algorithmics, 2005)

Geometric containers for efficient shortest-path computation. - Dorothea Wagner; Thomas Willhalm; Christos D. Zaroliagis (ACM J. Exp. Algorithmics, 2005)

Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles. - Ulrik Brandes; Sabine Cornelsen; Dorothea Wagner (J. Graph Algorithms Appl., 2005)

Approximating Clustering Coefficient and Transitivity. - Thomas Schank; Dorothea Wagner (J. Graph Algorithms Appl., 2005)

Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. - Martin Holzer 001; Frank Schulz 001; Dorothea Wagner (ALENEX, 2006)

06091 Executive Summary – Data Structures. - Lars Arge; Robert Sedgewick; Dorothea Wagner (Data Structures, 2006)

06091 Abstracts Collection – Data Structures. - Lars Arge; Robert Sedgewick; Dorothea Wagner (Data Structures, 2006)

High-Performance Multi-Level Routing. - Daniel Delling; Martin Holzer 001; Kirill Müller; Frank Schulz 001; Dorothea Wagner (The Shortest Path Problem, 2006)

Highway Hierarchies Star. - Daniel Delling; Peter Sanders 001; Dominik Schultes; Dorothea Wagner (The Shortest Path Problem, 2006)

Completely connected clustered graphs. - Sabine Cornelsen; Dorothea Wagner (J. Discrete Algorithms, 2006)

Partitioning graphs to speedup Dijkstra's algorithm. - Rolf H. Möhring; Heiko Schilling; Birk Schütz; Dorothea Wagner; Thomas Willhalm (ACM J. Exp. Algorithmics, 2006)

Significance-Driven Graph Clustering. - Marco Gaertler; Robert Görke; Dorothea Wagner (AAIM, 2007)

Computing Many-to-Many Shortest Paths Using Highway Hierarchies. - Sebastian Knopp; Peter Sanders 001; Dominik Schultes; Frank Schulz 001; Dorothea Wagner (ALENEX, 2007)

LunarVis - Analytic Visualizations of Large Graphs. - Robert Görke; Marco Gaertler; Dorothea Wagner (GD, 2007)

Minimizing the Area for Planar Straight-Line Grid Drawings. - Marcus Krug; Dorothea Wagner (GD, 2007)

Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. - Bastian Katz; Marco Gaertler; Dorothea Wagner (SOFSEM (1), 2007)

Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. - Markus Maier; Steffen Mecke; Dorothea Wagner (SOFSEM (1), 2007)

Speed-Up Techniques for Shortest-Path Computations. - Dorothea Wagner; Thomas Willhalm (STACS, 2007)

Landmark-Based Routing in Dynamic Graphs. - Daniel Delling; Dorothea Wagner (WEA, 2007)

On Finding Graph Clusterings with Maximum Modularity. - Ulrik Brandes; Daniel Delling; Marco Gaertler; Robert Görke; Martin Hoefer 001; Zoran Nikoloski; Dorothea Wagner (WG, 2007)

Engineering graph clustering: Models and experimental evaluation. - Ulrik Brandes; Marco Gaertler; Dorothea Wagner (ACM J. Exp. Algorithmics, 2007)

Efficient models for timetable information in public transportation systems. - Evangelia Pyrga; Frank Schulz 001; Dorothea Wagner; Christos D. Zaroliagis (ACM J. Exp. Algorithmics, 2007)

Engineering Label-Constrained Shortest-Path Algorithms. - Christopher L. Barrett; Keith R. Bisset; Martin Holzer 001; Goran Konjevod; Madhav V. Marathe; Dorothea Wagner (AAIM, 2008)

Engineering Comparators for Graph Clusterings. - Daniel Delling; Marco Gaertler; Robert Görke; Dorothea Wagner (AAIM, 2008)

Efficient Scheduling of Data-Harvesting Trees. - Bastian Katz; Steffen Mecke; Dorothea Wagner (ALGOSENSORS, 2008)

Link Scheduling in Local Interference Models. - Bastian Katz; Markus Völker; Dorothea Wagner (ALGOSENSORS, 2008)

Engineering Time-Expanded Graphs for Faster Timetable Information. - Daniel Delling; Thomas Pajor; Dorothea Wagner (ATMOS, 2008)

08191 Working Group Report - Visualization of Trajectories. - Stephen P. Borgatti; Ulrik Brandes; Michael Kaufmann 001; Stephen G. Kobourov; Anna Lubiw; Dorothea Wagner (Graph Drawing with Applications to Bioinformatics and Social Sciences, 2008)

Engineering multilevel overlay graphs for shortest-path queries. - Martin Holzer 001; Frank Schulz 001; Dorothea Wagner (ACM J. Exp. Algorithmics, 2008)

Guest Editor's Foreword. - Michael Kaufmann 001; Dorothea Wagner (J. Graph Algorithms Appl., 2008)

Augmenting k-core generation with preferential attachment. - Michael Baur; Marco Gaertler; Robert Görke; Marcus Krug; Dorothea Wagner (Networks Heterog. Media, 2008)

On Modularity Clustering. - Ulrik Brandes; Daniel Delling; Marco Gaertler; Robert Görke; Martin Hoefer 001; Zoran Nikoloski; Dorothea Wagner (IEEE Trans. Knowl. Data Eng., 2008)

Maximale Flüsse - Die ganze Stadt will zum Stadion. - Dorothea Wagner; Robert Görke; Steffen Mecke (Taschenbuch der Algorithmen, 2008)

Orca Reduction and ContrAction Graph Clustering. - Daniel Delling; Robert Görke; Christian Schulz 003; Dorothea Wagner (AAIM, 2009)

Efficient Route Planning in Flight Networks. - Daniel Delling; Thomas Pajor; Dorothea Wagner; Christos D. Zaroliagis (ATMOS, 2009)

Group-Level Analysis and Visualization of Social Networks. - Michael Baur; Ulrik Brandes; Jürgen Lerner; Dorothea Wagner (Algorithmics of Large and Complex Networks, 2009)

Engineering Route Planning Algorithms. - Daniel Delling; Peter Sanders 001; Dominik Schultes; Dorothea Wagner (Algorithmics of Large and Complex Networks, 2009)

Accelerating Multi-modal Route Planning by Access-Nodes. - Daniel Delling; Thomas Pajor; Dorothea Wagner (ESA, 2009)

The Shortcut Problem - Complexity and Approximation. - Reinhard Bauer; Gianlorenzo D'Angelo; Daniel Delling; Dorothea Wagner (SOFSEM, 2009)

Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. - Reinhard Bauer; Dorothea Wagner (SEA, 2009)

Pareto Paths with SHARC. - Daniel Delling; Dorothea Wagner (SEA, 2009)

The Continuous Stop Location Problem in Public Transportation Networks. - Anita Schöbel; Horst W. Hamacher; Annegret Liebers; Dorothea Wagner (Asia Pac. J. Oper. Res., 2009)

Engineering planar separator algorithms. - Martin Holzer 001; Frank Schulz 001; Dorothea Wagner; Grigorios Prasinos; Christos D. Zaroliagis (ACM J. Exp. Algorithmics, 2009)

Preface. - J. Ian Munro; Dorothea Wagner (ACM J. Exp. Algorithmics, 2009)

Engineering Time-Expanded Graphs for Faster Timetable Information. - Daniel Delling; Thomas Pajor; Dorothea Wagner (Robust and Online Large-Scale Optimization, 2009)

Time-Dependent Route Planning. - Daniel Delling; Dorothea Wagner (Robust and Online Large-Scale Optimization, 2009)

Synthetic Road Networks. - Reinhard Bauer; Marcus Krug; Sascha Meinert; Dorothea Wagner (AAIM, 2010)

Enumerating and Generating Labeled k-degenerate Graphs. - Reinhard Bauer; Marcus Krug; Dorothea Wagner (ANALCO, 2010)

Preprocessing Speed-Up Techniques Is Hard. - Reinhard Bauer; Tobias Columbus; Bastian Katz; Marcus Krug; Dorothea Wagner (CIAC, 2010)

Space-Efficient SHARC-Routing. - Edith Brunel; Daniel Delling; Andreas Gemsa; Dorothea Wagner (SEA, 2010)

Modularity-Driven Clustering of Dynamic Graphs. - Robert Görke; Pascal Maillard; Christian Staudt; Dorothea Wagner (SEA, 2010)

Gateway Decompositions for Constrained Reachability Problems. - Bastian Katz; Marcus Krug; Andreas Lochbihler; Ignaz Rutter; Gregor Snelting; Dorothea Wagner (SEA, 2010)

Energy efficient scheduling with power control for wireless networks. - Bastian Katz; Markus Völker; Dorothea Wagner (WiOpt, 2010)

Determining and interpreting correlations in lipidomic networks found in glioblastoma cells. - Robert Görke; Anke Meyer-Bäse; Dorothea Wagner; Huan He; Mark R. Emmett; Charles A. Conrad (BMC Syst. Biol., 2010)

Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. - Reinhard Bauer; Daniel Delling; Peter Sanders 001; Dennis Schieferdecker; Dominik Schultes; Dorothea Wagner (ACM J. Exp. Algorithmics, 2010)

Computational Aspects of Lucidity-Driven Graph Clustering. - Robert Görke; Marco Gaertler; Florian Hübner; Dorothea Wagner (J. Graph Algorithms Appl., 2010)

Maximum Flows - Towards the Stadium During Rush Hour. - Robert Görke; Steffen Mecke; Dorothea Wagner (Algorithms Unplugged, 2011)

An Experimental Study on Generating Planar Graphs. - Sascha Meinert; Dorothea Wagner (FAW-AAIM, 2011)

Connecting Two Trees with Optimal Routing Cost. - Mong-Jen Kao; Bastian Katz; Marcus Krug; D. T. Lee; Martin Nöllenburg; Ignaz Rutter; Dorothea Wagner (CCCG, 2011)

Algorithm Engineering for Route Planning - An Update -. - Dorothea Wagner (ISAAC, 2011)

Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. - Christof Doll; Tanja Hartmann; Dorothea Wagner (WADS, 2011)

Density-Constrained Graph Clustering. - Robert Görke; Andrea Schumm; Dorothea Wagner (WADS, 2011)

Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. - Bastian Katz; Ignaz Rutter; Ben Strasser; Dorothea Wagner (SEA, 2011)

Generating Time Dependencies in Road Networks. - Sascha Meinert; Dorothea Wagner (SEA, 2011)

Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. - Dennis Schieferdecker; Markus Völker; Dorothea Wagner (SEA, 2011)

Algorithm Engineering. - Peter Sanders 001; Dorothea Wagner (it Inf. Technol., 2011)

Experimental study of speed up techniques for timetable information systems. - Reinhard Bauer; Daniel Delling; Dorothea Wagner (Networks, 2011)

Computing large matchings in planar graphs with fixed minimum degree. - Robert Franke; Ignaz Rutter; Dorothea Wagner (Theor. Comput. Sci., 2011)

User-Constrained Multi-Modal Route Planning. - Julian Dibbelt; Thomas Pajor; Dorothea Wagner (ALENEX, 2012)

Experiments on Density-Constrained Graph Clustering. - Robert Görke; Andrea Schumm; Dorothea Wagner (ALENEX, 2012)

Static and Dynamic Aspects of Scientific Collaboration Networks. - Christian Staudt; Andrea Schumm; Henning Meyerhenke; Robert Görke; Dorothea Wagner (ASONAM, 2012)

Complete hierarchical cut-clustering: A case study on expansion and modularity. - Michael Hamann; Tanja Hartmann; Dorothea Wagner (Graph Partitioning and Graph Clustering, 2012)

Column-Based Graph Layouts. - Gregor Betz; Christoph Doll; Andreas Gemsa; Ignaz Rutter; Dorothea Wagner (GD, 2012)

Force-directed tracking in wireless networks using signal strength and step recognition. - Markus Völker; Dorothea Wagner; Johannes Schmid; Tobias Gädeke; Klaus D. Müller-Glaser (ICL-GNSS, 2012)

Fast and Simple Fully-Dynamic Cut Tree Construction. - Tanja Hartmann; Dorothea Wagner (ISAAC, 2012)

Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. - Mong-Jen Kao; Jian-Jia Chen; Ignaz Rutter; Dorothea Wagner (ISAAC, 2012)

Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks. - Fabian Fuchs; Markus Völker; Dorothea Wagner (MedAlg, 2012)

An Efficient Generator for Clustered Dynamic Random Networks. - Robert Görke; Roland Kluge; Andrea Schumm; Christian Staudt; Dorothea Wagner (MedAlg, 2012)

Higher Order City Voronoi Diagrams. - Andreas Gemsa; D. T. Lee; Chih-Hung Liu 001; Dorothea Wagner (SWAT, 2012)

The Shortcut Problem - Complexity and Algorithms. - Reinhard Bauer; Gianlorenzo D'Angelo; Daniel Delling; Andrea Schumm; Dorothea Wagner (J. Graph Algorithms Appl., 2012)

Dynamic Graph Clustering Using Minimum-Cut Trees. - Robert Görke; Tanja Hartmann; Dorothea Wagner (J. Graph Algorithms Appl., 2012)

On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model. - Fabian Fuchs; Dorothea Wagner (ALGOSENSORS, 2013)

Energy-optimal routes for electric vehicles. - Moritz Baum; Julian Dibbelt; Thomas Pajor; Dorothea Wagner (SIGSPATIAL/GIS, 2013)

A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs. - Liang Zhao 013; Hiroshi Kadowaki; Dorothea Wagner (ICA3PP (2), 2013)

Hierarchies of Predominantly Connected Communities. - Michael Hamann; Tanja Hartmann; Dorothea Wagner (WADS, 2013)

Computing Multimodal Journeys in Practice. - Daniel Delling; Julian Dibbelt; Thomas Pajor; Dorothea Wagner; Renato F. Werneck (SEA, 2013)

Intriguingly Simple and Fast Transit Routing. - Julian Dibbelt; Thomas Pajor; Ben Strasser; Dorothea Wagner (SEA, 2013)

Efficient Computation of Jogging Routes. - Andreas Gemsa; Thomas Pajor; Dorothea Wagner; Tobias Zündorf (SEA, 2013)

Dynamic Gomory-Hu Tree Construction - fast and simple. - Tanja Hartmann; Dorothea Wagner (CoRR, 2013)

Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch - Mong-Jen Kao; Der-Tsai Lee; Dorothea Wagner (CoRR, 2013)

Online Power-Managing Strategy with Hard Real-Time Guarantees - Jian-Jia Chen; Mong-Jen Kao; D. T. Lee; Ignaz Rutter; Dorothea Wagner (CoRR, 2013)

Algorithm Engineering (Dagstuhl Seminar 13391). - Andrew V. Goldberg; Giuseppe F. Italiano; David S. Johnson 001; Dorothea Wagner (Dagstuhl Reports, 2013)

Identifikation von Clustern in Graphen. - Robert Görke; Tanja Hartmann; Andrea Kappes; Dorothea Wagner (Inform. Spektrum, 2013)

The density maximization problem in graphs. - Mong-Jen Kao; Bastian Katz; Marcus Krug; D. T. Lee; Ignaz Rutter; Dorothea Wagner (J. Comb. Optim., 2013)

Dynamic graph clustering combining modularity and smoothness. - Robert Görke; Pascal Maillard; Andrea Schumm; Christian Staudt; Dorothea Wagner (ACM J. Exp. Algorithmics, 2013)

On the Complexity of Partitioning Graphs for Arc-Flags. - Reinhard Bauer; Moritz Baum; Ignaz Rutter; Dorothea Wagner (J. Graph Algorithms Appl., 2013)

Social Networks. - Ulrik Brandes; Linton C. Freeman; Dorothea Wagner (Handbook of Graph Drawing and Visualization, 2013)

Connection Scan Accelerated. - Ben Strasser; Dorothea Wagner (ALENEX, 2014)

Speed-Consumption Tradeoff for Electric Vehicle Route Planning. - Moritz Baum; Julian Dibbelt; Lorenz Hübschle-Schneider; Thomas Pajor; Dorothea Wagner (ATMOS, 2014)

Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time. - Julian Dibbelt; Ben Strasser; Dorothea Wagner (ATMOS, 2014)

Local Broadcasting with Arbitrary Transmission Power in the SINR Model. - Fabian Fuchs; Dorothea Wagner (SIROCCO, 2014)

Graph Clustering with Surprise: Complexity and Exact Solutions. - Tobias Fleck; Andrea Kappes; Dorothea Wagner (SOFSEM, 2014)

Erratum: Customizable Contraction Hierarchies. - Julian Dibbelt; Ben Strasser; Dorothea Wagner (SEA, 2014)

Orthogonal Graph Drawing with Flexibility Constraints. - Thomas Bläsius; Marcus Krug; Ignaz Rutter; Dorothea Wagner (Algorithmica, 2014)

Arbitrary Transmission Power in the SINR Model: Local Broadcasting, Coloring and MIS. - Fabian Fuchs; Dorothea Wagner (CoRR, 2014)

Clustering Evolving Networks. - Tanja Hartmann; Andrea Kappes; Dorothea Wagner (CoRR, 2014)

EATCS Fellows 2015 - Call for Nominations. - Dorothea Wagner (Bull. EATCS, 2014)

User-Constrained Multimodal Route Planning. - Julian Dibbelt; Thomas Pajor; Dorothea Wagner (ACM J. Exp. Algorithmics, 2014)

Experiments on Density-Constrained Graph Clustering. - Robert Görke; Andrea Kappes; Dorothea Wagner (ACM J. Exp. Algorithmics, 2014)

Column-Based Graph Layouts. - Gregor Betz; Andreas Gemsa; Christof Mathies; Ignaz Rutter; Dorothea Wagner (J. Graph Algorithms Appl., 2014)

Generalizing Geometric Graphs. - Edith Brunel; Andreas Gemsa; Marcus Krug; Ignaz Rutter; Dorothea Wagner (J. Graph Algorithms Appl., 2014)

Benchmarking for Graph Clustering and Partitioning. - David A. Bader; Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003; Andrea Kappes; Dorothea Wagner (Encyclopedia of Social Network Analysis and Mining, 2014)

Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies. - Ben Strasser; Dorothea Wagner (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

Analysis and Experimental Evaluation of Time-Dependent Distance Oracles. - Spyros C. Kontogiannis; George Michalopoulos; Georgia Papastavrou; Andreas Paraskevopoulos; Dorothea Wagner; Christos D. Zaroliagis (ALENEX, 2015)

Structure-Preserving Sparsification of Social Networks. - Gerd Lindner; Christian L. Staudt; Michael Hamann; Henning Meyerhenke; Dorothea Wagner (ASONAM, 2015)

Towards Realistic Pedestrian Route Planning. - Simeon Andreev; Julian Dibbelt; Martin Nöllenburg; Thomas Pajor; Dorothea Wagner (ATMOS, 2015)

Operating Power Grids with Few Flow Control Buses. - Thomas Leibfried; Tamara Mchedlidze; Nico Meyer-Hübner; Martin Nöllenburg; Ignaz Rutter; Peter Sanders 001; Dorothea Wagner; Franziska Wegner (e-Energy, 2015)

Towards Realistic Flow Control in Power Grid Operation. - Tamara Mchedlidze; Martin Nöllenburg; Ignaz Rutter; Dorothea Wagner; Franziska Wegner (D-A-CH EI, 2015)

Fast Quasi-Threshold Editing. - Ulrik Brandes; Michael Hamann; Ben Strasser; Dorothea Wagner (ESA, 2015)

Fast exact shortest path and distance queries on road networks with parametrized costs. - Julian Dibbelt; Ben Strasser; Dorothea Wagner (SIGSPATIAL/GIS, 2015)

Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs. - Patricia Iglesias Sánchez; Emmanuel Müller; Uwe Leo Korn; Klemens Böhm; Andrea Kappes; Tanja Hartmann; Dorothea Wagner (SDM, 2015)

Route Planning in Transportation Networks. - Hannah Bast; Daniel Delling; Andrew V. Goldberg; Matthias Müller-Hannemann; Thomas Pajor; Peter Sanders 001; Dorothea Wagner; Renato F. Werneck (CoRR, 2015)

Fast Computation of Isochrones in Road Networks. - Moritz Baum; Valentin Buchhold; Julian Dibbelt; Dorothea Wagner (CoRR, 2015)

Hierarchical Oracles for Time-Dependent Networks. - Spyros C. Kontogiannis; Dorothea Wagner; Christos D. Zaroliagis (CoRR, 2015)

Online dynamic power management with hard real-time guarantees. - Jian-Jia Chen; Mong-Jen Kao; D. T. Lee; Ignaz Rutter; Dorothea Wagner (Theor. Comput. Sci., 2015)

Engineering Oracles for Time-Dependent Road Networks. - Spyros C. Kontogiannis; George Michalopoulos; Georgia Papastavrou; Andreas Paraskevopoulos; Dorothea Wagner; Christos D. Zaroliagis (ALENEX, 2016)

Hierarchical Time-Dependent Oracles. - Spyros C. Kontogiannis; Dorothea Wagner; Christos D. Zaroliagis (ISAAC, 2016)

Fast Exact Computation of Isochrones in Road Networks. - Moritz Baum; Valentin Buchhold; Julian Dibbelt; Dorothea Wagner (SEA, 2016)

Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. - Moritz Baum; Julian Dibbelt; Thomas Pajor; Dorothea Wagner (SEA, 2016)

Algorithmic Methods for Optimization in Public Transport (Dagstuhl Seminar 16171). - Leo G. Kroon; Anita Schöbel; Dorothea Wagner (Dagstuhl Reports, 2016)

Towards route planning algorithms for electric vehicles with realistic constraints. - Moritz Baum; Julian Dibbelt; Andreas Gemsa; Dorothea Wagner (Comput. Sci. Res. Dev., 2016)

Customizable Contraction Hierarchies. - Julian Dibbelt; Ben Strasser; Dorothea Wagner (ACM J. Exp. Algorithmics, 2016)

Structure-preserving sparsification methods for social networks. - Michael Hamann; Gerd Lindner; Henning Meyerhenke; Christian L. Staudt; Dorothea Wagner (Soc. Netw. Anal. Min., 2016)

Optimal Orthogonal Graph Drawing with Convex Bend Costs. - Thomas Bläsius; Ignaz Rutter; Dorothea Wagner (ACM Trans. Algorithms, 2016)

Search-space size in contraction hierarchies. - Reinhard Bauer; Tobias Columbus; Ignaz Rutter; Dorothea Wagner (Theor. Comput. Sci., 2016)

Route Planning in Transportation Networks. - Hannah Bast; Daniel Delling; Andrew V. Goldberg; Matthias Müller-Hannemann; Thomas Pajor; Peter Sanders 001; Dorothea Wagner; Renato F. Werneck (Algorithm Engineering, 2016)

Clustering Evolving Networks. - Tanja Hartmann; Andrea Kappes; Dorothea Wagner (Algorithm Engineering, 2016)

I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. - Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Dorothea Wagner (ALENEX, 2017)

Improved Oracles for Time-Dependent Road Networks. - Spyros C. Kontogiannis; Georgia Papastavrou; Andreas Paraskevopoulos; Dorothea Wagner; Christos D. Zaroliagis (ATMOS, 2017)

Public Transit Routing with Unrestricted Walking. - Dorothea Wagner; Tobias Zündorf (ATMOS, 2017)

A Simulated-Annealing-Based Approach for Wind Farm Cabling. - Sebastian Lehmann; Ignaz Rutter; Dorothea Wagner; Franziska Wegner (e-Energy, 2017)

Time-Dependent Route Planning for Truck Drivers. - Alexander Kleff; Christian Bräuer; Frank Schulz 001; Valentin Buchhold; Moritz Baum; Dorothea Wagner (ICCL, 2017)

Benchmark Generator for Dynamic Overlapping Communities in Networks. - Neha Sengupta; Michael Hamann; Dorothea Wagner (ICDM, 2017)

Eco-aware vehicle routing in urban environments. - Julian Dibbelt; Dionisis D. Kehagias; Grammati E. Pantziou; Damianos Gavalas; Charalampos Konstantopoulos; Dorothea Wagner; Kalliopi Giannakopoulou; Spyros C. Kontogiannis; Christos D. Zaroliagis (ISCC, 2017)

Multimodal route and tour planning in urban environments. - Julian Dibbelt; Charalampos Konstantopoulos; Dorothea Wagner; Damianos Gavalas; Spyros C. Kontogiannis; Christos D. Zaroliagis; Vlasios Kasapakis; Grammati E. Pantziou (ISCC, 2017)

Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications. - Moritz Baum; Jonas Sauer; Dorothea Wagner; Tobias Zündorf (SEA, 2017)

Efficient Traffic Assignment for Public Transit Networks. - Lars Briem; H. Sebastian Buck; Holger Ebhart; Nicolai Mallig; Ben Strasser; Peter Vortisch; Dorothea Wagner; Tobias Zündorf (SEA, 2017)

Local Community Detection Based on Small Cliques. - Michael Hamann; Eike Röhrs; Dorothea Wagner (Algorithms, 2017)

Simple Distributed Graph Clustering using Modularity and Map Equation. - Michael Hamann; Ben Strasser; Dorothea Wagner; Tim Zeitz (CoRR, 2017)

A Geometric Heuristic for Rectilinear Crossing Minimization. - Marcel Radermacher; Klara Reichard; Ignaz Rutter; Dorothea Wagner (ALENEX, 2018)

An equal opportunity concept for the coordinated research effort AESC. - Anne Koziolek; Peter Sanders 001; Dorothea Wagner (ECSA (Companion), 2018)

How much demand side flexibility do we need?: Analyzing where to exploit flexibility in industrial processes. - Lukas Barth; Veit Hagenmeyer; Nicole Ludwig 002; Dorothea Wagner (e-Energy, 2018)

The Maximum Transmission Switching Flow Problem. - Alban Grastien; Ignaz Rutter; Dorothea Wagner; Franziska Wegner; Matthias Wolf 004 (e-Energy, 2018)

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. - Corrie Jacobien Carstens; Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Dorothea Wagner (ESA, 2018)

Distributed Graph Clustering Using Modularity and Map Equation. - Michael Hamann; Ben Strasser; Dorothea Wagner; Tim Zeitz (Euro-Par, 2018)

Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (SEA, 2018)

Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization. - Sascha Gritzbach; Torsten Ueckerdt; Dorothea Wagner; Franziska Wegner; Matthias Wolf 004 (Energy Inform., 2018)

Towards negative cycle canceling in wind farm cable layout optimization. - Sascha Gritzbach; Torsten Ueckerdt; Dorothea Wagner; Franziska Wegner; Matthias Wolf 004 (Energy Inform., 2018)

Exploiting flexibility in smart grids at scale. - Lukas Barth; Dorothea Wagner (Comput. Sci. Res. Dev., 2018)

Poster abstract: graph-theoretic model for observability in multi-carrier energy distribution networks. - Sören Hohmann; Heiko Maaß; Carina Mieth; Martin Pfeifer; Dorothea Wagner; Franziska Wegner (Comput. Sci. Res. Dev., 2018)

Connection Scan Algorithm. - Julian Dibbelt; Thomas Pajor; Ben Strasser; Dorothea Wagner (ACM J. Exp. Algorithmics, 2018)

I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. - Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Dorothea Wagner (ACM J. Exp. Algorithmics, 2018)

Benchmarking for Graph Clustering and Partitioning. - David A. Bader; Andrea Kappes; Henning Meyerhenke; Peter Sanders 001; Christian Schulz 003; Dorothea Wagner (Encyclopedia of Social Network Analysis and Mining. 2nd Ed., 2018)

Industrial Demand-Side Flexibility: A Benchmark Data Set. - Nicole Ludwig 002; Lukas Barth; Dorothea Wagner; Veit Hagenmeyer (e-Energy, 2019)

Shaving Peaks by Augmenting the Dependency Graph. - Lukas Barth; Dorothea Wagner (e-Energy, 2019)

UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution. - Moritz Baum; Valentin Buchhold; Jonas Sauer; Dorothea Wagner; Tobias Zündorf (ESA, 2019)

Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. - Lars Gottesbüren; Michael Hamann; Dorothea Wagner (ESA, 2019)

Engineering Negative Cycle Canceling for Wind Farm Cabling. - Sascha Gritzbach; Torsten Ueckerdt; Dorothea Wagner; Franziska Wegner; Matthias Wolf 004 (ESA, 2019)

Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (SIGSPATIAL/GIS, 2019)

Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA. - Jonas Sauer; Dorothea Wagner; Tobias Zündorf (SIGSPATIAL/GIS, 2019)

Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. - Lars Gottesbüren; Michael Hamann; Tim Niklas Uhl; Dorothea Wagner (Algorithms, 2019)

Fast Exact Computation of Isocontours in Road Networks. - Moritz Baum; Valentin Buchhold; Julian Dibbelt; Dorothea Wagner (ACM J. Exp. Algorithmics, 2019)

Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (ACM J. Exp. Algorithmics, 2019)

Geometric Heuristics for Rectilinear Crossing Minimization. - Marcel Radermacher; Klara Reichard; Ignaz Rutter; Dorothea Wagner (ACM J. Exp. Algorithmics, 2019)

Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles. - Moritz Baum; Julian Dibbelt; Andreas Gemsa; Dorothea Wagner; Tobias Zündorf (Transp. Sci., 2019)

Engineering Top-Down Weight-Balanced Trees. - Lukas Barth; Dorothea Wagner (ALENEX, 2020)

Customizable Contraction Hierarchies with Turn Costs. - Valentin Buchhold; Dorothea Wagner; Tim Zeitz; Michael Zündorf (ATMOS, 2020)

An Efficient Solution for One-To-Many Multi-Modal Journey Planning. - Jonas Sauer; Dorothea Wagner; Tobias Zündorf (ATMOS, 2020)

Integrating ULTRA and Trip-Based Routing. - Jonas Sauer; Dorothea Wagner; Tobias Zündorf (ATMOS, 2020)

Negative Cycle Canceling with Neighborhood Heuristics for the Wind Farm Cabling Problem. - Sascha Gritzbach; Dorothea Wagner; Matthias Wolf 004 (e-Energy, 2020)

Preventing Critical Edges when Designing Transmission Networks. - Dorothea Wagner; Matthias Wolf 004 (e-Energy, 2020)

Zipping Segment Trees. - Lukas Barth; Dorothea Wagner (SEA, 2020)

Engineering Exact Quasi-Threshold Editing. - Lars Gottesbüren; Michael Hamann; Philipp Schoch; Ben Strasser; Dorothea Wagner; Sven Zühlsdorf (SEA, 2020)

Advanced Flow-Based Multilevel Hypergraph Partitioning. - Lars Gottesbüren; Michael Hamann; Sebastian Schlag; Dorothea Wagner (SEA, 2020)

Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA. - Jonas Sauer; Dorothea Wagner; Tobias Zündorf (SEA, 2020)

Energy-Optimal Routes for Battery Electric Vehicles. - Moritz Baum; Julian Dibbelt; Thomas Pajor; Jonas Sauer; Dorothea Wagner; Tobias Zündorf (Algorithmica, 2020)

Integrating public transport into mobiTopp. - Lars Briem; H. Sebastian Buck; Nicolai Mallig; Peter Vortisch; Ben Strasser; Dorothea Wagner; Tobias Zündorf (Future Gener. Comput. Syst., 2020)

Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. - Moritz Baum; Julian Dibbelt; Dorothea Wagner; Tobias Zündorf (Transp. Sci., 2020)

Fast, Exact and Scalable Dynamic Ridesharing. - Valentin Buchhold; Peter Sanders 001; Dorothea Wagner (ALENEX, 2021)

The Complexity of Flow Expansion and Electrical Flow Expansion. - Dorothea Wagner; Matthias Wolf 004 (SOFSEM, 2021)

Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. - Valentin Buchhold; Dorothea Wagner (SEA, 2021)

Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. - Ben Strasser; Dorothea Wagner; Tim Zeitz (Algorithms, 2021)

Open and autonomous. The basis for trust in science. - Dorothea Wagner (Inf. Serv. Use, 2021)

Skeleton-Based Clustering by Quasi-Threshold Editing. - Ulrik Brandes; Michael Hamann; Luise Häuser; Dorothea Wagner (Algorithms for Big Data, 2022)

An Axiomatic Approach to Time-Dependent Shortest Path Oracles. - Spyros C. Kontogiannis; Dorothea Wagner; Christos D. Zaroliagis (Algorithmica, 2022)

ULTRA: Unlimited Transfers for Efficient Multimodal Journey Planning. - Moritz Baum; Valentin Buchhold; Jonas Sauer; Dorothea Wagner; Tobias Zündorf (Transp. Sci., 2023)

More Recent Advances in (Hyper)Graph Partitioning. - Ümit V. Çatalyürek; Karen D. Devine; Marcelo Fonseca Faraj; Lars Gottesbüren; Tobias Heuer; Henning Meyerhenke; Peter Sanders 001; Sebastian Schlag; Christian Schulz 003; Daniel Seemaier; Dorothea Wagner (ACM Comput. Surv., 2023)

Customizable Contraction Hierarchies - A Survey. - Thomas Bläsius; Valentin Buchhold; Dorothea Wagner; Tim Zeitz; Michael Zündorf (CoRR, 2025)