Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Dorothea Wagner
2010 – today
- 2013
[j64]- [j63]Robert Görke, Tanja Hartmann, Andrea Kappes, Dorothea Wagner: Identifikation von Clustern in Graphen. Informatik Spektrum 36(2): 144-152 (2013)
- [j62]
- [j61]Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, Dorothea Wagner: Dynamic graph clustering combining modularity and smoothness. ACM Journal of Experimental Algorithmics 18 (2013)
- [c112]Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner: Search-Space Size in Contraction Hierarchies. ICALP (1) 2013: 93-104
- [c111]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner: Optimal Orthogonal Graph Drawing with Convex Bend Costs. ICALP (1) 2013: 184-195
- [c110]Michael Hamann, Tanja Hartmann, Dorothea Wagner: Hierarchies of Predominantly Connected Communities. WADS 2013: 365-377
- [c109]Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner: Intriguingly Simple and Fast Transit Routing. SEA 2013: 43-54
- [c108]Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck: Computing Multimodal Journeys in Practice. SEA 2013: 260-271
- [c107]Andreas Gemsa, Thomas Pajor, Dorothea Wagner, Tobias Zündorf: Efficient Computation of Jogging Routes. SEA 2013: 272-283
- [e15]David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner (Eds.): 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
- [i9]Mong-Jen Kao, Der-Tsai Lee, Dorothea Wagner: Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch. CoRR abs/1301.3252 (2013)
- [i8]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)
- [i7]Michael Hamann, Tanja Hartmann, Dorothea Wagner: Hierarchies of Predominantly Connected Communities. CoRR abs/1305.0757 (2013)
- [i6]Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner: Static and Dynamic Aspects of Scientific Collaboration Networks. CoRR abs/1306.5268 (2013)
- [i5]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)
- 2012
- [j60]Robert Görke, Tanja Hartmann, Dorothea Wagner: Dynamic Graph Clustering Using Minimum-Cut Trees. J. Graph Algorithms Appl. 16(2): 411-446 (2012)
- [j59]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)
- [c106]Robert Görke, Andrea Schumm, Dorothea Wagner: Experiments on Density-Constrained Graph Clustering. ALENEX 2012: 1-15
- [c105]Julian Dibbelt, Thomas Pajor, Dorothea Wagner: User-Constrained Multi-Modal Route Planning. ALENEX 2012: 118-129
- [c104]Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner: Static and Dynamic Aspects of Scientific Collaboration Networks. ASONAM 2012: 522-526
- [c103]Reinhard Bauer, Moritz Baum, Ignaz Rutter, Dorothea Wagner: On the Complexity of Partitioning Graphs for Arc-Flags. ATMOS 2012: 71-82
- [c102]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
- [c101]Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner: Column-Based Graph Layouts. Graph Drawing 2012: 236-247
- [c100]Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner: Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. ISAAC 2012: 75-84
- [c99]Tanja Hartmann, Dorothea Wagner: Fast and Simple Fully-Dynamic Cut Tree Construction. ISAAC 2012: 95-105
- [c98]Fabian Fuchs, Markus Völker, Dorothea Wagner: Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks. MedAlg 2012: 188-202
- [c97]Robert Görke, Roland Kluge, Andrea Schumm, Christian Staudt, Dorothea Wagner: An Efficient Generator for Clustered Dynamic Random Networks. MedAlg 2012: 219-233
- [c96]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner: Higher Order City Voronoi Diagrams. SWAT 2012: 59-70
- [i4]Andreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner: Higher Order City Voronoi Diagrams. CoRR abs/1204.4374 (2012)
- [i3]Thomas Bläsius, Ignaz Rutter, Dorothea Wagner: Optimal Orthogonal Graph Drawing with Convex Bend Costs. CoRR abs/1204.4997 (2012)
- 2011
- [j58]Peter Sanders, Dorothea Wagner: Algorithm Engineering. it - Information Technology 53(6): 263-265 (2011)
- [j57]Reinhard Bauer, Daniel Delling, Dorothea Wagner: Experimental study of speed up techniques for timetable information systems. Networks 57(1): 38-52 (2011)
- [j56]Robert Franke, Ignaz Rutter, Dorothea Wagner: Computing large matchings in planar graphs with fixed minimum degree. Theor. Comput. Sci. 412(32): 4092-4099 (2011)
- [c95]Sascha Meinert, Dorothea Wagner: An Experimental Study on Generating Planar Graphs. FAW-AAIM 2011: 375-387
- [c94]Mong-Jen Kao, Bastian Katz, Marcus Krug, Der-Tsai Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner: Connecting Two Trees with Optimal Routing Cost. CCCG 2011
- [c93]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner: The Density Maximization Problem in Graphs. COCOON 2011: 25-36
- [c92]Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, Dorothea Wagner: Generalizing Geometric Graphs. Graph Drawing 2011: 179-190
- [c91]
- [c90]Christof Doll, Tanja Hartmann, Dorothea Wagner: Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. WADS 2011: 338-349
- [c89]Robert Görke, Andrea Schumm, Dorothea Wagner: Density-Constrained Graph Clustering. WADS 2011: 679-690
- [c88]Bastian Katz, Ignaz Rutter, Ben Strasser, Dorothea Wagner: Speed Dating - An Algorithmic Case Study Involving Matching and Scheduling. SEA 2011: 292-303
- [c87]Dennis Schieferdecker, Markus Völker, Dorothea Wagner: Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. SEA 2011: 388-399
- [c86]
- [p4]Robert Görke, Steffen Mecke, Dorothea Wagner: Maximum Flows - Towards the Stadium During Rush Hour. Algorithms Unplugged 2011: 333-344
- [e14]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3
- [i2]Dennis Schieferdecker, Markus Völker, Dorothea Wagner: Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks. CoRR abs/1103.1771 (2011)
- [i1]Robert Görke, Andrea Schumm, Dorothea Wagner: Experiments on Density-Constrained Graph Clustering. CoRR abs/1112.2143 (2011)
- 2010
- [j55]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 Journal of Experimental Algorithmics 15 (2010)
- [j54]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)
- [c85]Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner: Synthetic Road Networks. AAIM 2010: 46-57
- [c84]Reinhard Bauer, Marcus Krug, Dorothea Wagner: Enumerating and Generating Labeled k-degenerate Graphs. ANALCO 2010: 90-98
- [c83]Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner: Preprocessing Speed-Up Techniques Is Hard. CIAC 2010: 359-370
- [c82]Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner: Orthogonal Graph Drawing with Flexibility Constraints. Graph Drawing 2010: 92-104
- [c81]Edith Brunel, Daniel Delling, Andreas Gemsa, Dorothea Wagner: Space-Efficient SHARC-Routing. SEA 2010: 47-58
- [c80]Robert Görke, Pascal Maillard, Christian Staudt, Dorothea Wagner: Modularity-Driven Clustering of Dynamic Graphs. SEA 2010: 436-448
- [c79]Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, Dorothea Wagner: Gateway Decompositions for Constrained Reachability Problems. SEA 2010: 449-461
- [c78]Bastian Katz, Markus Völker, Dorothea Wagner: Energy efficient scheduling with power control for wireless networks. WiOpt 2010: 160-169
2000 – 2009
- 2009
- [j53]Anita Schöbel, Horst W. Hamacher, Annegret Liebers, Dorothea Wagner: The Continuous Stop Location Problem in Public Transportation Networks. APJOR 26(1): 13-30 (2009)
- [j52]Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos D. Zaroliagis: Engineering planar separator algorithms. ACM Journal of Experimental Algorithmics 14 (2009)
- [j51]
- [c77]Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner: Orca Reduction and ContrAction Graph Clustering. AAIM 2009: 152-165
- [c76]Daniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis: Efficient Route Planning in Flight Networks. ATMOS 2009
- [c75]Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner: Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139
- [c74]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
- [c73]Daniel Delling, Thomas Pajor, Dorothea Wagner: Accelerating Multi-modal Route Planning by Access-Nodes. ESA 2009: 587-598
- [c72]Robert Franke, Ignaz Rutter, Dorothea Wagner: Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. ISAAC 2009: 872-881
- [c71]Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner: The Shortcut Problem - Complexity and Approximation. SOFSEM 2009: 105-116
- [c70]Robert Görke, Tanja Hartmann, Dorothea Wagner: Dynamic Graph Clustering Using Minimum-Cut Trees. WADS 2009: 339-350
- [c69]Reinhard Bauer, Dorothea Wagner: Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. SEA 2009: 51-62
- [c68]
- [p3]Daniel Delling, Thomas Pajor, Dorothea Wagner: Engineering Time-Expanded Graphs for Faster Timetable Information. Robust and Online Large-Scale Optimization 2009: 182-206
- [p2]Daniel Delling, Dorothea Wagner: Time-Dependent Route Planning. Robust and Online Large-Scale Optimization 2009: 207-230
- [e13]Jürgen Lerner, Dorothea Wagner, Katharina Anna Zweig (Eds.): 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
- [e12]
- 2008
- [j50]Martin Holzer, Frank Schulz, Dorothea Wagner: Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics 13 (2008)
- [j49]Michael Kaufmann, Dorothea Wagner: Guest Editor's Foreword. J. Graph Algorithms Appl. 12(1): 3-4 (2008)
- [j48]Michael Baur, Marco Gaertler, Robert Görke, Marcus Krug, Dorothea Wagner: Augmenting k-core generation with preferential attachment. NHM 3(2): 277-294 (2008)
- [j47]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)
- [c67]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
- [c66]Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner: Engineering Comparators for Graph Clusterings. AAIM 2008: 131-142
- [c65]Bastian Katz, Steffen Mecke, Dorothea Wagner: Efficient Scheduling of Data-Harvesting Trees. ALGOSENSORS 2008: 43-56
- [c64]Bastian Katz, Markus Völker, Dorothea Wagner: Link Scheduling in Local Interference Models. ALGOSENSORS 2008: 57-71
- [c63]Daniel Delling, Thomas Pajor, Dorothea Wagner: Engineering Time-Expanded Graphs for Faster Timetable Information. ATMOS 2008
- [c62]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
- [p1]Dorothea Wagner, Robert Görke, Steffen Mecke: Maximale Flüsse - Die ganze Stadt will zum Stadion. Taschenbuch der Algorithmen 2008: 361-372
- [e11]J. Ian Munro, Dorothea Wagner (Eds.): Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008. SIAM 2008
- [e10]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.): Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2
- 2007
- [j46]Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Engineering graph clustering: Models and experimental evaluation. ACM Journal of Experimental Algorithmics 12 (2007)
- [j45]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics 12 (2007)
- [c61]Marco Gaertler, Robert Görke, Dorothea Wagner: Significance-Driven Graph Clustering. AAIM 2007: 11-26
- [c60]Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX 2007
- [c59]Reinhard Bauer, Daniel Delling, Dorothea Wagner: Experimental Study on Speed-Up Techniques for Timetable Information Systems. ATMOS 2007
- [c58]Marcus Krug, Dorothea Wagner: Minimizing the Area for Planar Straight-Line Grid Drawings. Graph Drawing 2007: 207-212
- [c57]Robert Görke, Marco Gaertler, Dorothea Wagner: LunarVis - Analytic Visualizations of Large Graphs. Graph Drawing 2007: 352-364
- [c56]Bastian Katz, Marco Gaertler, Dorothea Wagner: Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. SOFSEM (1) 2007: 330-341
- [c55]Markus Maier, Steffen Mecke, Dorothea Wagner: Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. SOFSEM (1) 2007: 410-421
- [c54]Dorothea Wagner, Thomas Willhalm: Speed-Up Techniques for Shortest-Path Computations. STACS 2007: 23-36
- [c53]
- [c52]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
- [e9]Frank Geraets, Leo G. Kroon, Anita Schöbel, Dorothea Wagner, Christos D. Zaroliagis (Eds.): 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
- [e8]Dorothea Wagner, Roger Wattenhofer (Eds.): 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
- [e7]Michael Kaufmann, Dorothea Wagner (Eds.): 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
- 2006
- [j44]Sabine Cornelsen, Dorothea Wagner: Completely connected clustered graphs. J. Discrete Algorithms 4(2): 313-323 (2006)
- [j43]Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm: Partitioning graphs to speedup Dijkstra's algorithm. ACM Journal of Experimental Algorithmics 11 (2006)
- [c51]Martin Holzer, Frank Schulz, Dorothea Wagner: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ALENEX 2006: 156-170
- [c50]Lars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Executive Summary -- Data Structures. Data Structures 2006
- [c49]Lars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Abstracts Collection -- Data Structures. Data Structures 2006
- [e6]Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner (Eds.): 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
- [e5]Lars Arge, Robert Sedgewick, Dorothea Wagner (Eds.): Data Structures, 26.02. - 03.03.2006. Dagstuhl Seminar Proceedings 06091, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j42]Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Combining speed-up techniques for shortest-path computations. ACM Journal of Experimental Algorithmics 10 (2005)
- [j41]Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis: Geometric containers for efficient shortest-path computation. ACM Journal of Experimental Algorithmics 10 (2005)
- [j40]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)
- [j39]Thomas Schank, Dorothea Wagner: Approximating Clustering Coefficient and Transitivity. J. Graph Algorithms Appl. 9(2): 265-275 (2005)
- [c48]Dorothea Wagner, Thomas Willhalm: Drawing Graphs to Speed Up Shortest-Path Computations. ALENEX/ANALCO 2005: 17-25
- [c47]Steffen Mecke, Anita Schöbel, Dorothea Wagner: Station Location - Complexity and Approximation. ATMOS 2005
- [c46]Marco Gaertler, Dorothea Wagner: A Hybrid Model for Drawing Dynamic and Evolving Graphs. Algorithmic Aspects of Large and Complex Networks 2005
- [c45]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
- [c44]Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Engineering Planar Separator Algorithms. ESA 2005: 628-639
- [c43]Marco Gaertler, Dorothea Wagner: A Hybrid Model for Drawing Dynamic and Evolving Graphs. Graph Drawing 2005: 189-200
- [c42]Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner: Graph-Drawing Contest Report. Graph Drawing 2005: 528-531
- [c41]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
- [c40]Thomas Schank, Dorothea Wagner: Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. WEA 2005: 606-609
- [e4]Susanne Albers, Robert Sedgewick, Dorothea Wagner (Eds.): Data Structures, 22.-27. February 2004. Dagstuhl Seminar Proceedings 04091, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005
- 2004
- [j38]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)
- [j37]Maria Flavia Mammana, Steffen Mecke, Dorothea Wagner: The Station Location Problem on Two Intersecting Lines. Electr. Notes Theor. Comput. Sci. 92: 52-64 (2004)
- [j36]Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis: Dynamic Shortest Paths Containers. Electr. Notes Theor. Comput. Sci. 92: 65-84 (2004)
- [j35]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. Electr. Notes Theor. Comput. Sci. 92: 85-103 (2004)
- [j34]Ulrik Brandes, Dorothea Wagner: Netzwerkvisualisierung. it - Information Technology 46(3): 129-134 (2004)
- [j33]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)
- [j32]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Generating node coordinates for shortest-path computations in transportation networks. ACM Journal of Experimental Algorithmics 9 (2004)
- [j31]Sabine Cornelsen, Thomas Schank, Dorothea Wagner: Drawing Graphs on Two and Three Lines. J. Graph Algorithms Appl. 8(2): 161-177 (2004)
- [c39]Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Experimental Comparison of Shortest Path Approaches for Timetable Information. ALENEX/ANALC 2004: 88-99
- [c38]Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Timetable Information: Models and Algorithms. ATMOS 2004: 67-90
- [c37]Susanne Albers, Robert Sedgewick, Dorothea Wagner: 04091 Abstracts Collection - Data Structures. Data Structures 2004
- [c36]Steffen Mecke, Dorothea Wagner: Solving Geometric Covering Problems by Data Reduction. ESA 2004: 760-771
- [c35]Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Drawing the AS Graph in 2.5 Dimensions. Graph Drawing 2004: 43-48
- 2003
- [j30]Dorothea Wagner: DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke". it - Information Technology 45(3): 162-169 (2003)
- [j29]Ulrik Brandes, Patrick Kenis, Dorothea Wagner: Communicating Centrality in Policy Network Drawings. IEEE Trans. Vis. Comput. Graph. 9(2): 241-253 (2003)
- [c34]Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms. ESA 2003: 568-579
- [c33]Dorothea Wagner, Thomas Willhalm: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. ESA 2003: 776-787
- [c32]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. Graph Drawing 2003: 357-368
- [c31]
- [c30]
- [c29]
- 2002
- [j28]
- [c28]Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Using Multi-level Graphs for Timetable Information in Railway Systems. ALENEX 2002: 43-59
- [c27]Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner: Sketch-Driven Orthogonal Graph Drawing. Graph Drawing 2002: 1-11
- [c26]Sabine Cornelsen, Thomas Schank, Dorothea Wagner: Drawing Graphs on Two and Three Lines. Graph Drawing 2002: 31-41
- 2001
- [j27]Horst W. Hamacher, Annegret Liebers, Anita Schöbel, Dorothea Wagner, Frank Wagner: Locating New Stops in a Railway Network. Electr. Notes Theor. Comput. Sci. 50(1): 13-23 (2001)
- [j26]Takao Nishizeki, Roberto Tamassia, Dorothea Wagner: Guest Editors' Foreword. J. Graph Algorithms Appl. 5(5): 1 (2001)
- [j25]Ulrik Brandes, Jörg Raab, Dorothea Wagner: Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections. Journal of Social Structure 2 (2001)
- [c25]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Travel Planning with Self-Made Maps. ALENEX 2001: 132-144
- [c24]Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner: Visone. Graph Drawing 2001: 463-464
- [c23]Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner: Planarity of the 2-Level Cactus Model. WG 2001: 91-102
- [e3]Michael Kaufmann, Dorothea Wagner (Eds.): 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
- [e2]Stefan Näher, Dorothea Wagner (Eds.): 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
- 2000
- [j24]
- [j23]Ulrik Brandes, Dorothea Wagner: A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. Algorithmica 28(1): 16-36 (2000)
- [j22]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)
- [j21]Frank Schulz, Dorothea Wagner, Karsten Weihe: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics 5: 12 (2000)
- [j20]Ulrik Brandes, Dorothea Wagner: Using Graph Layout to Visualize Train Interconnection Data. J. Graph Algorithms Appl. 4(3): 135-155 (2000)
- [j19]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)
- [j18]Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner: On the Complexity of Partial Order Properties. Order 17(2): 179-193 (2000)
- [j17]Dorothea Wagner, Karsten Weihe: Editorial: Discrete algorithm engineering. Softw., Pract. Exper. 30(11): 1165 (2000)
- [c22]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). Graph Drawing 2000: 103-114
- [c21]Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner: Fast Layout Methods for Timetable Graphs. Graph Drawing 2000: 127-138
- [e1]Ulrik Brandes, Dorothea Wagner (Eds.): 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
1990 – 1999
- 1999
- [j16]
- [j15]Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe: A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. Discrete Applied Mathematics 92(2-3): 91-110 (1999)
- [c20]Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm: Empirical Design of Geometric Algorithms. Symposium on Computational Geometry 1999: 86-94
- [c19]Ulrik Brandes, Patrick Kenis, Dorothea Wagner: Centrality in Policy Network Drawings. Graph Drawing 1999: 250-258
- [c18]Frank Schulz, Dorothea Wagner, Karsten Weihe: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. Algorithm Engineering 1999: 110-123
- [c17]Annegret Liebers, Dorothea Wagner, Karsten Weihe: On the Hardness of Recognizing Bundles in Time Table Graphs. WG 1999: 325-337
- 1998
- [c16]Ulrik Brandes, Dorothea Wagner: Using Graph Layout to Visualize Train Interconnection Data. Graph Drawing 1998: 44-56
- [c15]Ulrik Brandes, Dorothea Wagner: Dynamic Grid Embedding with Few Bends and Changes. ISAAC 1998: 89-98
- 1997
- [j14]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe: The Vertex-Disjoint Menger Problem in Planar Graphs. SIAM J. Comput. 26(2): 331-349 (1997)
- [c14]Ulrik Brandes, Dorothea Wagner: A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). ESA 1997: 64-77
- [c13]Ulrik Brandes, Dorothea Wagner: A Bayesian Paradigm for Dynamic Graph Layout. Graph Drawing 1997: 236-247
- 1996
- [j13]Ruth Kuchem, Dorothea Wagner, Frank Wagner: Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996)
- [j12]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)
- [j11]Annegret Liebers, Dorothea Wagner, Karsten Weihe: C++ im Nebenfachstudium: Konzepte und Erfahrungen. Informatik Spektrum 19(5): 262-265 (1996)
- [j10]Andreas Schikarski, Dorothea Wagner: Efficient Parallel Matrix Inversion on Interconnection Networks. J. Parallel Distrib. Comput. 34(2): 196-201 (1996)
- [c12]
- 1995
- [j9]Dorothea Wagner, Karsten Weihe: A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. Combinatorica 15(1): 135-150 (1995)
- [c11]Dorothea Wagner, Karsten Weihe: An Animated Library of Combinatorial VLSI-Routing Algorithms. Symposium on Computational Geometry 1995: C28-C29
- 1994
- [j8]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994)
- [c10]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
- [j7]Dorothea Wagner: Optimal routing through dense chanels. Int. J. Comput. Geometry Appl. 3(3): 269-289 (1993)
- [j6]Edmund Ihler, Dorothea Wagner, Frank Wagner: Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993)
- [j5]Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993)
- [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]
- [c6]Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe: The Vertex-Disjoint Menger Problem in Planar Graphs. SODA 1993: 112-119
- 1992
- [j4]Dorothea Wagner, Frank Wagner: An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discrete Applied Mathematics 40(1): 73-81 (1992)
- [j3]
- [c5]Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399
- [c4]
- 1991
- [j2]Dorothea Wagner, Frank Wagner: A generalization of the zero-one principle for sorting algorithms. Discrete Applied Mathematics 30(2-3): 265-273 (1991)
- [c3]
- [c2]Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. SODA 1991: 475-482
- 1990
- [j1]
1980 – 1989
- 1989
- [c1]Ruth Kuchem, Dorothea Wagner, Frank Wagner: Area-Optimal Three-Layer Channel Routing. FOCS 1989: 506-511
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:26 CEST by the dblp team