Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon.
Hristo N. Djidjev
,
Andrzej Lingas
,
Jrg-Rdiger Sack
Venue
A
STACS
Year
1989
Proceedings
STACS
DBLP record
conf/stacs/DjidjevLS89 ↗
Browse the full
STACS paper archive
.