Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDorothea Wagner
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
- award (2019): Konrad Zuse Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j94]Ü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:
More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. 55(12): 253:1-253:38 (2023)- 2022
- [j93]Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
An Axiomatic Approach to Time-Dependent Shortest Path Oracles. Algorithmica 84(3): 815-870 (2022) - 2021
- [j92]Ben Strasser, Dorothea Wagner, Tim Zeitz:
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. Algorithms 14(3): 90 (2021) - [j91]Dorothea Wagner:
Open and autonomous. The basis for trust in science. Inf. Serv. Use 41(1-2): 163-169 (2021) - 2020
- [j90]Moritz Baum, Julian Dibbelt, Thomas Pajor, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Energy-Optimal Routes for Battery Electric Vehicles. Algorithmica 82(5): 1490-1546 (2020) - [j89]Lars Briem, H. Sebastian Buck, Nicolai Mallig, Peter Vortisch, Ben Strasser, Dorothea Wagner, Tobias Zündorf:
Integrating public transport into mobiTopp. Future Gener. Comput. Syst. 107: 1089-1096 (2020) - [j88]Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf:
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. Transp. Sci. 54(6): 1571-1600 (2020) - 2019
- [j87]Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner:
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. Algorithms 12(9): 196 (2019) - [j86]Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner:
Fast Exact Computation of Isocontours in Road Networks. ACM J. Exp. Algorithmics 24(1): 1.18:1-1.18:26 (2019) - [j85]Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner:
Geometric Heuristics for Rectilinear Crossing Minimization. ACM J. Exp. Algorithmics 24(1): 1.12:1-1.12:21 (2019) - [j84]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 24(1): 2.4:1-2.4:28 (2019) - [j83]Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner, Tobias Zündorf:
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles. Transp. Sci. 53(6): 1627-1655 (2019) - 2018
- [j82]Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
Publisher Correction: Towards negative cycle canceling in wind farm cable layout optimization. Energy Inform. 1(1) (2018) - [j81]Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
Towards negative cycle canceling in wind farm cable layout optimization. Energy Inform. 1(S1) (2018) - [j80]Lukas Barth, Dorothea Wagner:
Exploiting flexibility in smart grids at scale. Comput. Sci. Res. Dev. 33(1-2): 185-191 (2018) - [j79]Sören Hohmann, Heiko Maaß, Carina Mieth, Martin Pfeifer, Dorothea Wagner, Franziska Wegner:
Poster abstract: graph-theoretic model for observability in multi-carrier energy distribution networks. Comput. Sci. Res. Dev. 33(1-2): 237-239 (2018) - [j78]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Connection Scan Algorithm. ACM J. Exp. Algorithmics 23 (2018) - [j77]Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. ACM J. Exp. Algorithmics 23 (2018) - 2017
- [j76]Michael Hamann, Eike Röhrs, Dorothea Wagner:
Local Community Detection Based on Small Cliques. Algorithms 10(3): 90 (2017) - 2016
- [j75]Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner:
Towards route planning algorithms for electric vehicles with realistic constraints. Comput. Sci. Res. Dev. 31(1-2): 105-109 (2016) - [j74]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. ACM J. Exp. Algorithmics 21(1): 1.5:1-1.5:49 (2016) - [j73]Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner:
Structure-preserving sparsification methods for social networks. Soc. Netw. Anal. Min. 6(1): 22:1-22:22 (2016) - [j72]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. ACM Trans. Algorithms 12(3): 33:1-33:32 (2016) - [j71]Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner:
Search-space size in contraction hierarchies. Theor. Comput. Sci. 645: 112-127 (2016) - 2015
- [j70]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online dynamic power management with hard real-time guarantees. Theor. Comput. Sci. 595: 46-64 (2015) - 2014
- [j69]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 68(4): 859-885 (2014) - [j68]Dorothea Wagner:
EATCS Fellows 2015 - Call for Nominations. Bull. EATCS 114 (2014) - [j67]Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
User-Constrained Multimodal Route Planning. ACM J. Exp. Algorithmics 19(1) (2014) - [j66]Robert Görke, Andrea Kappes, Dorothea Wagner:
Experiments on Density-Constrained Graph Clustering. ACM J. Exp. Algorithmics 19(1) (2014) - [j65]Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. J. Graph Algorithms Appl. 18(1): 35-76 (2014) - [j64]Gregor Betz, Andreas Gemsa, Christof Mathies, Ignaz Rutter, Dorothea Wagner:
Column-Based Graph Layouts. J. Graph Algorithms Appl. 18(5): 677-708 (2014) - 2013
- [j63]Peter Sanders, Dorothea Wagner:
Algorithm Engineering. Inform. Spektrum 36(2): 131 (2013) - [j62]Robert Görke, Tanja Hartmann, Andrea Kappes, Dorothea Wagner:
Identifikation von Clustern in Graphen. Inform. Spektrum 36(2): 144-152 (2013) - [j61]Peter Sanders, Dorothea Wagner:
Algorithm Engineering. Inform. Spektrum 36(2): 187-190 (2013) - [j60]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The density maximization problem in graphs. J. Comb. Optim. 26(4): 723-754 (2013) - [j59]Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, Dorothea Wagner:
Dynamic graph clustering combining modularity and smoothness. ACM J. Exp. Algorithmics 18 (2013) - [j58]Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner:
On the Complexity of Partitioning Graphs for Arc-Flags. J. Graph Algorithms Appl. 17(3): 265-299 (2013) - 2012
- [j57]Robert Görke, Tanja Hartmann, Dorothea Wagner:
Dynamic Graph Clustering Using Minimum-Cut Trees. J. Graph Algorithms Appl. 16(2): 411-446 (2012) - [j56]Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner:
The Shortcut Problem - Complexity and Algorithms. J. Graph Algorithms Appl. 16(2): 447-481 (2012) - 2011
- [j55]Peter Sanders, Dorothea Wagner:
Algorithm Engineering. it Inf. Technol. 53(6): 263-265 (2011) - [j54]Reinhard Bauer, Daniel Delling, Dorothea Wagner:
Experimental study of speed up techniques for timetable information systems. Networks 57(1): 38-52 (2011) - [j53]Robert Franke, Ignaz Rutter, Dorothea Wagner:
Computing large matchings in planar graphs with fixed minimum degree. Theor. Comput. Sci. 412(32): 4092-4099 (2011) - 2010
- [j52]Robert Görke, Anke Meyer-Bäse, Dorothea Wagner, Huan He, Mark R. Emmett, Charles A. Conrad:
Determining and interpreting correlations in lipidomic networks found in glioblastoma cells. BMC Syst. Biol. 4: 126 (2010) - [j51]Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM J. Exp. Algorithmics 15 (2010) - [j50]Robert Görke, Marco Gaertler, Florian Hübner, Dorothea Wagner:
Computational Aspects of Lucidity-Driven Graph Clustering. J. Graph Algorithms Appl. 14(2): 165-197 (2010) - 2009
- [j49]Anita Schöbel, Horst W. Hamacher, Annegret Liebers, Dorothea Wagner:
The Continuous Stop Location Problem in Public Transportation Networks. Asia Pac. J. Oper. Res. 26(1): 13-30 (2009) - [j48]Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos D. Zaroliagis:
Engineering planar separator algorithms. ACM J. Exp. Algorithmics 14 (2009) - [j47]J. Ian Munro, Dorothea Wagner:
Preface. ACM J. Exp. Algorithmics 14 (2009) - 2008
- [j46]Martin Holzer, Frank Schulz, Dorothea Wagner:
Engineering multilevel overlay graphs for shortest-path queries. ACM J. Exp. Algorithmics 13 (2008) - [j45]Michael Kaufmann, Dorothea Wagner:
Guest Editor's Foreword. J. Graph Algorithms Appl. 12(1): 3-4 (2008) - [j44]Michael Baur, Marco Gaertler, Robert Görke, Marcus Krug, Dorothea Wagner:
Augmenting k-core generation with preferential attachment. Networks Heterog. Media 3(2): 277-294 (2008) - [j43]Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner:
On Modularity Clustering. IEEE Trans. Knowl. Data Eng. 20(2): 172-188 (2008) - 2007
- [j42]Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Engineering graph clustering: Models and experimental evaluation. ACM J. Exp. Algorithmics 12: 1.1:1-1.1:26 (2007) - [j41]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Efficient models for timetable information in public transportation systems. ACM J. Exp. Algorithmics 12: 2.4:1-2.4:39 (2007) - 2006
- [j40]Sabine Cornelsen, Dorothea Wagner:
Completely connected clustered graphs. J. Discrete Algorithms 4(2): 313-323 (2006) - [j39]Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning graphs to speedup Dijkstra's algorithm. ACM J. Exp. Algorithmics 11 (2006) - 2005
- [j38]Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Combining speed-up techniques for shortest-path computations. ACM J. Exp. Algorithmics 10 (2005) - [j37]Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis:
Geometric containers for efficient shortest-path computation. ACM J. Exp. Algorithmics 10 (2005) - [j36]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles. J. Graph Algorithms Appl. 9(1): 99-115 (2005) - [j35]Thomas Schank, Dorothea Wagner:
Approximating Clustering Coefficient and Transitivity. J. Graph Algorithms Appl. 9(2): 265-275 (2005) - 2004
- [j34]Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner:
How to draw the minimum cuts of a planar graph. Comput. Geom. 29(2): 117-133 (2004) - [j33]Ulrik Brandes, Dorothea Wagner:
Netzwerkvisualisierung. it Inf. Technol. 46(3): 129-134 (2004) - [j32]Ulrik Brandes, Dorothea Wagner:
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 2(4): 381 (2004) - [j31]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Generating node coordinates for shortest-path computations in transportation networks. ACM J. Exp. Algorithmics 9 (2004) - [j30]Sabine Cornelsen, Thomas Schank, Dorothea Wagner:
Drawing Graphs on Two and Three Lines. J. Graph Algorithms Appl. 8(2): 161-177 (2004) - 2003
- [j29]Dorothea Wagner:
DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke". it Inf. Technol. 45(3): 162-169 (2003) - [j28]Ulrik Brandes, Patrick Kenis, Dorothea Wagner:
Communicating Centrality in Policy Network Drawings. IEEE Trans. Vis. Comput. Graph. 9(2): 241-253 (2003) - 2001
- [j27]Takao Nishizeki, Roberto Tamassia, Dorothea Wagner:
Guest Editors' Foreword. J. Graph Algorithms Appl. 5(5): 1 (2001) - [j26]Ulrik Brandes, Jörg Raab, Dorothea Wagner:
Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections. J. Soc. Struct. 2 (2001) - 2000
- [j25]Takao Nishizeki, Roberto Tamassia, Dorothea Wagner:
Foreword. Algorithmica 26(1): 1-2 (2000) - [j24]Ulrik Brandes, Dorothea Wagner:
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. Algorithmica 28(1): 16-36 (2000) - [j23]Annegret Liebers, Dorothea Wagner, Karsten Weihe:
On the Hardness of Recognizing Bundles in Time Table Graphs. Int. J. Found. Comput. Sci. 11(3): 467-484 (2000) - [j22]Frank Schulz, Dorothea Wagner, Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM J. Exp. Algorithmics 5: 12 (2000) - [j21]Ulrik Brandes, Dorothea Wagner:
Using Graph Layout to Visualize Train Interconnection Data. J. Graph Algorithms Appl. 4(3): 135-155 (2000) - [j20]Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm:
Dynamic WWW Structures in 3D. J. Graph Algorithms Appl. 4(3): 183-191 (2000) - [j19]Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner:
On the Complexity of Partial Order Properties. Order 17(2): 179-193 (2000) - [j18]Dorothea Wagner, Karsten Weihe:
Editorial: Discrete algorithm engineering. Softw. Pract. Exp. 30(11): 1165 (2000) - 1999
- [j17]Ruth Kuchem, Dorothea Wagner:
Wiring edge-disjoint layouts. Comput. Geom. 14(4): 255-273 (1999) - [j16]Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe:
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. Discret. Appl. Math. 92(2-3): 91-110 (1999) - 1997
- [j15]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
The Vertex-Disjoint Menger Problem in Planar Graphs. SIAM J. Comput. 26(2): 331-349 (1997) - 1996
- [j14]Ruth Kuchem, Dorothea Wagner, Frank Wagner:
Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996) - [j13]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. Int. J. Found. Comput. Sci. 7(2): 95-110 (1996) - [j12]Annegret Liebers, Dorothea Wagner, Karsten Weihe:
C++ im Nebenfachstudium: Konzepte und Erfahrungen. Inform. Spektrum 19(5): 262-265 (1996) - [j11]Andreas Schikarski, Dorothea Wagner:
Efficient Parallel Matrix Inversion on Interconnection Networks. J. Parallel Distributed Comput. 34(2): 196-201 (1996) - 1995
- [j10]Dorothea Wagner, Karsten Weihe:
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. Comb. 15(1): 135-150 (1995) - 1994
- [j9]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe:
Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994) - 1993
- [j8]Dorothea Wagner:
Optimal routing through dense chanels. Int. J. Comput. Geom. Appl. 3(3): 269-289 (1993) - [j7]Edmund Ihler, Dorothea Wagner, Frank Wagner:
Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993) - [j6]Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993) - 1992
- [j5]Dorothea Wagner, Frank Wagner:
An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discret. Appl. Math. 40(1): 73-81 (1992) - [j4]Dorothea Wagner:
Book review. ZOR Methods Model. Oper. Res. 36(1): 106-109 (1992) - 1991
- [j3]Rudolf Müller, Dorothea Wagner:
α-Vertex separator is NP-hard even for 3-regular graphs. Computing 46(4): 343-353 (1991) - [j2]Dorothea Wagner, Frank Wagner:
A generalization of the zero-one principle for sorting algorithms. Discret. Appl. Math. 30(2-3): 265-273 (1991) - 1990
- [j1]Dorothea Wagner:
Decomposition of k-ary relations. Discret. Math. 81(3): 303-322 (1990)
Conference and Workshop Papers
- 2021
- [c182]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Fast, Exact and Scalable Dynamic Ridesharing. ALENEX 2021: 98-112 - [c181]Dorothea Wagner, Matthias Wolf:
The Complexity of Flow Expansion and Electrical Flow Expansion. SOFSEM 2021: 431-441 - [c180]Valentin Buchhold, Dorothea Wagner:
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. SEA 2021: 18:1-18:18 - 2020
- [c179]Lukas Barth, Dorothea Wagner:
Engineering Top-Down Weight-Balanced Trees. ALENEX 2020: 161-174 - [c178]Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
An Efficient Solution for One-To-Many Multi-Modal Journey Planning. ATMOS 2020: 1:1-1:15 - [c177]Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Integrating ULTRA and Trip-Based Routing. ATMOS 2020: 4:1-4:15 - [c176]Valentin Buchhold, Dorothea Wagner, Tim Zeitz, Michael Zündorf:
Customizable Contraction Hierarchies with Turn Costs. ATMOS 2020: 9:1-9:15 - [c175]Dorothea Wagner, Matthias Wolf:
Preventing Critical Edges when Designing Transmission Networks. e-Energy 2020: 264-278 - [c174]Sascha Gritzbach, Dorothea Wagner, Matthias Wolf:
Negative Cycle Canceling with Neighborhood Heuristics for the Wind Farm Cabling Problem. e-Energy 2020: 299-307 - [c173]Ben Strasser, Dorothea Wagner, Tim Zeitz:
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks. ESA 2020: 81:1-81:14 - [c172]Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. SEA 2020: 10:1-10:14 - [c171]Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. SEA 2020: 11:1-11:15 - [c170]Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Faster Multi-Modal Route Planning With Bike Sharing Using ULTRA. SEA 2020: 16:1-16:14 - [c169]Lukas Barth, Dorothea Wagner:
Zipping Segment Trees. SEA 2020: 25:1-25:13 - 2019
- [c168]Lukas Barth, Dorothea Wagner:
Shaving Peaks by Augmenting the Dependency Graph. e-Energy 2019: 181-191 - [c167]Nicole Ludwig, Lukas Barth, Dorothea Wagner, Veit Hagenmeyer:
Industrial Demand-Side Flexibility: A Benchmark Data Set. e-Energy 2019: 460-473 - [c166]Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution. ESA 2019: 14:1-14:16 - [c165]Lars Gottesbüren, Michael Hamann, Dorothea Wagner:
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. ESA 2019: 52:1-52:17 - [c164]Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
Engineering Negative Cycle Canceling for Wind Farm Cabling. ESA 2019: 55:1-55:16 - [c163]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort. SIGSPATIAL/GIS 2019: 379-388 - [c162]Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA. SIGSPATIAL/GIS 2019: 524-527 - 2018
- [c161]Marcel Radermacher, Klara Reichard, Ignaz Rutter, Dorothea Wagner:
A Geometric Heuristic for Rectilinear Crossing Minimization. ALENEX 2018: 129-138 - [c160]Anne Koziolek, Peter Sanders, Dorothea Wagner:
An equal opportunity concept for the coordinated research effort AESC. ECSA (Companion) 2018: 16:1-16:4 - [c159]Lukas Barth, Veit Hagenmeyer, Nicole Ludwig, Dorothea Wagner:
How much demand side flexibility do we need?: Analyzing where to exploit flexibility in industrial processes. e-Energy 2018: 43-62 - [c158]Alban Grastien, Ignaz Rutter, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
The Maximum Transmission Switching Flow Problem. e-Energy 2018: 340-360 - [c157]Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. ESA 2018: 11:1-11:15 - [c156]Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz:
Distributed Graph Clustering Using Modularity and Map Equation. Euro-Par 2018: 688-702 - [c155]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies. SEA 2018: 27:1-27:15 - 2017
- [c154]Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner:
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. ALENEX 2017: 58-72 - [c153]Lars Briem, H. Sebastian Buck, Nicolai Mallig, Peter Vortisch, Ben Strasser, Dorothea Wagner, Tobias Zündorf:
Integrating public transport into mobiTopp. ANT/SEIT 2017: 855-860 - [c152]Spyros C. Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Improved Oracles for Time-Dependent Road Networks. ATMOS 2017: 4:1-4:17 - [c151]Dorothea Wagner, Tobias Zündorf:
Public Transit Routing with Unrestricted Walking. ATMOS 2017: 7:1-7:14 - [c150]Sebastian Lehmann, Ignaz Rutter, Dorothea Wagner, Franziska Wegner:
A Simulated-Annealing-Based Approach for Wind Farm Cabling. e-Energy 2017: 203-215 - [c149]Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf:
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. ESA 2017: 11:1-11:16 - [c148]Alexander Kleff, Christian Bräuer, Frank Schulz, Valentin Buchhold, Moritz Baum, Dorothea Wagner:
Time-Dependent Route Planning for Truck Drivers. ICCL 2017: 110-126 - [c147]Neha Sengupta, Michael Hamann, Dorothea Wagner:
Benchmark Generator for Dynamic Overlapping Communities in Networks. ICDM 2017: 415-424 - [c146]Julian Dibbelt, Dionisis D. Kehagias, Grammati E. Pantziou, Damianos Gavalas, Charalampos Konstantopoulos, Dorothea Wagner, Kalliopi Giannakopoulou, Spyros C. Kontogiannis, Christos D. Zaroliagis:
Eco-aware vehicle routing in urban environments. ISCC 2017: 208-213 - [c145]Julian Dibbelt, Charalampos Konstantopoulos, Dorothea Wagner, Damianos Gavalas, Spyros C. Kontogiannis, Christos D. Zaroliagis, Vlasios Kasapakis, Grammati E. Pantziou:
Multimodal route and tour planning in urban environments. ISCC 2017: 214-219 - [c144]Moritz Baum, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Consumption Profiles in Route Planning for Electric Vehicles: Theory and Applications. SEA 2017: 19:1-19:18 - [c143]Lars Briem, H. Sebastian Buck, Holger Ebhart, Nicolai Mallig, Ben Strasser, Peter Vortisch, Dorothea Wagner, Tobias Zündorf:
Efficient Traffic Assignment for Public Transit Networks. SEA 2017: 20:1-20:14 - 2016
- [c142]Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Engineering Oracles for Time-Dependent Road Networks. ALENEX 2016: 1-14 - [c141]Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
Hierarchical Time-Dependent Oracles. ISAAC 2016: 47:1-47:13 - [c140]Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner:
Fast Exact Computation of Isochrones in Road Networks. SEA 2016: 17-32 - [c139]Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. SEA 2016: 33-49 - 2015
- [c138]Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles. ALENEX 2015: 147-158 - [c137]Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, Dorothea Wagner:
Structure-Preserving Sparsification of Social Networks. ASONAM 2015: 448-454 - [c136]Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner:
Towards Realistic Pedestrian Route Planning. ATMOS 2015: 1-15 - [c135]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. e-Energy 2015: 289-294 - [c134]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner:
Towards Realistic Flow Control in Power Grid Operation. D-A-CH EI 2015: 192-199 - [c133]Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. ESA 2015: 251-262 - [c132]Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner, Tobias Zündorf:
Shortest feasible paths with charging stops for battery electric vehicles. SIGSPATIAL/GIS 2015: 44:1-44:10 - [c131]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Fast exact shortest path and distance queries on road networks with parametrized costs. SIGSPATIAL/GIS 2015: 66:1-66:4 - [c130]Patricia Iglesias Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, Tanja Hartmann, Dorothea Wagner:
Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs. SDM 2015: 100-108 - 2014
- [c129]Ben Strasser, Dorothea Wagner:
Connection Scan Accelerated. ALENEX 2014: 125-137 - [c128]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Delay-Robust Journeys in Timetable Networks with Minimum Expected Arrival Time. ATMOS 2014: 1-14 - [c127]Moritz Baum, Julian Dibbelt, Lorenz Hübschle-Schneider, Thomas Pajor, Dorothea Wagner:
Speed-Consumption Tradeoff for Electric Vehicle Route Planning. ATMOS 2014: 138-151 - [c126]Fabian Fuchs, Dorothea Wagner:
Local Broadcasting with Arbitrary Transmission Power in the SINR Model. SIROCCO 2014: 180-193 - [c125]Tobias Fleck, Andrea Kappes, Dorothea Wagner:
Graph Clustering with Surprise: Complexity and Exact Solutions. SOFSEM 2014: 223-234 - [c124]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Dynamic Power Management with Hard Real-Time Guarantees. STACS 2014: 226-238 - [c123]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. SEA 2014: 271-282 - [c122]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Erratum: Customizable Contraction Hierarchies. SEA 2014 - 2013
- [c121]Fabian Fuchs, Dorothea Wagner:
On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model. ALGOSENSORS 2013: 170-184 - [c120]Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Energy-optimal routes for electric vehicles. SIGSPATIAL/GIS 2013: 54-63 - [c119]Liang Zhao, Hiroshi Kadowaki, Dorothea Wagner:
A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs. ICA3PP (2) 2013: 157-164 - [c118]Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner:
Search-Space Size in Contraction Hierarchies. ICALP (1) 2013: 93-104 - [c117]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. ICALP (1) 2013: 184-195 - [c116]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Hierarchies of Predominantly Connected Communities. WADS 2013: 365-377 - [c115]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Intriguingly Simple and Fast Transit Routing. SEA 2013: 43-54 - [c114]Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck:
Computing Multimodal Journeys in Practice. SEA 2013: 260-271 - [c113]Andreas Gemsa, Thomas Pajor, Dorothea Wagner, Tobias Zündorf:
Efficient Computation of Jogging Routes. SEA 2013: 272-283 - 2012
- [c112]Robert Görke, Andrea Schumm, Dorothea Wagner:
Experiments on Density-Constrained Graph Clustering. ALENEX 2012: 1-15 - [c111]Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
User-Constrained Multi-Modal Route Planning. ALENEX 2012: 118-129 - [c110]Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner:
Static and Dynamic Aspects of Scientific Collaboration Networks. ASONAM 2012: 522-526 - [c109]Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner:
On the Complexity of Partitioning Graphs for Arc-Flags. ATMOS 2012: 71-82 - [c108]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Complete hierarchical cut-clustering: A case study on expansion and modularity. Graph Partitioning and Graph Clustering 2012: 157-170 - [c107]Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner:
Column-Based Graph Layouts. GD 2012: 236-247 - [c106]Markus Völker, Dorothea Wagner, Johannes Schmid, Tobias Gädeke, Klaus D. Müller-Glaser:
Force-directed tracking in wireless networks using signal strength and step recognition. ICL-GNSS 2012: 1-8 - [c105]Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner:
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. ISAAC 2012: 75-84 - [c104]Tanja Hartmann, Dorothea Wagner:
Fast and Simple Fully-Dynamic Cut Tree Construction. ISAAC 2012: 95-105 - [c103]Fabian Fuchs, Markus Völker, Dorothea Wagner:
Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks. MedAlg 2012: 188-202 - [c102]Robert Görke, Roland Kluge, Andrea Schumm, Christian Staudt, Dorothea Wagner:
An Efficient Generator for Clustered Dynamic Random Networks. MedAlg 2012: 219-233 - [c101]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner:
Higher Order City Voronoi Diagrams. SWAT 2012: 59-70 - 2011
- [c100]Sascha Meinert, Dorothea Wagner:
An Experimental Study on Generating Planar Graphs. FAW-AAIM 2011: 375-387 - [c99]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost. CCCG 2011 - [c98]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
The Density Maximization Problem in Graphs. COCOON 2011: 25-36 - [c97]Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Generalizing Geometric Graphs. GD 2011: 179-190 - [c96]Dorothea Wagner:
Algorithm Engineering for Route Planning - An Update -. ISAAC 2011: 1-5 - [c95]Christof Doll, Tanja Hartmann, Dorothea Wagner:
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. WADS 2011: 338-349 - [c94]Robert Görke, Andrea Schumm, Dorothea Wagner:
Density-Constrained Graph Clustering. WADS 2011: 679-690 - [c93]Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner:
Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. SEA 2011: 292-303 - [c92]Dennis Schieferdecker, Markus Völker, Dorothea Wagner:
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. SEA 2011: 388-399 - [c91]Sascha Meinert, Dorothea Wagner:
Generating Time Dependencies in Road Networks. SEA 2011: 434-446 - 2010
- [c90]Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner:
Synthetic Road Networks. AAIM 2010: 46-57 - [c89]Reinhard Bauer, Marcus Krug, Dorothea Wagner:
Enumerating and Generating Labeled k-degenerate Graphs. ANALCO 2010: 90-98 - [c88]Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner:
Preprocessing Speed-Up Techniques Is Hard. CIAC 2010: 359-370 - [c87]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
Orthogonal Graph Drawing with Flexibility Constraints. GD 2010: 92-104 - [c86]Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner:
Space-Efficient SHARC-Routing. SEA 2010: 47-58 - [c85]Robert Görke, Pascal Maillard, Christian Staudt, Dorothea Wagner:
Modularity-Driven Clustering of Dynamic Graphs. SEA 2010: 436-448 - [c84]Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner:
Gateway Decompositions for Constrained Reachability Problems. SEA 2010: 449-461 - [c83]Bastian Katz, Markus Völker, Dorothea Wagner:
Energy efficient scheduling with power control for wireless networks. WiOpt 2010: 160-169 - 2009
- [c82]Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner:
Orca Reduction and ContrAction Graph Clustering. AAIM 2009: 152-165 - [c81]Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis:
Efficient Route Planning in Flight Networks. ATMOS 2009 - [c80]Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner:
Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139 - [c79]Michael Baur, Ulrik Brandes, Jürgen Lerner, Dorothea Wagner:
Group-Level Analysis and Visualization of Social Networks. Algorithmics of Large and Complex Networks 2009: 330-358 - [c78]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Accelerating Multi-modal Route Planning by Access-Nodes. ESA 2009: 587-598 - [c77]Robert Franke, Ignaz Rutter, Dorothea Wagner:
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. ISAAC 2009: 872-881 - [c76]Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner:
The Shortcut Problem - Complexity and Approximation. SOFSEM 2009: 105-116 - [c75]Robert Görke, Tanja Hartmann, Dorothea Wagner:
Dynamic Graph Clustering Using Minimum-Cut Trees. WADS 2009: 339-350 - [c74]Reinhard Bauer, Dorothea Wagner:
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. SEA 2009: 51-62 - [c73]Daniel Delling, Dorothea Wagner:
Pareto Paths with SHARC. SEA 2009: 125-136 - 2008
- [c72]Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner:
Engineering Label-Constrained Shortest-Path Algorithms. AAIM 2008: 27-37 - [c71]Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner:
Engineering Comparators for Graph Clusterings. AAIM 2008: 131-142 - [c70]Bastian Katz, Steffen Mecke, Dorothea Wagner:
Efficient Scheduling of Data-Harvesting Trees. ALGOSENSORS 2008: 43-56 - [c69]Bastian Katz, Markus Völker, Dorothea Wagner:
Link Scheduling in Local Interference Models. ALGOSENSORS 2008: 57-71 - [c68]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Engineering Time-Expanded Graphs for Faster Timetable Information. ATMOS 2008 - [c67]Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner:
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. WEA 2008: 303-318 - 2007
- [c66]Marco Gaertler, Robert Görke, Dorothea Wagner:
Significance-Driven Graph Clustering. AAIM 2007: 11-26 - [c65]Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner:
Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX 2007 - [c64]Reinhard Bauer, Daniel Delling, Dorothea Wagner:
Experimental Study on Speed-Up Techniques for Timetable Information Systems. ATMOS 2007 - [c63]Marcus Krug, Dorothea Wagner:
Minimizing the Area for Planar Straight-Line Grid Drawings. GD 2007: 207-212 - [c62]Robert Görke, Marco Gaertler, Dorothea Wagner:
LunarVis - Analytic Visualizations of Large Graphs. GD 2007: 352-364 - [c61]Bastian Katz, Marco Gaertler, Dorothea Wagner:
Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. SOFSEM (1) 2007: 330-341 - [c60]Markus Maier, Steffen Mecke, Dorothea Wagner:
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. SOFSEM (1) 2007: 410-421 - [c59]Dorothea Wagner, Thomas Willhalm:
Speed-Up Techniques for Shortest-Path Computations. STACS 2007: 23-36 - [c58]Daniel Delling, Dorothea Wagner:
Landmark-Based Routing in Dynamic Graphs. WEA 2007: 52-65 - [c57]Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner:
On Finding Graph Clusterings with Maximum Modularity. WG 2007: 121-132 - 2006
- [c56]Martin Holzer, Frank Schulz, Dorothea Wagner:
Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ALENEX 2006: 156-170 - [c55]Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner:
High-Performance Multi-Level Routing. The Shortest Path Problem 2006: 73-91 - [c54]Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner:
Highway Hierarchies Star. The Shortest Path Problem 2006: 141-174 - [c53]Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner:
Engineering Label-Constrained Shortest-Path Algorithms. The Shortest Path Problem 2006: 309-319 - 2005
- [c52]Dorothea Wagner, Thomas Willhalm:
Drawing Graphs to Speed Up Shortest-Path Computations. ALENEX/ANALCO 2005: 17-25 - [c51]Steffen Mecke, Anita Schöbel, Dorothea Wagner:
Station Location - Complexity and Approximation. ATMOS 2005 - [c50]Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Engineering Planar Separator Algorithms. ESA 2005: 628-639 - [c49]Marco Gaertler, Dorothea Wagner:
A Hybrid Model for Drawing Dynamic and Evolving Graphs. GD 2005: 189-200 - [c48]Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner:
Graph-Drawing Contest Report. GD 2005: 528-531 - [c47]Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning Graphs to Speed Up Dijkstra's Algorithm. WEA 2005: 189-202 - [c46]Thomas Schank, Dorothea Wagner:
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. WEA 2005: 606-609 - 2004
- [c45]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Experimental Comparison of Shortest Path Approaches for Timetable Information. ALENEX/ANALC 2004: 88-99 - [c44]Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Timetable Information: Models and Algorithms. ATMOS 2004: 67-90 - [c43]Steffen Mecke, Dorothea Wagner:
Solving Geometric Covering Problems by Data Reduction. ESA 2004: 760-771 - [c42]Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Drawing the AS Graph in 2.5 Dimensions. GD 2004: 43-48 - 2003
- [c41]Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Experiments on Graph Clustering Algorithms. ESA 2003: 568-579 - [c40]Dorothea Wagner, Thomas Willhalm:
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. ESA 2003: 776-787 - [c39]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. GD 2003: 357-368 - [c38]Dorothea Wagner:
Algorithms and Models for Railway Optimization. WADS 2003: 198-206 - [c37]Dorothea Wagner:
Analysis and Visualization of Social Networks. WEA 2003: 261-266 - [c36]Sabine Cornelsen, Dorothea Wagner:
Completely Connected Clustered Graphs. WG 2003: 168-179 - [c35]Maria Flavia Mammana, Steffen Mecke, Dorothea Wagner:
The Station Location Problem on Two Intersecting Lines. ATMOS 2003: 52-64 - [c34]Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis:
Dynamic Shortest Paths Containers. ATMOS 2003: 65-84 - [c33]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. ATMOS 2003: 85-103 - 2002
- [c32]Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Using Multi-level Graphs for Timetable Information in Railway Systems. ALENEX 2002: 43-59 - [c31]Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner:
Sketch-Driven Orthogonal Graph Drawing. GD 2002: 1-11 - [c30]Sabine Cornelsen, Thomas Schank, Dorothea Wagner:
Drawing Graphs on Two and Three Lines. GD 2002: 31-41 - [c29]Dorothea Wagner:
Preface. ATMOS 2002: 66-67 - 2001
- [c28]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Travel Planning with Self-Made Maps. ALENEX 2001: 132-144 - [c27]Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner:
Visone. GD 2001: 463-464 - [c26]Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner:
Planarity of the 2-Level Cactus Model. WG 2001: 91-102 - [c25]Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner:
Locating New Stops in a Railway Network. ATMOS 2001: 13-23 - 2000
- [c24]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). GD 2000: 103-114 - [c23]Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner:
Fast Layout Methods for Timetable Graphs. GD 2000: 127-138 - [c22]Ulrik Brandes, Dorothea Wagner:
Contextual Visualization of Actor Status in Social Networks. VisSym 2000: 13-22 - 1999
- [c21]Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm:
Empirical Design of Geometric Algorithms. SCG 1999: 86-94 - [c20]Ulrik Brandes, Patrick Kenis, Dorothea Wagner:
Centrality in Policy Network Drawings. GD 1999: 250-258 - [c19]Frank Schulz, Dorothea Wagner, Karsten Weihe:
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. WAE 1999: 110-123 - [c18]Annegret Liebers, Dorothea Wagner, Karsten Weihe:
On the Hardness of Recognizing Bundles in Time Table Graphs. WG 1999: 325-337 - 1998
- [c17]Ulrik Brandes, Dorothea Wagner:
Using Graph Layout to Visualize Train Interconnection Data. GD 1998: 44-56 - [c16]Ulrik Brandes, Dorothea Wagner:
Dynamic Grid Embedding with Few Bends and Changes. ISAAC 1998: 89-98 - 1997
- [c15]Ulrik Brandes, Dorothea Wagner:
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). ESA 1997: 64-77 - [c14]Ulrik Brandes, Dorothea Wagner:
A Bayesian Paradigm for Dynamic Graph Layout. GD 1997: 236-247 - 1996
- [c13]Ruth Kuchem, Dorothea Wagner:
Wiring Edge-Disjoint Layouts. GD 1996: 271-285 - 1995
- [c12]Dorothea Wagner, Karsten Weihe:
An Animated Library of Combinatorial VLSI-Routing Algorithms. SCG 1995: C28-C29 - 1994
- [c11]Paul Molitor, Uwe Sparmann, Dorothea Wagner:
Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated. VLSI Design 1994: 149-154 - 1993
- [c10]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
Efficient algorithms for disjoint paths in planar graphs. Combinatorial Optimization 1993: 295-354 - [c9]Dorothea Wagner, Karsten Weihe:
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. ESA 1993: 384-395 - [c8]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. ISAAC 1993: 343-352 - [c7]Dorothea Wagner, Frank Wagner:
Between Min Cut and Graph Bisection. MFCS 1993: 744-750 - [c6]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe:
The Vertex-Disjoint Menger Problem in Planar Graphs. SODA 1993: 112-119 - 1992
- [c5]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe:
Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399 - [c4]Stefan Felsner, Dorothea Wagner:
On the Complexity of Partial Order Properties. WG 1992: 225-235 - 1991
- [c3]Dorothea Wagner:
A New Approach to Knock-Knee Channel Routing. ISA 1991: 83-93 - [c2]Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length. SODA 1991: 475-482 - 1989
- [c1]Ruth Kuchem, Dorothea Wagner, Frank Wagner:
Area-Optimal Three-Layer Channel Routing. FOCS 1989: 506-511
Parts in Books or Collections
- 2022
- [p10]Ulrik Brandes, Michael Hamann, Luise Häuser, Dorothea Wagner:
Skeleton-Based Clustering by Quasi-Threshold Editing. Algorithms for Big Data 2022: 134-151 - 2016
- [p9]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - [p8]Tanja Hartmann, Andrea Kappes, Dorothea Wagner:
Clustering Evolving Networks. Algorithm Engineering 2016: 280-329 - 2015
- [p7]Ben Strasser, Dorothea Wagner:
Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction Hierarchies. Gems of Combinatorial Optimization and Graph Algorithms 2015: 69-82 - 2011
- [p6]Robert Görke, Steffen Mecke, Dorothea Wagner:
Maximum Flows - Towards the Stadium During Rush Hour. Algorithms Unplugged 2011: 333-344 - 2009
- [p5]Daniel Delling, Thomas Pajor, Dorothea Wagner:
Engineering Time-Expanded Graphs for Faster Timetable Information. Robust and Online Large-Scale Optimization 2009: 182-206 - [p4]Daniel Delling, Dorothea Wagner:
Time-Dependent Route Planning. Robust and Online Large-Scale Optimization 2009: 207-230 - 2008
- [p3]Dorothea Wagner, Robert Görke, Steffen Mecke:
Maximale Flüsse - Die ganze Stadt will zum Stadion. Taschenbuch der Algorithmen 2008: 361-372 - 2004
- [p2]Ulrik Brandes, Dorothea Wagner:
Analysis and Visualization of Social Networks. Graph Drawing Software 2004: 321-340 - 1999
- [p1]Ulrik Brandes, Dorothea Wagner:
Über das Zeichnen von Graphen. Angewandte Mathematik, insbesondere Informatik 1999: 58-81
Editorship
- 2015
- [e31]Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner:
Gems of Combinatorial Optimization and Graph Algorithms. Springer 2015, ISBN 978-3-319-24970-4 [contents] - 2014
- [e30]Andreas S. Schulz, Dorothea Wagner:
Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. Lecture Notes in Computer Science 8737, Springer 2014, ISBN 978-3-662-44776-5 [contents] - 2013
- [e29]David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner:
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings. Contemporary Mathematics 588, American Mathematical Society 2013, ISBN 978-0-8218-9038-7 [contents] - 2012
- [e28]Abraham Bernstein, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2011. LNI D-12, GI 2012, ISBN 978-3-88579-416-5 [contents] - 2011
- [e27]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3 [contents] - [e26]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:
Ausgezeichnete Informatikdissertationen 2010. LNI D-11, GI 2011, ISBN 978-3-88579-415-8 [contents] - 2010
- [e25]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:
Ausgezeichnete Informatikdissertationen 2009. LNI D-10, GI 2010, ISBN 978-3-88579-414-1 [contents] - [e24]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:
Ausgezeichnete Informatikdissertationen 2008. LNI D-9, GI 2010, ISBN 978-3-88579-413-4 [contents] - 2009
- [e23]Jürgen Lerner, Dorothea Wagner, Katharina Anna Zweig:
Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126]. Lecture Notes in Computer Science 5515, Springer 2009, ISBN 978-3-642-02093-3 [contents] - 2008
- [e22]J. Ian Munro, Dorothea Wagner:
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008. SIAM 2008, ISBN 978-1-61197-288-7 [contents] - [e21]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:
Ausgezeichnete Informatikdissertationen 2007. LNI D-8, GI 2008, ISBN 978-3-88579-412-7 [contents] - [e20]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2 [contents] - 2007
- [e19]Frank Geraets, Leo G. Kroon, Anita Schöbel, Dorothea Wagner, Christos D. Zaroliagis:
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. Lecture Notes in Computer Science 4359, Springer 2007, ISBN 978-3-540-74245-6 [contents] - [e18]Dorothea Wagner, Roger Wattenhofer:
Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures [result from a Dagstuhl seminar]. Lecture Notes in Computer Science 4621, Springer 2007, ISBN 978-3-540-74990-5 [contents] - [e17]Michael Kaufmann, Dorothea Wagner:
Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers. Lecture Notes in Computer Science 4372, Springer 2007, ISBN 978-3-540-70903-9 [contents] - 2006
- [e16]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005. Dagstuhl Seminar Proceedings 05361, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e15]Lars Arge, Robert Sedgewick, Dorothea Wagner:
Data Structures, 26.02. - 03.03.2006. Dagstuhl Seminar Proceedings 06091, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e14]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:
Ausgezeichnete Informatikdissertationen 2005. LNI D-6, GI 2006, ISBN 978-3-88579-410-3 [contents] - [e13]Dorothea Wagner, et al.:
Ausgezeichnete Informatikdissertationen 2006. LNI D-7, GI 2006, ISBN 978-3-88579-411-0 [contents] - 2005
- [e12]Susanne Albers, Robert Sedgewick, Dorothea Wagner:
Data Structures, 22.-27. February 2004. Dagstuhl Seminar Proceedings 04091, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 [contents] - [e11]Thomas Dreier, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Rüdiger Reischuk, Dietmar Saupe, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2004. LNI D-5, GI 2005, ISBN 3-88579-409-8 [contents] - 2004
- [e10]Leo G. Kroon, Frank Geraets, Dorothea Wagner, Christos D. Zaroliagis:
Algorithmic Methods for Railway Optimization, 20.06. - 25.06.2004. Dagstuhl Seminar Proceedings 04261, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents] - [e9]Heinz Beilner, Thomas Dreier, Markus Gross, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2003. LNI D-4, GI 2004, ISBN 3-88579-408-X [contents] - 2002
- [e8]Dorothea Wagner:
Algorithmic Methods and Models for Optimization of Railways, ATMOS 2002, ICALP 2002 Satellite Workshop, Malaga, Spain, July 13, 2002. Electronic Notes in Theoretical Computer Science 66(6), Elsevier 2002 [contents] - [e7]Heinz Beilner, Herbert Fiedler, Markus Gross, Oliver Günther, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2002. LNI D-3, GI 2002, ISBN 3-88579-407-1 [contents] - 2001
- [e6]Michael Kaufmann, Dorothea Wagner:
Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999). Lecture Notes in Computer Science 2025, Springer 2001, ISBN 3-540-42062-2 [contents] - [e5]Heinz Beilner, Herbert Fiedler, Oliver Günther, Steffen Hölldobler, Günter Hotz, Peter Liggesmeyer, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2001. LNI D-2, GI 2001, ISBN 3-88579-406-3 [contents] - [e4]Stefan Näher, Dorothea Wagner:
Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1982, Springer 2001, ISBN 3-540-42512-8 [contents] - 2000
- [e3]Herbert Fiedler, Oliver Günther, Werner Grass, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 1999. Teubner 2000, ISBN 978-3-519-02650-1 [contents] - [e2]Herbert Fiedler, Werner Grass, Oliver Günther, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2000. LNI D-1, GI 2000, ISBN 3-88579-405-5 [contents] - [e1]Ulrik Brandes, Dorothea Wagner:
Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings. Lecture Notes in Computer Science 1928, Springer 2000, ISBN 3-540-41183-6 [contents]
Reference Works
- 2018
- [r3]David A. Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, Dorothea Wagner:
Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - 2014
- [r2]David A. Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, Dorothea Wagner:
Benchmarking for Graph Clustering and Partitioning. Encyclopedia of Social Network Analysis and Mining 2014: 73-82 - 2013
- [r1]Ulrik Brandes, Linton C. Freeman, Dorothea Wagner:
Social Networks. Handbook of Graph Drawing and Visualization 2013: 805-839
Informal and Other Publications
- 2022
- [i53]Ü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:
More Recent Advances in (Hyper)Graph Partitioning. CoRR abs/2205.13202 (2022) - 2021
- [i52]Valentin Buchhold, Dorothea Wagner:
Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications. CoRR abs/2103.10359 (2021) - 2020
- [i51]Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. CoRR abs/2003.12110 (2020) - [i50]Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. CoRR abs/2003.14317 (2020) - [i49]Lukas Barth, Dorothea Wagner:
Zipping Segment Trees. CoRR abs/2004.03206 (2020) - [i48]Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Fast, Exact and Scalable Dynamic Ridesharing. CoRR abs/2011.02601 (2020) - [i47]Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zündorf:
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. CoRR abs/2011.10400 (2020) - 2019
- [i46]Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution. CoRR abs/1906.04832 (2019) - [i45]Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner:
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. CoRR abs/1906.11811 (2019) - [i44]Lars Gottesbüren, Michael Hamann, Dorothea Wagner:
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. CoRR abs/1907.02053 (2019) - [i43]Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner, Matthias Wolf:
Engineering Negative Cycle Canceling for Wind Farm Cabling. CoRR abs/1908.02129 (2019) - [i42]Jonas Sauer, Dorothea Wagner, Tobias Zündorf:
Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA. CoRR abs/1909.08519 (2019) - [i41]Lukas Barth, Dorothea Wagner:
Engineering Top-Down Weight-Balanced Trees. CoRR abs/1910.07849 (2019) - [i40]Moritz Baum, Julian Dibbelt, Andreas Gemsa, Dorothea Wagner, Tobias Zündorf:
Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles. CoRR abs/1910.09812 (2019) - [i39]Ben Strasser, Dorothea Wagner, Tim Zeitz:
Space-efficient, Fast and Exact Routing in Time-dependent Road Networks. CoRR abs/1910.12726 (2019) - 2018
- [i38]Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. CoRR abs/1804.08487 (2018) - 2017
- [i37]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner:
Connection Scan Algorithm. CoRR abs/1703.05997 (2017) - [i36]Spyros C. Kontogiannis, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Improved Oracles for Time-Dependent Road Networks. CoRR abs/1704.08445 (2017) - [i35]Michael Hamann, Ben Strasser, Dorothea Wagner, Tim Zeitz:
Simple Distributed Graph Clustering using Modularity and Map Equation. CoRR abs/1710.09605 (2017) - 2016
- [i34]Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner:
Structure-Preserving Sparsification Methods for Social Networks. CoRR abs/1601.00286 (2016) - [i33]Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner:
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. CoRR abs/1604.08738 (2016) - [i32]Leo G. Kroon, Anita Schöbel, Dorothea Wagner:
Algorithmic Methods for Optimization in Public Transport (Dagstuhl Seminar 16171). Dagstuhl Reports 6(4): 139-160 (2016) - 2015
- [i31]Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis:
Hierarchical Oracles for Time-Dependent Networks. CoRR abs/1502.05222 (2015) - [i30]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - [i29]Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. CoRR abs/1504.07379 (2015) - [i28]Gerd Lindner, Christian L. Staudt, Michael Hamann, Henning Meyerhenke, Dorothea Wagner:
Structure-Preserving Sparsification of Social Networks. CoRR abs/1505.00564 (2015) - [i27]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. CoRR abs/1505.05747 (2015) - [i26]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs. CoRR abs/1509.03165 (2015) - [i25]Spyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis:
Engineering Oracles for Time-Dependent Road Networks. CoRR abs/1511.08303 (2015) - [i24]Moritz Baum, Valentin Buchhold, Julian Dibbelt, Dorothea Wagner:
Fast Computation of Isochrones in Road Networks. CoRR abs/1512.09090 (2015) - [i23]Moritz Baum, Julian Dibbelt, Thomas Pajor, Dorothea Wagner:
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. CoRR abs/1512.09132 (2015) - 2014
- [i22]Tanja Hartmann, Andrea Kappes, Dorothea Wagner:
Clustering Evolving Networks. CoRR abs/1401.3516 (2014) - [i21]Julian Dibbelt, Ben Strasser, Dorothea Wagner:
Customizable Contraction Hierarchies. CoRR abs/1402.0402 (2014) - [i20]Fabian Fuchs, Dorothea Wagner:
Arbitrary Transmission Power in the SINR Model: Local Broadcasting, Coloring and MIS. CoRR abs/1402.4994 (2014) - 2013
- [i19]Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner:
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch. CoRR abs/1301.3252 (2013) - [i18]Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Power-Managing Strategy with Hard Real-Time Guarantees. CoRR abs/1304.1590 (2013) - [i17]Michael Hamann, Tanja Hartmann, Dorothea Wagner:
Hierarchies of Predominantly Connected Communities. CoRR abs/1305.0757 (2013) - [i16]Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner:
Static and Dynamic Aspects of Scientific Collaboration Networks. CoRR abs/1306.5268 (2013) - [i15]Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner:
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. CoRR abs/1309.5697 (2013) - [i14]Tanja Hartmann, Dorothea Wagner:
Dynamic Gomory-Hu Tree Construction - fast and simple. CoRR abs/1310.0178 (2013) - [i13]Tobias Fleck, Andrea Kappes, Dorothea Wagner:
Graph Clustering with Surprise: Complexity and Exact Solutions. CoRR abs/1310.6019 (2013) - [i12]Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner:
Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3(9): 169-189 (2013) - 2012
- [i11]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner:
Higher Order City Voronoi Diagrams. CoRR abs/1204.4374 (2012) - [i10]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner:
Optimal Orthogonal Graph Drawing with Convex Bend Costs. CoRR abs/1204.4997 (2012) - 2011
- [i9]Dennis Schieferdecker, Markus Völker, Dorothea Wagner:
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. CoRR abs/1103.1771 (2011) - [i8]Robert Görke, Andrea Schumm, Dorothea Wagner:
Experiments on Density-Constrained Graph Clustering. CoRR abs/1112.2143 (2011) - 2008
- [i7]Stephen P. Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen G. Kobourov, Anna Lubiw, Dorothea Wagner:
08191 Working Group Report - Visualization of Trajectories. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2006
- [i6]Lars Arge, Robert Sedgewick, Dorothea Wagner:
06091 Executive Summary -- Data Structures. Data Structures 2006 - [i5]Lars Arge, Robert Sedgewick, Dorothea Wagner:
06091 Abstracts Collection -- Data Structures. Data Structures 2006 - 2005
- [i4]Marco Gaertler, Dorothea Wagner:
A Hybrid Model for Drawing Dynamic and Evolving Graphs. Algorithmic Aspects of Large and Complex Networks 2005 - [i3]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner:
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. Algorithmic Aspects of Large and Complex Networks 2005 - 2004
- [i2]Susanne Albers, Robert Sedgewick, Dorothea Wagner:
04091 Abstracts Collection - Data Structures. Data Structures 2004 - [i1]Leo G. Kroon, Dorothea Wagner, Frank Geraets, Christos D. Zaroliagis:
04261 Abstracts Collection - Algorithmic Methods for Railway Optimization. Algorithmic Methods for Railway Optimization 2004
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
