%0 Conference Paper %1 conf/stacs/MarxP14 %A Marx, Dániel %A Pilipczuk, Michal %B STACS %D 2014 %E Mayr, Ernst W. %E Portier, Natacha %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 542-553 %T Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). %U http://dblp.uni-trier.de/db/conf/stacs/stacs2014.html#MarxP14 %V 25 %@ 978-3-939897-65-1

@inproceedings{conf/stacs/MarxP14, added-at = {2019-10-19T00:00:00.000+0200}, author = {Marx, Dániel and Pilipczuk, Michal}, biburl = {https://www.bibsonomy.org/bibtex/2ffd22087f3865034999adf89549da9a5/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2014}, editor = {Mayr, Ernst W. and Portier, Natacha}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2014.542}, interhash = {29fc4d85174f404471ef290a01177b8e}, intrahash = {ffd22087f3865034999adf89549da9a5}, isbn = {978-3-939897-65-1}, keywords = {dblp}, pages = {542-553}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:48:21.000+0100}, title = {Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2014.html#MarxP14}, volume = 25, year = 2014 }