Thomas Willhalm

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Reconstructing the topology of a CAD model -- a discrete approach Algorithms — ESA '97	2021-12-20	Paper
Dynamic shortest paths containers	2013-09-09	Paper
Geometric speed-up techniques for finding shortest paths in large sparse graphs Lecture Notes in Computer Science	2010-03-03	Paper
Partitioning graphs to speedup Dijkstra's algorithm ACM Journal of Experimental Algorithmics	2008-06-20	Paper
Combining speed-up techniques for shortest-path computations ACM Journal of Experimental Algorithmics	2008-06-20	Paper
Speed-Up Techniques for Shortest-Path Computations STACS 2007	2007-09-03	Paper
Geometric containers for efficient shortest-path computation ACM Journal of Experimental Algorithmics	2006-01-16	Paper
Experimental and Efficient Algorithms Lecture Notes in Computer Science	2005-11-30	Paper
Generating node coordinates for shortest-path computations in transportation networks ACM Journal of Experimental Algorithmics	2005-08-04	Paper
scientific article; zbMATH DE number 1893565 (Why is no real title available?)	2003-04-07	Paper
scientific article; zbMATH DE number 1693475 (Why is no real title available?)	2002-01-22	Paper
Dynamic WWW Structures in 3D Journal of Graph Algorithms and Applications	2000-12-14	Paper
Dynamic WWW Structures in 3D Journal of Graph Algorithms and Applications	2000-12-14	Paper
Reconstructing the topology of a CAD model -- a discrete approach Algorithmica	2000-12-05	Paper

Research outcomes over time

This page was built for person: Thomas Willhalm