Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
GD
/
Paper
Computing Geometric Minimum-Dilation Graphs Is NP-Hard.
Rolf Klein
,
Martin Kutz
Venue
A
GD
Year
2006
Proceedings
GD
DBLP record
conf/gd/KleinK06 ↗
Browse the full
GD paper archive
.