Nadia M. Benbernou
Massachusetts Institute of Technology
Department of Mathematics
Computer Science and Artificial Intelligence Laboratory (CSAIL)
32 Vassar St, Room 32-G614
Cambridge, MA USA 02139
nbenbern "at" mit "dot" edu
I am fifth year Ph.D. student in Applied Mathematics at MIT. My advisor is Erik Demaine, who is in the Theory of Computation group of the Computer Science and Artificial Intelligence Laboratory (CSAIL). My research is in discrete and computational geometry, specifically in the area of geometric folding algorithms.
Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Vida Dujmović, Robin Flatland, Ferran Hurtado, John Iacono, Anna Lubiw,
Pat Morin, Vera Sacristán, Diane Souvaine, and Ryuhei Uehara.
Coverage with k-Transmitters in the Presence of Obstacles.
Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010), Hawaii, USA, December 18-20, 2010.
Gill Barequet, Nadia Benbernou, David Charlton, Erik Demaine, Martin Demaine, Anna Lubiw, Andre Schulz, Diane L. Souvaine, Godfried T. Toussaint, and Andrew Winslow.
Bounded-Degree Polyhedronization of Point Sets. 22nd Canadian Conference on Computational Geometry, Winnipeg, Manitoba, August 9-11, 2010.
Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, and Aviv Ovadya, "Universal Hinge Patterns to Fold Orthogonal Shapes", in Abstracts from the 5th International Conference on Origami in Science, Mathematics and Education (OSME 2010), Singapore, July 13-17, 2010, to appear.
Full paper at arXiv:0909.5388v1 .
E.Hawkes, B. An, N. M. Benbernou, H. Tanaka, S. Kim, E. Demaine, D. Rus, and R. J. Wood. Programmable matter by folding.
Proceedings of the National Academy of Sciences of the United States of America, volume 107, number 28, 2010.
Zachary Abel, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Flatland, Scott Kominers, and Robert Schweller. "Shape Replication Through Self-Assembly and RNase Enzymes." Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010) , Austin, Texas, January 17-19, 2010.
Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Robin Flatland, John Iacono, and Stefanie Wuhrer. "Efficient Reconfiguration of Lattice-Based Modular Robots," in Proceedings of the 4th European Conference on Mobile Robots (ECMR 2009) , Croatia, September 23-25, 2009.
- Brad Ballinger, Nadia Benbernou, Francisco Gomez, Godfried Toussaint, and Joseph O’Rourke. “The Continuous Hexachordal Theorem.” Internat. Conf. on Mathematics and Computation in Music (MCM 2009) , June 2009.
- Nadia M. Benbernou, Mashhood Ishaque, and Diane L. Souvaine. "Data Structures for Restricted Triangular Range Searching," 20th Canadian Conference on Computational Geometry, 2008, Montréal, Canada.
- Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, and Benjamin Rossman. "Coin-Flipping Magic." Manuscript, April 2008. Presented at Gathering for Gardner 8.
- Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, and Csaba D. Tóth. "Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs", Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007), Ottawa, Ontario, Canada, August 20, 2007, pages 13–16.
- Nadia Benbernou, Joseph O'Rourke. On the Maximum Span of Fixed-Angle Chains. 18th Canadian Conference on Computational Geometry, Kingston, August, 2006. Submitted for journal publication, Jan. 2007.
- Nadia Benbernou. "Fixed-Angle Polygonal Chains: Locked Chains and19, 2010, to appear. the Maximum Span." Submitted to the Dept of Mathematics and Statistics of Smith College in partial fulfillment of the requirements for the degree of Bachelor of the Arts with Honors. Joseph O'Rourke, faculty advisor. May 15, 2006.
- Nadia Benbernou, Patricia Cahn, J. O'Rourke. "Unfolding Smooth Prismtaoids." Smith College Computer Science Technical Report 078, July 2004.