Dania El-Khechen

According to our database, Dania El-Khechen authored at least 6 papers between 2006 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Packing 2×2 unit squares into grid polygons is NP-complete.

Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.

Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Dania El-Khechen, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer

Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Partitioning a Polygon into Two Mirror Congruent Pieces.

Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

On Rolling Cube Puzzles.

Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n.

Dania El-Khechen, Thomas Fevens, John Iacono

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Curves in the Sand: Algorithmic Drawing.

Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006