Who Needs Crossings? Hardness of Plane Graph Rigidity

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]

Authors

Zachary Abel

This author has not been identified. Look up 'Zachary Abel' in Google

Erik D. Demaine

This author has not been identified. Look up 'Erik D. Demaine' in Google

Martin L. Demaine

This author has not been identified. Look up 'Martin L. Demaine' in Google

Sarah Eisenstat

This author has not been identified. Look up 'Sarah Eisenstat' in Google

Jayson Lynch

This author has not been identified. Look up 'Jayson Lynch' in Google

Tao B. Schardl

This author has not been identified. Look up 'Tao B. Schardl' in Google