Who Needs Crossings? Hardness of Plane Graph Rigidity

neboat@mit.edu's picture
TitleWho Needs Crossings? Hardness of Plane Graph Rigidity
Publication TypeConference Paper
Year of Publication2016
AuthorsAbel, Zachary, Demaine Erik D., Demaine Martin L., Eisenstat Sarah, Lynch Jayson, and Schardl Tao B.
Conference NameSoCG 2016: 32nd International Symposium on Computational Geometry
PublisherSchloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Conference LocationDagstuhl, Germany
ISBN Number978-3-95977-009-5
URLhttp://drops.dagstuhl.de/opus/volltexte/2016/5895
DOI10.4230/LIPIcs.SoCG.2016.3
Citation KeyAbelDeDe16