STACS 2005
From MaRDI portal
Publication:5710703
DOI10.1007/b106485zbMath1118.68701OpenAlexW4230940848MaRDI QIDQ5710703
Giri Narasimhan, Joachim Gudmundsson, Michiel H. M. Smid
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Truly Optimal Euclidean Spanners ⋮ Approximate distance oracles for graphs with dense clusters ⋮ Light Euclidean Spanners with Steiner Points ⋮ Shortest-Path Queries in Geometric Networks ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
This page was built for publication: STACS 2005
