Publications
Who Needs Crossings? Hardness of Plane Graph Rigidity,
, SoCG 2016: 32nd International Symposium on Computational Geometry, Dagstuhl, Germany, (2016)
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard,
, Journal of Information Processing, Volume 21, Issue 3, p.368 - 377, (2013)
Folding Equilateral Plane Graphs,
, International Journal of Computational Geometry & Applications, 04/2013, Volume 23, Issue 2, p.75 - 92, (2013)
Folding Equilateral Plane Graphs,
, ISAAC '11: Proceedings of the 22nd International Symposium on Algorithms and Computation, Berlin, Heidelberg, (2011)