%0 Conference Paper %1 conf/mfcs/FominGK13 %A Fomin, Fedor V. %A Golovach, Petr A. %A Korhonen, Janne H. %B MFCS %D 2013 %E Chatterjee, Krishnendu %E Sgall, Jirí %I Springer %K dblp %P 421-432 %T On the Parameterized Complexity of Cutting a Few Vertices from a Graph. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2013.html#FominGK13 %V 8087 %@ 978-3-642-40312-5

@inproceedings{conf/mfcs/FominGK13, added-at = {2019-06-02T00:00:00.000+0200}, author = {Fomin, Fedor V. and Golovach, Petr A. and Korhonen, Janne H.}, biburl = {https://www.bibsonomy.org/bibtex/2f9db9cedc82b872e1595c518b3d134a4/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/2013}, editor = {Chatterjee, Krishnendu and Sgall, Jirí}, ee = {https://www.wikidata.org/entity/Q60488435}, interhash = {4dd2445acaad42da1ce6e5aaf9e09034}, intrahash = {f9db9cedc82b872e1595c518b3d134a4}, isbn = {978-3-642-40312-5}, keywords = {dblp}, pages = {421-432}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-06-04T13:09:36.000+0200}, title = {On the Parameterized Complexity of Cutting a Few Vertices from a Graph.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2013.html#FominGK13}, volume = 8087, year = 2013 }