pdfformat: 

@InProceedings{burton_et_al:LIPIcs:2017:7015, author = {Benjamin Burton and Sergio Cabello and Stefan Kratsch and William Pettersson}, title = {{The Parameterized Complexity of Finding a 2Sphere in a Simplicial Complex}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {18:118:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770286}, ISSN = {18688969}, year = {2017}, volume = {66}, editor = {Heribert Vollmer and Brigitte Vallée}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7015}, URN = {urn:nbn:de:0030drops70156}, doi = {10.4230/LIPIcs.STACS.2017.18}, annote = {Keywords: computational topology, parameterized complexity, simplicial complex} }
Keywords:  computational topology, parameterized complexity, simplicial complex  
Seminar:  34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)  
Issue date:  2017  
Date of publication:  2017 