Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
Dniel Marx
,
Michal Pilipczuk
Venue
A
STACS
Year
2014
Proceedings
STACS
DBLP record
conf/stacs/MarxP14 ↗
Browse the full
STACS paper archive
.