Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Parameterized Complexity of Connected Even/Odd Subgraph Problems.
Fedor V. Fomin
,
Petr A. Golovach
Venue
A
STACS
Year
2012
Proceedings
STACS
DBLP record
conf/stacs/FominG12 ↗
Browse the full
STACS paper archive
.