Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
On universally easy classes for NP-complete problems.
Erik D. Demaine
,
Alejandro Lpez-Ortiz
,
J. Ian Munro
Venue
A*
SODA
Year
2001
Proceedings
SODA
DBLP record
conf/soda/DemaineLM01 ↗
Browse the full
SODA paper archive
.