| 2007 |
|---|
| 18 | EE | Dorothea Wagner,
Thomas Willhalm:
Speed-Up Techniques for Shortest-Path Computations.
STACS 2007: 23-36 |
| 2006 |
|---|
| 17 | EE | Rolf H. Möhring,
Heiko Schilling,
Birk Schütz,
Dorothea Wagner,
Thomas Willhalm:
Partitioning graphs to speedup Dijkstra's algorithm.
ACM Journal of Experimental Algorithms 11: (2006) |
| 2005 |
|---|
| 16 | EE | Dorothea Wagner,
Thomas Willhalm:
Drawing Graphs to Speed Up Shortest-Path Computations.
ALENEX/ANALCO 2005: 17-25 |
| 15 | EE | 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 |
| 14 | EE | Martin Holzer,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Combining speed-up techniques for shortest-path computations.
ACM Journal of Experimental Algorithms 10: (2005) |
| 13 | EE | Dorothea Wagner,
Thomas Willhalm,
Christos D. Zaroliagis:
Geometric containers for efficient shortest-path computation.
ACM Journal of Experimental Algorithms 10: (2005) |
| 2004 |
|---|
| 12 | EE | Martin Holzer,
Frank Schulz,
Thomas Willhalm:
Combining Speed-Up Techniques for Shortest-Path Computations.
WEA 2004: 269-284 |
| 11 | EE | Ulrik Brandes,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Generating node coordinates for shortest-path computations in transportation networks.
ACM Journal of Experimental Algorithms 9: (2004) |
| 10 | EE | Dorothea Wagner,
Thomas Willhalm,
Christos D. Zaroliagis:
Dynamic Shortest Paths Containers.
Electr. Notes Theor. Comput. Sci. 92: 65-84 (2004) |
| 2003 |
|---|
| 9 | EE | Dorothea Wagner,
Thomas Willhalm:
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
ESA 2003: 776-787 |
| 8 | EE | Stefan Edelkamp,
Shahid Jabbar,
Thomas Willhalm:
Accelerating Heuristic Search in Spatial Domains.
PuK 2003 |
| 2001 |
|---|
| 7 | EE | Ulrik Brandes,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Travel Planning with Self-Made Maps.
ALENEX 2001: 132-144 |
| 2000 |
|---|
| 6 | EE | Karsten Weihe,
Thomas Willhalm:
Reconstructing the Topology of a CAD Model - a Discrete Approach.
Algorithmica 26(1): 126-147 (2000) |
| 5 | EE | 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) |
| 1999 |
|---|
| 4 | EE | Thomas Willhalm:
Software Packages.
Drawing Graphs 1999: 274-282 |
| 3 | EE | 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 |
| 1998 |
|---|
| 2 | | Karsten Weihe,
Thomas Willhalm:
Why CAD Data Repair Requires Discrete Algorithmic Techniques.
Algorithm Engineering 1998: 1-12 |
| 1997 |
|---|
| 1 | | Karsten Weihe,
Thomas Willhalm:
Reconstructing the Topology of a CAD Model: A Discrete Approach.
ESA 1997: 500-513 |
