Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
MFCS
/
Paper
On the Parameterized Complexity of Cutting a Few Vertices from a Graph.
Fedor V. Fomin
,
Petr A. Golovach
,
Janne H. Korhonen
Venue
B
MFCS
Year
2013
Proceedings
MFCS
DBLP record
conf/mfcs/FominGK13 ↗
Browse the full
MFCS paper archive
.