Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.
Radu Curticapean
,
Dniel Marx
Venue
A*
FOCS
Year
2014
Proceedings
FOCS
DBLP record
conf/focs/CurticapeanM14 ↗
Browse the full
FOCS paper archive
.