Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LATIN
/
Paper
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three.
Hanno Lefmann
,
Niels Schmitt
Venue
B
LATIN
Year
2002
Proceedings
LATIN
DBLP record
conf/latin/LefmannS02 ↗
Browse the full
LATIN paper archive
.