Martin Tancer. Recognition of Collapsible Complexes is NP-Complete. Discrete & Computational Geometry, 55(1):21-38, 2016. [doi]
@article{Tancer16,
title = {Recognition of Collapsible Complexes is NP-Complete},
author = {Martin Tancer},
year = {2016},
doi = {10.1007/s00454-015-9747-1},
url = {http://dx.doi.org/10.1007/s00454-015-9747-1},
researchr = {https://researchr.org/publication/Tancer16},
cites = {0},
citedby = {0},
journal = {Discrete & Computational Geometry},
volume = {55},
number = {1},
pages = {21-38},
}