Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson. The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. In Heribert Vollmer, Brigitte Vallée, editors, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany. Volume 66 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{BurtonCKP17, title = {The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex}, author = {Benjamin A. Burton and Sergio Cabello and Stefan Kratsch and William Pettersson}, year = {2017}, doi = {10.4230/LIPIcs.STACS.2017.18}, url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2017.18}, researchr = {https://researchr.org/publication/BurtonCKP17}, cites = {0}, citedby = {0}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany}, editor = {Heribert Vollmer and Brigitte Vallée}, volume = {66}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-95977-028-6}, }