Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
Explicit Inapproximability Bounds for the Shortest Superstring Problem.
Virginia Vassilevska
Venue
B
MFCS
Year
2005
Proceedings
MFCS
DBLP record
conf/mfcs/Vassilevska05 ↗
Browse the full
MFCS paper archive
.