The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dorothea Wagner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Using Multi-level Graphs for Timetable Information in Railway Systems. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:43-59 [Conf]
  2. Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
    Travel Planning with Self-Made Maps. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:132-144 [Conf]
  3. Dorothea Wagner, Thomas Willhalm
    Drawing Graphs to Speed Up Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:17-25 [Conf]
  4. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Experimental Comparison of Shortest Path Approaches for Timetable Information. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:88-99 [Conf]
  5. Dorothea Wagner, Karsten Weihe
    An Animated Library of Combinatorial VLSI-Routing Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  6. Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
    Empirical Design of Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:86-94 [Conf]
  7. Susanne Albers, Robert Sedgewick, Dorothea Wagner
    04091 Abstracts Collection - Data Structures. [Citation Graph (0, 0)][DBLP]
    Data Structures, 2004, pp:- [Conf]
  8. Marco Gaertler, Dorothea Wagner
    A Hybrid Model for Drawing Dynamic and Evolving Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
  9. Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner
    05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
  10. Ulrik Brandes, Marco Gaertler, Dorothea Wagner
    Experiments on Graph Clustering Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:568-579 [Conf]
  11. Ulrik Brandes, Dorothea Wagner
    A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:64-77 [Conf]
  12. Martin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Engineering Planar Separator Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:628-639 [Conf]
  13. Steffen Mecke, Dorothea Wagner
    Solving Geometric Covering Problems by Data Reduction. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:760-771 [Conf]
  14. Dorothea Wagner, Thomas Willhalm
    Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:776-787 [Conf]
  15. Dorothea Wagner, Karsten Weihe
    A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:384-395 [Conf]
  16. Ruth Kuchem, Dorothea Wagner, Frank Wagner
    Area-Optimal Three-Layer Channel Routing [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:506-511 [Conf]
  17. Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
    How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:103-114 [Conf]
  18. Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
    Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:357-368 [Conf]
  19. Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner
    Sketch-Driven Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:1-11 [Conf]
  20. Ulrik Brandes, Patrick Kenis, Dorothea Wagner
    Centrality in Policy Network Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:250-258 [Conf]
  21. Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner
    Fast Layout Methods for Timetable Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:127-138 [Conf]
  22. Ulrik Brandes, Dorothea Wagner
    A Bayesian Paradigm for Dynamic Graph Layout. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:236-247 [Conf]
  23. Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner
    Visone. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:463-464 [Conf]
  24. Ulrik Brandes, Dorothea Wagner
    Using Graph Layout to Visualize Train Interconnection Data. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:44-56 [Conf]
  25. Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner
    Drawing the AS Graph in 2.5 Dimensions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:43-48 [Conf]
  26. Sabine Cornelsen, Thomas Schank, Dorothea Wagner
    Drawing Graphs on Two and Three Lines. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:31-41 [Conf]
  27. Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:528-531 [Conf]
  28. Marco Gaertler, Dorothea Wagner
    A Hybrid Model for Drawing Dynamic and Evolving Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:189-200 [Conf]
  29. Ruth Kuchem, Dorothea Wagner
    Wiring Edge-Disjoint Layouts. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:271-285 [Conf]
  30. Dorothea Wagner
    A New Approach to Knock-Knee Channel Routing. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:83-93 [Conf]
  31. Ulrik Brandes, Dorothea Wagner
    Dynamic Grid Embedding with Few Bends and Changes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:89-98 [Conf]
  32. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
    Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:343-352 [Conf]
  33. Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
    Wiring Knock-Knee Layouts: A Global Appoach. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:388-399 [Conf]
  34. Dorothea Wagner, Frank Wagner
    Between Min Cut and Graph Bisection. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:744-750 [Conf]
  35. Michael Formann, Dorothea Wagner, Frank Wagner
    Routing through a Dense Channel with Minimum Total Wire Length. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:475-482 [Conf]
  36. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
    The Vertex-Disjoint Menger Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:112-119 [Conf]
  37. Dorothea Wagner, Thomas Willhalm
    Speed-Up Techniques for Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:23-36 [Conf]
  38. Paul Molitor, Uwe Sparmann, Dorothea Wagner
    Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1994, pp:149-154 [Conf]
  39. Dorothea Wagner
    Algorithms and Models for Railway Optimization. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:198-206 [Conf]
  40. Frank Schulz, Dorothea Wagner, Karsten Weihe
    Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:110-123 [Conf]
  41. Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
    Partitioning Graphs to Speed Up Dijkstra's Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:189-202 [Conf]
  42. Thomas Schank, Dorothea Wagner
    Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:606-609 [Conf]
  43. Dorothea Wagner
    Analysis and Visualization of Social Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:261-266 [Conf]
  44. Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
    Planarity of the 2-Level Cactus Model. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:91-102 [Conf]
  45. Sabine Cornelsen, Dorothea Wagner
    Completely Connected Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:168-179 [Conf]
  46. Stefan Felsner, Dorothea Wagner
    On the Complexity of Partial Order Properties. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:225-235 [Conf]
  47. Annegret Liebers, Dorothea Wagner, Karsten Weihe
    On the Hardness of Recognizing Bundles in Time Table Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:325-337 [Conf]
  48. Ulrik Brandes, Dorothea Wagner
    A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:1, pp:16-36 [Journal]
  49. Ruth Kuchem, Dorothea Wagner, Frank Wagner
    Optimizing Area for Three-Layer Knock-Knee Channel Routing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:5, pp:495-519 [Journal]
  50. Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:1-2 [Journal]
  51. Dorothea Wagner, Karsten Weihe
    A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:135-150 [Journal]
  52. Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner
    How to draw the minimum cuts of a planar graph. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:2, pp:117-133 [Journal]
  53. Ruth Kuchem, Dorothea Wagner
    Wiring edge-disjoint layouts. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:14, n:4, pp:255-273 [Journal]
  54. Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe
    A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:91-110 [Journal]
  55. Dorothea Wagner, Frank Wagner
    An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:1, pp:73-81 [Journal]
  56. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:85-103 [Journal]
  57. Horst W. Hamacher, Annegret Liebers, Anita Schoebel, Dorothea Wagner, Frank Wagner
    Locating New Stops in a Railway Network. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:50, n:1, pp:- [Journal]
  58. Maria Flavia Mammana, Steffen Mecke, Dorothea Wagner
    The Station Location Problem on Two Intersecting Lines. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:52-64 [Journal]
  59. Dorothea Wagner
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:6, pp:- [Journal]
  60. Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
    Dynamic Shortest Paths Containers. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:65-84 [Journal]
  61. Dorothea Wagner
    Optimal routing through dense chanels. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:269-289 [Journal]
  62. Annegret Liebers, Dorothea Wagner, Karsten Weihe
    On the Hardness of Recognizing Bundles in Time Table Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:467-484 [Journal]
  63. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
    Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:95-110 [Journal]
  64. Annegret Liebers, Dorothea Wagner, Karsten Weihe
    C++ im Nebenfachstudium: Konzepte und Erfahrungen. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1996, v:19, n:5, pp:262-265 [Journal]
  65. Edmund Ihler, Dorothea Wagner, Frank Wagner
    Modeling Hypergraphs by Graphs with the Same Mincut Properties. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:4, pp:171-175 [Journal]
  66. Ulrik Brandes, Dorothea Wagner
    Netzwerkvisualisierung. [Citation Graph (0, 0)][DBLP]
    it - Information Technology, 2004, v:46, n:3, pp:129-134 [Journal]
  67. Dorothea Wagner
    DFG-Schwerpunktprogramm "Algorithmik großer und komplexer Netzwerke". [Citation Graph (0, 0)][DBLP]
    it - Information Technology, 2003, v:45, n:3, pp:162-169 [Journal]
  68. Michael Formann, Dorothea Wagner, Frank Wagner
    Routing through a Dense Channel with Minimum Total Wire Length. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:2, pp:267-283 [Journal]
  69. 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. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:381- [Journal]
  70. Sabine Cornelsen, Dorothea Wagner
    Completely connected clustered graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:313-323 [Journal]
  71. Frank Schulz, Dorothea Wagner, Karsten Weihe
    Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:12- [Journal]
  72. Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm
    Combining speed-up techniques for shortest-path computations. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
  73. Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
    Generating node coordinates for shortest-path computations in transportation networks. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2004, v:9, n:, pp:- [Journal]
  74. Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
    Partitioning graphs to speedup Dijkstra's algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  75. Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
    Geometric containers for efficient shortest-path computation. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
  76. Takao Nishizeki, Roberto Tamassia, Dorothea Wagner
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2001, v:5, n:5, pp:1- [Journal]
  77. Thomas Schank, Dorothea Wagner
    Approximating Clustering Coefficient and Transitivity. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:2, pp:265-275 [Journal]
  78. Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
    Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:99-115 [Journal]
  79. Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm
    Dynamic WWW Structures in 3D. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:183-191 [Journal]
  80. Ulrik Brandes, Dorothea Wagner
    Using Graph Layout to Visualize Train Interconnection Data. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:135-155 [Journal]
  81. Sabine Cornelsen, Thomas Schank, Dorothea Wagner
    Drawing Graphs on Two and Three Lines. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:2, pp:161-177 [Journal]
  82. Ulrik Brandes, Jörg Raab, Dorothea Wagner
    Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections. [Citation Graph (0, 0)][DBLP]
    Journal of Social Structure, 2001, v:2, n:4, pp:- [Journal]
  83. Andreas Schikarski, Dorothea Wagner
    Efficient Parallel Matrix Inversion on Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:34, n:2, pp:196-201 [Journal]
  84. Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner
    On the Complexity of Partial Order Properties. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:2, pp:179-193 [Journal]
  85. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
    The Vertex-Disjoint Menger Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:331-349 [Journal]
  86. Dorothea Wagner, Karsten Weihe
    Editorial: Discrete algorithm engineering. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2000, v:30, n:11, pp:1165- [Journal]
  87. Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
    Wiring Knock-Knee Layouts: A Global Approach. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:5, pp:581-589 [Journal]
  88. Ulrik Brandes, Patrick Kenis, Dorothea Wagner
    Communicating Centrality in Policy Network Drawings. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2003, v:9, n:2, pp:241-253 [Journal]
  89. Marco Gaertler, Robert Görke, Dorothea Wagner
    Significance-Driven Graph Clustering. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:11-26 [Conf]
  90. Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner
    Computing Many-to-Many Shortest Paths Using Highway Hierarchies. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  91. Bastian Katz, Marco Gaertler, Dorothea Wagner
    Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:330-341 [Conf]
  92. Markus Maier, Steffen Mecke, Dorothea Wagner
    Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:410-421 [Conf]
  93. Daniel Delling, Dorothea Wagner
    Landmark-Based Routing in Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:52-65 [Conf]
  94. Dorothea Wagner
    Decomposition of k-ary relations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:81, n:3, pp:303-322 [Journal]
  95. Ulrik Brandes, Marco Gaertler, Dorothea Wagner
    Engineering graph clustering: Models and experimental evaluation. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]
  96. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Efficient models for timetable information in public transportation systems. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]

  97. Engineering Comparators for Graph Clusterings. [Citation Graph (, )][DBLP]


  98. Engineering Label-Constrained Shortest-Path Algorithms. [Citation Graph (, )][DBLP]


  99. Orca Reduction and ContrAction Graph Clustering. [Citation Graph (, )][DBLP]


  100. Synthetic Road Networks. [Citation Graph (, )][DBLP]


  101. Efficient Scheduling of Data-Harvesting Trees. [Citation Graph (, )][DBLP]


  102. Link Scheduling in Local Interference Models. [Citation Graph (, )][DBLP]


  103. Preprocessing Speed-Up Techniques Is Hard. [Citation Graph (, )][DBLP]


  104. 06091 Abstracts Collection -- Data Structures. [Citation Graph (, )][DBLP]


  105. 06091 Executive Summary -- Data Structures. [Citation Graph (, )][DBLP]


  106. Engineering Route Planning Algorithms. [Citation Graph (, )][DBLP]


  107. Group-Level Analysis and Visualization of Social Networks. [Citation Graph (, )][DBLP]


  108. Accelerating Multi-modal Route Planning by Access-Nodes. [Citation Graph (, )][DBLP]


  109. LunarVis - Analytic Visualizations of Large Graphs. [Citation Graph (, )][DBLP]


  110. Minimizing the Area for Planar Straight-Line Grid Drawings. [Citation Graph (, )][DBLP]


  111. Computing Large Matchings in Planar Graphs with Fixed Minimum Degree. [Citation Graph (, )][DBLP]


  112. The Shortcut Problem - Complexity and Approximation. [Citation Graph (, )][DBLP]


  113. Dynamic Graph Clustering Using Minimum-Cut Trees. [Citation Graph (, )][DBLP]


  114. Pareto Paths with SHARC. [Citation Graph (, )][DBLP]


  115. Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. [Citation Graph (, )][DBLP]


  116. Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study. [Citation Graph (, )][DBLP]


  117. Space-Efficient SHARC-Routing. [Citation Graph (, )][DBLP]


  118. Gateway Decompositions for Constrained Reachability Problems. [Citation Graph (, )][DBLP]


  119. Modularity-Driven Clustering of Dynamic Graphs. [Citation Graph (, )][DBLP]


  120. On Finding Graph Clusterings with Maximum Modularity. [Citation Graph (, )][DBLP]


  121. Energy efficient scheduling with power control for wireless networks. [Citation Graph (, )][DBLP]


  122. Experimental Study on Speed-Up Techniques for Timetable Information Systems. [Citation Graph (, )][DBLP]


  123. Station Location - Complexity and Approximation. [Citation Graph (, )][DBLP]


  124. Engineering Time-Expanded Graphs for Faster Timetable Information. [Citation Graph (, )][DBLP]


  125. Timetable Information: Models and Algorithms. [Citation Graph (, )][DBLP]


  126. Efficient Route Planning in Flight Networks. [Citation Graph (, )][DBLP]


  127. A generalization of the zero-one principle for sorting algorithms. [Citation Graph (, )][DBLP]


Search in 0.147secs, Finished in 0.153secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002