Thomas Willhalm

Available identifiers

zbMath Open willhalm.thomasMaRDI QIDQ826121

List of research outcomes

Publication	Date of Publication	Type
Reconstructing the topology of a CAD model -- a discrete approach	2021-12-20	Paper
Dynamic shortest paths containers	2013-09-09	Paper
Geometric speed-up techniques for finding shortest paths in large sparse graphs	2010-03-03	Paper
Partitioning graphs to speedup Dijkstra's algorithm	2008-06-20	Paper
Combining speed-up techniques for shortest-path computations	2008-06-20	Paper
Speed-Up Techniques for Shortest-Path Computations	2007-09-03	Paper
Geometric containers for efficient shortest-path computation	2006-01-16	Paper
Experimental and Efficient Algorithms	2005-11-30	Paper
Generating node coordinates for shortest-path computations in transportation networks	2005-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4801186	2003-04-07	Paper
https://portal.mardi4nfdi.de/entity/Q2764046	2002-01-22	Paper
Dynamic WWW Structures in 3D	2000-12-14	Paper
Reconstructing the topology of a CAD model -- a discrete approach	2000-12-05	Paper

Research outcomes over time

This page was built for person: Thomas Willhalm