@InProceedings{burton_et_al:LIPIcs.STACS.2017.18,
  author =	{Burton, Benjamin and Cabello, Sergio and Kratsch, Stefan and Pettersson, William},
  title =	{{The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex}},
  booktitle =	{34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages =	{18:1--18:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-028-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{66},
  editor =	{Vollmer, Heribert and Vall\'{e}e, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.18},
  URN =		{urn:nbn:de:0030-drops-70156},
  doi =		{10.4230/LIPIcs.STACS.2017.18},
  annote =	{Keywords: computational topology, parameterized complexity, simplicial complex}
}