@InProceedings{abel_et_al:LIPIcs.SoCG.2016.3,
author = {Abel, Zachary and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Lynch, Jayson and Schardl, Tao B.},
title = {{Who Needs Crossings? Hardness of Plane Graph Rigidity}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.3},
URN = {urn:nbn:de:0030-drops-58951},
doi = {10.4230/LIPIcs.SoCG.2016.3},
annote = {Keywords: Graph Drawing, Graph Rigidity Theory, Graph Global Rigidity, Linkages, Complexity Theory, Computational Geometry}
}