Search the dblp DataBase
Thomas Willhalm: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- 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] - Dorothea Wagner, Thomas Willhalm
Drawing Graphs to Speed Up Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
ALENEX/ANALCO, 2005, pp:17-25 [Conf] - 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] - Thomas Willhalm
Software Packages. [Citation Graph (0, 0)][DBLP]
Drawing Graphs, 1999, pp:274-282 [Conf] - 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] - Karsten Weihe, Thomas Willhalm
Reconstructing the Topology of a CAD Model: A Discrete Approach. [Citation Graph (0, 0)][DBLP]
ESA, 1997, pp:500-513 [Conf] - Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
Accelerating Heuristic Search in Spatial Domains. [Citation Graph (0, 0)][DBLP]
PuK, 2003, pp:- [Conf] - Dorothea Wagner, Thomas Willhalm
Speed-Up Techniques for Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
STACS, 2007, pp:23-36 [Conf] - Karsten Weihe, Thomas Willhalm
Why CAD Data Repair Requires Discrete Algorithmic Techniques. [Citation Graph (0, 0)][DBLP]
Algorithm Engineering, 1998, pp:1-12 [Conf] - Martin Holzer, Frank Schulz, Thomas Willhalm
Combining Speed-Up Techniques for Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
WEA, 2004, pp:269-284 [Conf] - 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] - Karsten Weihe, Thomas Willhalm
Reconstructing the Topology of a CAD Model - a Discrete Approach. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2000, v:26, n:1, pp:126-147 [Journal] - 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] - 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] - 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] - 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] - 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] - 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]
Search in 0.002secs, Finished in 0.002secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002