Dorothea Wagner
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
114
Venues
27
Active years
1989–2021
Best venue rank
A*
Where they publish
- AGD18 papers
- AALENEX15 papers
- CATMOS14 papers
- AESA14 papers
- BISAAC8 papers
- CAAIM6 papers
- BSOFSEM5 papers
- BWADS5 papers
- BWG5 papers
- CAlgosensors3 papers
- CISCC2 papers
- ASTACS2 papers
- A*ICALP2 papers
- A*SODA2 papers
- BECSA1 paper
- BEuroPar1 paper
- UnrankedANT1 paper
- A*ICDM1 paper
- ASDM1 paper
- BSIROCCO1 paper
- CICA3PP1 paper
- NationalCOCOON1 paper
- CCIAC1 paper
- BWiOpt1 paper
- NationalVLSID1 paper
- BMFCS1 paper
- A*FOCS1 paper
Papers
114 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2021 | ALENEX | Fast, Exact and Scalable Dynamic Ridesharing. | Valentin Buchhold, Peter Sanders, Dorothea Wagner |
| 2021 | SOFSEM | The Complexity of Flow Expansion and Electrical Flow Expansion. | Dorothea Wagner, Matthias Wolf |
| 2020 | ALENEX | Engineering Top-Down Weight-Balanced Trees. | Lukas Barth, Dorothea Wagner |
| 2020 | ATMOS | Customizable Contraction Hierarchies with Turn Costs. | Valentin Buchhold, Dorothea Wagner, Tim Zeitz, Michael Zndorf |
| 2020 | ATMOS | An Efficient Solution for One-To-Many Multi-Modal Journey Planning. | Jonas Sauer, Dorothea Wagner, Tobias Zndorf |
| 2020 | ATMOS | Integrating ULTRA and Trip-Based Routing. | Jonas Sauer, Dorothea Wagner, Tobias Zndorf |
| 2020 | ESA | Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. | Ben Strasser, Dorothea Wagner, Tim Zeitz |
| 2019 | ESA | UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution. | Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zndorf |
| 2019 | ESA | Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. | Lars Gottesbren, Michael Hamann, Dorothea Wagner |
| 2019 | ESA | Engineering Negative Cycle Canceling for Wind Farm Cabling. | Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf |
| 2018 | ALENEX | A Geometric Heuristic for Rectilinear Crossing Minimization. | Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner |
| 2018 | ECSA | An equal opportunity concept for the coordinated research effort AESC. | Anne Koziolek, Peter Sanders, Dorothea Wagner |
| 2018 | ESA | Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. | Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner |
| 2018 | EuroPar | Distributed Graph Clustering Using Modularity and Map Equation. | Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz |
| 2017 | ALENEX | I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. | Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner |
| 2017 | ANT | Integrating public transport into mobiTopp. | Lars Briem, H. Sebastian Buck, Nicolai Mallig, Peter Vortisch, Ben Strasser, Dorothea Wagner, Tobias Zndorf |
| 2017 | ATMOS | Improved Oracles for Time-Dependent Road Networks. | Spyros C. Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis |
| 2017 | ATMOS | Public Transit Routing with Unrestricted Walking. | Dorothea Wagner, Tobias Zndorf |
| 2017 | ESA | Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. | Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zndorf |
| 2017 | ICDM | Benchmark Generator for Dynamic Overlapping Communities in Networks. | Neha Sengupta, Michael Hamann, Dorothea Wagner |
| 2017 | ISCC | 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 |
| 2017 | ISCC | 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 |
| 2016 | ALENEX | Engineering Oracles for Time-Dependent Road Networks. | Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis |
| 2016 | ISAAC | Hierarchical Time-Dependent Oracles. | Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis |
| 2015 | ALENEX | Analysis and Experimental Evaluation of Time-Dependent Distance Oracles. | Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis |
| 2015 | ATMOS | Towards Realistic Pedestrian Route Planning. | Simeon Andreev, Julian Dibbelt, Martin Nllenburg, Thomas Pajor, Dorothea Wagner |
| 2015 | ESA | Fast Quasi-Threshold Editing. | Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner |
| 2015 | SDM | Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs. | Patricia Iglesias Snchez, Emmanuel Mller, Uwe Leo Korn, Klemens Bhm, Andrea Kappes, Tanja Hartmann, Dorothea Wagner |
| 2014 | ALENEX | Connection Scan Accelerated. | Ben Strasser, Dorothea Wagner |
| 2014 | ATMOS | Speed-Consumption Tradeoff for Electric Vehicle Route Planning. | Moritz Baum, Julian Dibbelt, Lorenz Hbschle-Schneider, Thomas Pajor, Dorothea Wagner |
| 2014 | ATMOS | Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time. | Julian Dibbelt, Ben Strasser, Dorothea Wagner |
| 2014 | STACS | Online Dynamic Power Management with Hard Real-Time Guarantees. | Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner |
| 2014 | SIROCCO | Local Broadcasting with Arbitrary Transmission Power in the SINR Model. | Fabian Fuchs, Dorothea Wagner |
| 2014 | SOFSEM | Graph Clustering with Surprise: Complexity and Exact Solutions. | Tobias Fleck, Andrea Kappes, Dorothea Wagner |
| 2013 | Algosensors | On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model. | Fabian Fuchs, Dorothea Wagner |
| 2013 | ICA3PP | A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs. | Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner |
| 2013 | ICALP | Search-Space Size in Contraction Hierarchies. | Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner |
| 2013 | ICALP | Optimal Orthogonal Graph Drawing with Convex Bend Costs. | Thomas Blsius, Ignaz Rutter, Dorothea Wagner |
| 2013 | WADS | Hierarchies of Predominantly Connected Communities. | Michael Hamann, Tanja Hartmann, Dorothea Wagner |
| 2012 | ALENEX | User-Constrained Multi-Modal Route Planning. | Julian Dibbelt, Thomas Pajor, Dorothea Wagner |
| 2012 | ALENEX | Experiments on Density-Constrained Graph Clustering. | Robert Grke, Andrea Schumm, Dorothea Wagner |
| 2012 | ATMOS | On the Complexity of Partitioning Graphs for Arc-Flags. | Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner |
| 2012 | GD | Column-Based Graph Layouts. | Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner |
| 2012 | ISAAC | Fast and Simple Fully-Dynamic Cut Tree Construction. | Tanja Hartmann, Dorothea Wagner |
| 2012 | ISAAC | Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. | Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner |
| 2011 | AAIM | An Experimental Study on Generating Planar Graphs. | Sascha Meinert, Dorothea Wagner |
| 2011 | COCOON | The Density Maximization Problem in Graphs. | Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner |
| 2011 | GD | Generalizing Geometric Graphs. | Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner |
| 2011 | ISAAC | Algorithm Engineering for Route Planning - An Update -. | Dorothea Wagner |
| 2011 | WADS | Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. | Christof Doll, Tanja Hartmann, Dorothea Wagner |
| 2011 | WADS | Density-Constrained Graph Clustering. | Robert Grke, Andrea Schumm, Dorothea Wagner |
| 2010 | AAIM | Synthetic Road Networks. | Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner |
| 2010 | CIAC | Preprocessing Speed-Up Techniques Is Hard. | Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner |
| 2010 | GD | Orthogonal Graph Drawing with Flexibility Constraints. | Thomas Blsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner |
| 2010 | WiOpt | Energy efficient scheduling with power control for wireless networks. | Bastian Katz, Markus Vlker, Dorothea Wagner |
| 2009 | AAIM | Orca Reduction and ContrAction Graph Clustering. | Daniel Delling, Robert Grke, Christian Schulz, Dorothea Wagner |
| 2009 | ATMOS | Efficient Route Planning in Flight Networks. | Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis |
| 2009 | ESA | Accelerating Multi-modal Route Planning by Access-Nodes. | Daniel Delling, Thomas Pajor, Dorothea Wagner |
| 2009 | ISAAC | Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. | Robert Franke, Ignaz Rutter, Dorothea Wagner |
| 2009 | SOFSEM | The Shortcut Problem - Complexity and Approximation. | Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner |
| 2009 | WADS | Dynamic Graph Clustering Using Minimum-Cut Trees. | Robert Grke, Tanja Hartmann, Dorothea Wagner |
| 2008 | AAIM | Engineering Label-Constrained Shortest-Path Algorithms. | Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner |
| 2008 | AAIM | Engineering Comparators for Graph Clusterings. | Daniel Delling, Marco Gaertler, Robert Grke, Dorothea Wagner |
| 2008 | Algosensors | Efficient Scheduling of Data-Harvesting Trees. | Bastian Katz, Steffen Mecke, Dorothea Wagner |
| 2008 | Algosensors | Link Scheduling in Local Interference Models. | Bastian Katz, Markus Vlker, Dorothea Wagner |
| 2008 | ATMOS | Engineering Time-Expanded Graphs for Faster Timetable Information. | Daniel Delling, Thomas Pajor, Dorothea Wagner |
| 2007 | AAIM | Significance-Driven Graph Clustering. | Marco Gaertler, Robert Grke, Dorothea Wagner |
| 2007 | ALENEX | Computing Many-to-Many Shortest Paths Using Highway Hierarchies. | Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner |
| 2007 | ATMOS | Experimental Study on Speed-Up Techniques for Timetable Information Systems. | Reinhard Bauer, Daniel Delling, Dorothea Wagner |
| 2007 | GD | LunarVis - Analytic Visualizations of Large Graphs. | Robert Grke, Marco Gaertler, Dorothea Wagner |
| 2007 | GD | Minimizing the Area for Planar Straight-Line Grid Drawings. | Marcus Krug, Dorothea Wagner |
| 2007 | STACS | Speed-Up Techniques for Shortest-Path Computations. | Dorothea Wagner, Thomas Willhalm |
| 2007 | SOFSEM | Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. | Bastian Katz, Marco Gaertler, Dorothea Wagner |
| 2007 | SOFSEM | Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. | Markus Maier, Steffen Mecke, Dorothea Wagner |
| 2007 | WG | On Finding Graph Clusterings with Maximum Modularity. | Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Grke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner |
| 2006 | ALENEX | Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. | Martin Holzer, Frank Schulz, Dorothea Wagner |
| 2005 | ALENEX | Drawing Graphs to Speed Up Shortest-Path Computations. | Dorothea Wagner, Thomas Willhalm |
| 2005 | ATMOS | Station Location - Complexity and Approximation. | Steffen Mecke, Anita Schbel, Dorothea Wagner |
| 2005 | ESA | Engineering Planar Separator Algorithms. | Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis |
| 2005 | GD | Graph-Drawing Contest Report. | Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner |
| 2005 | GD | A Hybrid Model for Drawing Dynamic and Evolving Graphs. | Marco Gaertler, Dorothea Wagner |
| 2004 | ALENEX | Experimental Comparison of Shortest Path Approaches for Timetable Information. | Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis |
| 2004 | ATMOS | Timetable Information: Models and Algorithms. | Matthias Mller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis |
| 2004 | ESA | Solving Geometric Covering Problems by Data Reduction. | Steffen Mecke, Dorothea Wagner |
| 2004 | GD | Drawing the AS Graph in 2.5 Dimensions. | Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner |
| 2003 | ESA | Experiments on Graph Clustering Algorithms. | Ulrik Brandes, Marco Gaertler, Dorothea Wagner |
| 2003 | ESA | Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. | Dorothea Wagner, Thomas Willhalm |
| 2003 | GD | Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner |
| 2003 | WADS | Algorithms and Models for Railway Optimization. | Dorothea Wagner |
| 2003 | WG | Completely Connected Clustered Graphs. | Sabine Cornelsen, Dorothea Wagner |
| 2002 | ALENEX | Using Multi-level Graphs for Timetable Information in Railway Systems. | Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis |
| 2002 | GD | Sketch-Driven Orthogonal Graph Drawing. | Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner |
| 2002 | GD | Drawing Graphs on Two and Three Lines. | Sabine Cornelsen, Thomas Schank, Dorothea Wagner |
| 2001 | ALENEX | Travel Planning with Self-Made Maps. | Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm |
| 2001 | GD | Visone. | Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Kpf, Jrgen Lerner, Dorothea Wagner |
| 2001 | WG | Planarity of the 2-Level Cactus Model. | Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner |
| 2000 | GD | How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner |
| 2000 | GD | Fast Layout Methods for Timetable Graphs. | Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner |
| 1999 | GD | Centrality in Policy Network Drawings. | Ulrik Brandes, Patrick Kenis, Dorothea Wagner |
| 1999 | WG | On the Hardness of Recognizing Bundles in Time Table Graphs. | Annegret Liebers, Dorothea Wagner, Karsten Weihe |
| 1998 | GD | Using Graph Layout to Visualize Train Interconnection Data. | Ulrik Brandes, Dorothea Wagner |
| 1998 | ISAAC | Dynamic Grid Embedding with Few Bends and Changes. | Ulrik Brandes, Dorothea Wagner |
| 1997 | ESA | A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). | Ulrik Brandes, Dorothea Wagner |
| 1997 | GD | A Bayesian Paradigm for Dynamic Graph Layout. | Ulrik Brandes, Dorothea Wagner |
| 1996 | GD | Wiring Edge-Disjoint Layouts. | Ruth Kuchem, Dorothea Wagner |
| 1994 | VLSID | Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated. | Paul Molitor, Uwe Sparmann, Dorothea Wagner |
| 1993 | ESA | A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. | Dorothea Wagner, Karsten Weihe |
| 1993 | ISAAC | Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. | Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe |
| 1993 | MFCS | Between Min Cut and Graph Bisection. | Dorothea Wagner, Frank Wagner |
| 1993 | SODA | The Vertex-Disjoint Menger Problem in Planar Graphs. | Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe |
| 1992 | ISAAC | Wiring Knock-Knee Layouts: A Global Appoach. | Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe |
| 1992 | WG | On the Complexity of Partial Order Properties. | Stefan Felsner, Dorothea Wagner |
| 1991 | SODA | Routing through a Dense Channel with Minimum Total Wire Length. | Michael Formann, Dorothea Wagner, Frank Wagner |
| 1989 | FOCS | Area-Optimal Three-Layer Channel Routing | Ruth Kuchem, Dorothea Wagner, Frank Wagner |