Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl. Who Needs Crossings? Hardness of Plane Graph Rigidity. In Sándor P. Fekete, Anna Lubiw, editors, 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA. Volume 51 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{AbelDDELS16,
title = {Who Needs Crossings? Hardness of Plane Graph Rigidity},
author = {Zachary Abel and Erik D. Demaine and Martin L. Demaine and Sarah Eisenstat and Jayson Lynch and Tao B. Schardl},
year = {2016},
doi = {10.4230/LIPIcs.SoCG.2016.3},
url = {http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.3},
researchr = {https://researchr.org/publication/AbelDDELS16},
cites = {0},
citedby = {0},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA},
editor = {Sándor P. Fekete and Anna Lubiw},
volume = {51},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-009-5},
}