@InProceedings{marx_et_al:LIPIcs.STACS.2014.542,
  author =	{Marx, D\'{a}niel and Pilipczuk, Michal},
  title =	{{Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)}},
  booktitle =	{31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
  pages =	{542--553},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-65-1},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{25},
  editor =	{Mayr, Ernst W. and Portier, Natacha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.542},
  URN =		{urn:nbn:de:0030-drops-44863},
  doi =		{10.4230/LIPIcs.STACS.2014.542},
  annote =	{Keywords: parameterized complexity, subgraph isomorphism}
}