dblp.uni-trier.dewww.uni-trier.de

Dorothea Wagner Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
138EEJürgen Lerner, Dorothea Wagner, Katharina A. Zweig: Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126] Springer 2009
137EEDaniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner: Orca Reduction and ContrAction Graph Clustering. AAIM 2009: 152-165
136EEDaniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner: Engineering Route Planning Algorithms. Algorithmics of Large and Complex Networks 2009: 117-139
135EEMichael 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
134EEDaniel Delling, Thomas Pajor, Dorothea Wagner: Accelerating Multi-modal Route Planning by Access-Nodes. ESA 2009: 587-598
133EEDaniel Delling, Dorothea Wagner: Pareto Paths with SHARC. SEA 2009: 125-136
132EEReinhard Bauer, Dorothea Wagner: Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. SEA 2009: 51-62
131EEReinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner: The Shortcut Problem - Complexity and Approximation. SOFSEM 2009: 105-116
130EERobert Görke, Tanja Hartmann, Dorothea Wagner: Dynamic Graph Clustering Using Minimum-Cut Trees. WADS 2009: 339-350
129EEDaniel Delling, Thomas Pajor, Dorothea Wagner: Engineering Time-Expanded Graphs for Faster Timetable Information. Robust and Online Large-Scale Optimization 2009: 182-206
128EEDaniel Delling, Dorothea Wagner: Time-Dependent Route Planning. Robust and Online Large-Scale Optimization 2009: 207-230
127EEAnita Schöbel, Horst W. Hamacher, Annegret Liebers, Dorothea Wagner: The Continuous Stop Location Problem in Public Transportation Networks. APJOR 26(1): 13-30 (2009)
2008
126 J. Ian Munro, Dorothea Wagner: Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2008, San Francisco, California, USA, January 19, 2008 SIAM 2008
125 Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Taschenbuch der Algorithmen Springer 2008
124EEDaniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner: Engineering Comparators for Graph Clusterings. AAIM 2008: 131-142
123EEChristopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner: Engineering Label-Constrained Shortest-Path Algorithms. AAIM 2008: 27-37
122EEBastian Katz, Steffen Mecke, Dorothea Wagner: Efficient Scheduling of Data-Harvesting Trees. ALGOSENSORS 2008: 43-56
121EEBastian Katz, Markus Völker, Dorothea Wagner: Link Scheduling in Local Interference Models. ALGOSENSORS 2008: 57-71
120EEDaniel Delling, Thomas Pajor, Dorothea Wagner: Engineering Time-Expanded Graphs for Faster Timetable Information. ATMOS 2008
119EEReinhard 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
118EEDorothea Wagner, Robert Görke, Steffen Mecke: Maximale Flüsse - Die ganze Stadt will zum Stadion. Taschenbuch der Algorithmen 2008: 361-372
117EEMartin Holzer, Frank Schulz, Dorothea Wagner: Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics 13: (2008)
116EEUlrik 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)
115EEMichael Kaufmann, Dorothea Wagner: Guest Editor's Foreword. J. Graph Algorithms Appl. 12(1): 3-4 (2008)
2007
114 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 Springer 2007
113 Michael Kaufmann, Dorothea Wagner: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers Springer 2007
112 Dorothea Wagner, Roger Wattenhofer: Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures [result from a Dagstuhl seminar]. Springer 2007
111EEMarco Gaertler, Robert Görke, Dorothea Wagner: Significance-Driven Graph Clustering. AAIM 2007: 11-26
110EESebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. ALENEX 2007
109EEReinhard Bauer, Daniel Delling, Dorothea Wagner: Experimental Study on Speed-Up Techniques for Timetable Information Systems. ATMOS 2007
108EEMarcus Krug, Dorothea Wagner: Minimizing the Area for Planar Straight-Line Grid Drawings. Graph Drawing 2007: 207-212
107EERobert Görke, Marco Gaertler, Dorothea Wagner: LunarVis - Analytic Visualizations of Large Graphs. Graph Drawing 2007: 352-364
106EEBastian Katz, Marco Gaertler, Dorothea Wagner: Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. SOFSEM (1) 2007: 330-341
105EEMarkus Maier, Steffen Mecke, Dorothea Wagner: Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. SOFSEM (1) 2007: 410-421
104EEDorothea Wagner, Thomas Willhalm: Speed-Up Techniques for Shortest-Path Computations. STACS 2007: 23-36
103EEDaniel Delling, Dorothea Wagner: Landmark-Based Routing in Dynamic Graphs. WEA 2007: 52-65
102EEUlrik 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
101EEEvangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics 12: (2007)
100EEUlrik Brandes, Marco Gaertler, Dorothea Wagner: Engineering graph clustering: Models and experimental evaluation. ACM Journal of Experimental Algorithmics 12: (2007)
2006
99 Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner: Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
98 Lars Arge, Robert Sedgewick, Dorothea Wagner: Data Structures, 26.02. - 03.03.2006 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
97EELars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Abstracts Collection -- Data Structures. Data Structures 2006
96EELars Arge, Robert Sedgewick, Dorothea Wagner: 06091 Executive Summary -- Data Structures. Data Structures 2006
95EERolf 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)
94EESabine Cornelsen, Dorothea Wagner: Completely connected clustered graphs. J. Discrete Algorithms 4(2): 313-323 (2006)
2005
93 Susanne Albers, Robert Sedgewick, Dorothea Wagner: Data Structures, 22.-27. February 2004 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005
92EEDorothea Wagner, Thomas Willhalm: Drawing Graphs to Speed Up Shortest-Path Computations. ALENEX/ANALCO 2005: 17-25
91EESteffen Mecke, Anita Schöbel, Dorothea Wagner: Station Location - Complexity and Approximation. ATMOS 2005
90EEStefano 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
89EEMarco Gaertler, Dorothea Wagner: A Hybrid Model for Drawing Dynamic and Evolving Graphs. Algorithmic Aspects of Large and Complex Networks 2005
88EEMartin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Engineering Planar Separator Algorithms. ESA 2005: 628-639
87EEMarco Gaertler, Dorothea Wagner: A Hybrid Model for Drawing Dynamic and Evolving Graphs. Graph Drawing 2005: 189-200
86EEChristian A. Duncan, Stephen G. Kobourov, Dorothea Wagner: Graph-Drawing Contest Report. Graph Drawing 2005: 528-531
85EERolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm: Partitioning Graphs to Speed Up Dijkstra's Algorithm. WEA 2005: 189-202
84EEThomas Schank, Dorothea Wagner: Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. WEA 2005: 606-609
83EEMartin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Combining speed-up techniques for shortest-path computations. ACM Journal of Experimental Algorithmics 10: (2005)
82EEDorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis: Geometric containers for efficient shortest-path computation. ACM Journal of Experimental Algorithmics 10: (2005)
81EEUlrik 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)
80EEThomas Schank, Dorothea Wagner: Approximating Clustering Coefficient and Transitivity. J. Graph Algorithms Appl. 9(2): 265-275 (2005)
2004
79 Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Experimental Comparison of Shortest Path Approaches for Timetable Information. ALENEX/ANALC 2004: 88-99
78EEMatthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Timetable Information: Models and Algorithms. ATMOS 2004: 67-90
77EESusanne Albers, Robert Sedgewick, Dorothea Wagner: 04091 Abstracts Collection - Data Structures. Data Structures 2004
76EESteffen Mecke, Dorothea Wagner: Solving Geometric Covering Problems by Data Reduction. ESA 2004: 760-771
75EEMichael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Drawing the AS Graph in 2.5 Dimensions. Graph Drawing 2004: 43-48
74EEUlrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Generating node coordinates for shortest-path computations in transportation networks. ACM Journal of Experimental Algorithmics 9: (2004)
73EEUlrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner: How to draw the minimum cuts of a planar graph. Comput. Geom. 29(2): 117-133 (2004)
72EEMaria Flavia Mammana, Steffen Mecke, Dorothea Wagner: The Station Location Problem on Two Intersecting Lines. Electr. Notes Theor. Comput. Sci. 92: 52-64 (2004)
71EEDorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis: Dynamic Shortest Paths Containers. Electr. Notes Theor. Comput. Sci. 92: 65-84 (2004)
70EEEvangelia 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)
69EEUlrik 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)
68EESabine Cornelsen, Thomas Schank, Dorothea Wagner: Drawing Graphs on Two and Three Lines. J. Graph Algorithms Appl. 8(2): 161-177 (2004)
67EEUlrik Brandes, Dorothea Wagner: Netzwerkvisualisierung. it - Information Technology 46(3): 129-134 (2004)
2003
66EEUlrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms. ESA 2003: 568-579
65EEDorothea Wagner, Thomas Willhalm: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. ESA 2003: 776-787
64EEUlrik Brandes, Sabine Cornelsen, Dorothea Wagner: Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. Graph Drawing 2003: 357-368
63EEDorothea Wagner: Algorithms and Models for Railway Optimization. WADS 2003: 198-206
62EEDorothea Wagner: Analysis and Visualization of Social Networks. WEA 2003: 261-266
61EESabine Cornelsen, Dorothea Wagner: Completely Connected Clustered Graphs. WG 2003: 168-179
60EEUlrik Brandes, Patrick Kenis, Dorothea Wagner: Communicating Centrality in Policy Network Drawings. IEEE Trans. Vis. Comput. Graph. 9(2): 241-253 (2003)
59 Dorothea Wagner: DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke". it - Information Technology 45(3): 162-169 (2003)
2002
58EEFrank Schulz, Dorothea Wagner, Christos D. Zaroliagis: Using Multi-level Graphs for Timetable Information in Railway Systems. ALENEX 2002: 43-59
57EEUlrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner: Sketch-Driven Orthogonal Graph Drawing. Graph Drawing 2002: 1-11
56EESabine Cornelsen, Thomas Schank, Dorothea Wagner: Drawing Graphs on Two and Three Lines. Graph Drawing 2002: 31-41
55EEDorothea Wagner: Preface. Electr. Notes Theor. Comput. Sci. 66(6): (2002)
2001
54 Stefan Näher, Dorothea Wagner: Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings Springer 2001
53 Michael Kaufmann, Dorothea Wagner: Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999). Springer 2001
52EEUlrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Travel Planning with Self-Made Maps. ALENEX 2001: 132-144
51EEMichael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner: Visone. Graph Drawing 2001: 463-464
50EESabine Cornelsen, Yefim Dinitz, Dorothea Wagner: Planarity of the 2-Level Cactus Model. WG 2001: 91-102
49EEHorst 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): (2001)
48EETakao Nishizeki, Roberto Tamassia, Dorothea Wagner: Guest Editors' Foreword. J. Graph Algorithms Appl. 5(5): 1 (2001)
47EEUlrik Brandes, Jörg Raab, Dorothea Wagner: Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections. Journal of Social Structure 2(4): (2001)
2000
46 Ulrik Brandes, Dorothea Wagner: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings Springer 2000
45EEUlrik Brandes, Sabine Cornelsen, Dorothea Wagner: How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). Graph Drawing 2000: 103-114
44EEUlrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner: Fast Layout Methods for Timetable Graphs. Graph Drawing 2000: 127-138
43EEFrank 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)
42EETakao Nishizeki, Roberto Tamassia, Dorothea Wagner: Foreword. Algorithmica 26(1): 1-2 (2000)
41EEUlrik Brandes, Dorothea Wagner: A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. Algorithmica 28(1): 16-36 (2000)
40 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)
39EEUlrik Brandes, Dorothea Wagner: Using Graph Layout to Visualize Train Interconnection Data. J. Graph Algorithms Appl. 4(3): 135-155 (2000)
38EEUlrik 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)
37EEStefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner: On the Complexity of Partial Order Properties. Order 17(2): 179-193 (2000)
36 Dorothea Wagner, Karsten Weihe: Editorial: Discrete algorithm engineering. Softw., Pract. Exper. 30(11): 1165 (2000)
1999
35EEFrank Schulz, Dorothea Wagner, Karsten Weihe: Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. Algorithm Engineering 1999: 110-123
34EEUlrik Brandes, Patrick Kenis, Dorothea Wagner: Centrality in Policy Network Drawings. Graph Drawing 1999: 250-258
33EEKarsten 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
32EEAnnegret Liebers, Dorothea Wagner, Karsten Weihe: On the Hardness of Recognizing Bundles in Time Table Graphs. WG 1999: 325-337
31 Ruth Kuchem, Dorothea Wagner: Wiring edge-disjoint layouts. Comput. Geom. 14(4): 255-273 (1999)
30EEUlrik 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)
1998
29EEUlrik Brandes, Dorothea Wagner: Using Graph Layout to Visualize Train Interconnection Data. Graph Drawing 1998: 44-56
28EEUlrik Brandes, Dorothea Wagner: Dynamic Grid Embedding with Few Bends and Changes. ISAAC 1998: 89-98
1997
27EEUlrik Brandes, Dorothea Wagner: A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). ESA 1997: 64-77
26 Ulrik Brandes, Dorothea Wagner: A Bayesian Paradigm for Dynamic Graph Layout. Graph Drawing 1997: 236-247
25 Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe: The Vertex-Disjoint Menger Problem in Planar Graphs. SIAM J. Comput. 26(2): 331-349 (1997)
1996
24 Ruth Kuchem, Dorothea Wagner: Wiring Edge-Disjoint Layouts. Graph Drawing 1996: 271-285
23 Ruth Kuchem, Dorothea Wagner, Frank Wagner: Optimizing Area for Three-Layer Knock-Knee Channel Routing. Algorithmica 15(5): 495-519 (1996)
22 Annegret Liebers, Dorothea Wagner, Karsten Weihe: C++ im Nebenfachstudium: Konzepte und Erfahrungen. Informatik Spektrum 19(5): 262-265 (1996)
21 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)
20 Andreas Schikarski, Dorothea Wagner: Efficient Parallel Matrix Inversion on Interconnection Networks. J. Parallel Distrib. Comput. 34(2): 196-201 (1996)
1995
19EEDorothea Wagner, Karsten Weihe: An Animated Library of Combinatorial VLSI-Routing Algorithms. Symposium on Computational Geometry 1995: C28-C29
18 Dorothea Wagner, Karsten Weihe: A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. Combinatorica 15(1): 135-150 (1995)
1994
17 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
16 Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers 43(5): 581-589 (1994)
1993
15EEDorothea Wagner, Karsten Weihe: A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. ESA 1993: 384-395
14EEHeike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe: Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. ISAAC 1993: 343-352
13EEDorothea Wagner, Frank Wagner: Between Min Cut and Graph Bisection. MFCS 1993: 744-750
12 Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe: The Vertex-Disjoint Menger Problem in Planar Graphs. SODA 1993: 112-119
11 Edmund Ihler, Dorothea Wagner, Frank Wagner: Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993)
10 Dorothea Wagner: Optimal routing through dense chanels. Int. J. Comput. Geometry Appl. 3(3): 269-289 (1993)
9 Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. J. Algorithms 15(2): 267-283 (1993)
1992
8EEMajid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe: Wiring Knock-Knee Layouts: A Global Appoach. ISAAC 1992: 388-399
7EEStefan Felsner, Dorothea Wagner: On the Complexity of Partial Order Properties. WG 1992: 225-235
6 Dorothea Wagner, Frank Wagner: An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. Discrete Applied Mathematics 40(1): 73-81 (1992)
1991
5 Dorothea Wagner: A New Approach to Knock-Knee Channel Routing. ISA 1991: 83-93
4 Michael Formann, Dorothea Wagner, Frank Wagner: Routing through a Dense Channel with Minimum Total Wire Length. SODA 1991: 475-482
3EEDorothea Wagner, Frank Wagner: A generalization of the zero-one principle for sorting algorithms. Discrete Applied Mathematics 30(2-3): 265-273 (1991)
1990
2EEDorothea Wagner: Decomposition of k-ary relations. Discrete Mathematics 81(3): 303-322 (1990)
1989
1 Ruth Kuchem, Dorothea Wagner, Frank Wagner: Area-Optimal Three-Layer Channel Routing FOCS 1989: 506-511

Coauthor Index

1Susanne Albers [77] [93]
2Helmut Alt [125]
3Lars Arge [96] [97] [98]
4Christopher L. Barrett [123]
5Reinhard Bauer [109] [119] [131] [132]
6Michael Baur [51] [75] [135]
7Marc Benkert [51]
8Keith R. Bisset [123]
9Ulrik Brandes [26] [27] [28] [29] [30] [33] [34] [38] [39] [41] [44] [45] [46] [47] [51] [52] [57] [60] [64] [66] [67] [69] [73] [74] [75] [81] [100] [102] [116] [135]
10Sabine Cornelsen [45] [50] [51] [56] [61] [64] [68] [73] [81] [94]
11Gianlorenzo D'Angelo [131]
12Daniel Delling [102] [103] [109] [116] [119] [120] [124] [128] [129] [131] [133] [134] [136] [137]
13Martin Dietzfelbinger [125]
14Yefim Dinitz [50]
15Christian A. Duncan [86]
16Markus Eiglsperger [57]
17Stefan Felsner [7] [37]
18Christian Fieß [73]
19Michael Formann [4] [9]
20Marco Gaertler [51] [66] [75] [87] [89] [100] [102] [106] [107] [111] [116] [124]
21Frank Geraets (Frank Wagner) [1] [3] [4] [6] [8] [9] [11] [13] [16] [23] [49] [114]
22Robert Görke [102] [107] [111] [116] [118] [124] [130] [137]
23Horst W. Hamacher [49] [127]
24Tanja Hartmann [130]
25Friedhelm Meyer auf der Heide [90] [99]
26Martin Hoefer [102] [116]
27Martin Holzer [83] [88] [117] [123]
28Edmund Ihler [11]
29Vanessa Kääb [38]
30Ravi Kant [37]
31Bastian Katz [106] [121] [122]
32Michael Kaufmann [53] [57] [113] [115]
33Patrick Kenis [34] [60]
34Sebastian Knopp [110]
35Stephen G. Kobourov [86]
36Goran Konjevod [123]
37Boris Köpf [51]
38Leo G. Kroon [114]
39Marcus Krug [108]
40Ruth Kuchem [1] [23] [24] [31]
41Stefano Leonardi [90] [99]
42Jürgen Lerner [51] [135] [138]
43Annegret Liebers [22] [32] [33] [40] [49] [127]
44Andres Löh [38]
45Markus Maier [105]
46Maria Flavia Mammana [72]
47Madhav V. Marathe [123]
48Steffen Mecke [72] [76] [91] [105] [118] [122]
49Rolf H. Möhring [85] [95]
50Paul Molitor [17]
51Matthias Müller-Hannemann [33] [78]
52J. Ian Munro [126]
53Stefan Näher [54]
54Gabriele Neyer [30]
55Zoran Nikoloski [102] [116]
56Takao Nishizeki [42] [48]
57Thomas Pajor [120] [129] [134]
58Grigorios Prasinos [88]
59Evangelia Pyrga [70] [79] [101]
60Jörg Raab [47]
61C. Pandu Rangan (Chandrasekaran Pandu Rangan) [37]
62Rüdiger Reischuk [125]
63Heike Ripphausen-Lipa [12] [14] [21] [25]
64Peter Sanders [110] [119] [136]
65Majid Sarrafzadeh [8] [16]
66Thomas Schank [56] [68] [80] [84]
67Christian Scheideler [125]
68Dennis Schieferdecker [119]
69Andreas Schikarski [20]
70Heiko Schilling [85] [95]
71Wolfram Schlickenrieder [30]
72Anita Schöbel [49] [91] [114] [127]
73Dominik Schultes [110] [119] [136]
74Christian Schulz [137]
75Frank Schulz [35] [43] [52] [58] [70] [74] [78] [79] [83] [88] [101] [110] [117]
76Birk Schütz [85] [95]
77Robert Sedgewick [77] [93] [96] [97] [98]
78Galina Shubina [44]
79Uwe Sparmann [17]
80Roberto Tamassia [42] [44] [48]
81Berthold Vöcking [125]
82Markus Völker [121]
83Heribert Vollmer [125]
84Roger Wattenhofer [112]
85Karsten Weihe [8] [12] [14] [15] [16] [18] [19] [21] [22] [25] [30] [32] [33] [35] [36] [40] [43]
86Thomas Willhalm [33] [38] [52] [65] [71] [74] [82] [83] [85] [92] [95] [104]
87Christos D. Zaroliagis [58] [70] [71] [78] [79] [82] [88] [101] [114]
88Katharina A. Zweig [138]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)