Go to the corresponding LIPIcs Volume Portal 
Black, Mitchell ; Blaser, Nello ; Nayyeri, Amir ; Vågset, Erlend Raa
pdfformat: 

@InProceedings{black_et_al:LIPIcs.SoCG.2022.17, author = {Black, Mitchell and Blaser, Nello and Nayyeri, Amir and V\r{a}gset, Erlend Raa}, title = {{ETHTight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {17:117:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772273}, ISSN = {18688969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16025}, URN = {urn:nbn:de:0030drops160253}, doi = {10.4230/LIPIcs.SoCG.2022.17}, annote = {Keywords: Computational Geometry, Surface Recognition, Treewidth, Hasse Diagram, Simplicial Complexes, LowDimensional Topology, Parameterized Complexity, Computational Complexity} }
Keywords:  Computational Geometry, Surface Recognition, Treewidth, Hasse Diagram, Simplicial Complexes, LowDimensional Topology, Parameterized Complexity, Computational Complexity  
Collection:  38th International Symposium on Computational Geometry (SoCG 2022)  
Issue Date:  2022  
Date of publication:  01.06.2022 