Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
WADS
/
Paper
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.
Svante Carlsson
,
Hkan Jonsson
Venue
B
WADS
Year
1995
Proceedings
WADS
DBLP record
conf/wads/CarlssonJ95 ↗
Browse the full
WADS paper archive
.