Publications
Journal Papers
- Mirela Damian and Naresh Nelavalli. Improved Bounds on the Stretch Factor of Y_{4}. In Computational Geometry Theory and Applications, 62(1):14-24, 2017.
- Michiel Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari and Yuyang Liu. On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. In Computational Geometry Theory and Applications, 7(1):444-472, 2016.
- Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot and Ge Xia. New and Improved Spanning Ratios for Yao Graphs. In Computational Geometry Theory and Applications, 6(2):19-53, 2015.
- Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Flatland, Matthew Katz, and Anil Maheshwari. Switching to directional antennas with constant increase in radius and hop distance. Algorithmica, 69(2):397-409, 2014.
- Mirela Damian, Erik Demaine and Robin Flatland. Unfolding orthogonal polyhedra with quadratic refinement: The delta-unfolding algorithm. Graphs and Combinatorics, 30(1):125-140, 2014.
- Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Robin Flatland, John Iacono, and Stefanie Wuhrer. Efficient reconfiguration of lattice-based modular robots. Journal of Computational Geometry, 46(8):917-928, 2013.
- Mirela Damian and Robin Flatland. Spanning properties of graphs induced by directional antennas. Discrete Mathematics, Algorithms and Applications, 5(3):1-16, 2013.
- Greg Aloupis, Mirela Damian, Robin Flatland, Matias Korman, Özgür Özkan, David Rappaport and Stefanie Wuhrer. Establishing strong connectivity using optimal radius half-disk antennas. Computational Geometry Theory and Applications 46(3):328-339, 2013.
- Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik Demaine, 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. Journal of Combinatorial Optimization, 25(2):208-233, 2013.
- Mirela Damian and Kristin Raudonis. Yao graphs span Theta graphs. Discrete Mathematics, Algorithms and Applications, 4(2):181-194, 2012.
- Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid and Stefanie Wührer. Pi/2-angle Yao graphs are spanners. International Journal of Computational Geometry and Applications, 22(1):61-82, 2012.
- Greg Aloupis, Sébastien Collette, Mirela Damian, Erik Demaine, Robin Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán and Stefanie Wuhrer. Effcient constant-velocity reconfiguration of crystalline robots. Robotica, 29(1):59-71, 2011.
- Mirela Damian, Robin Flatland, Joseph O'Rourke and Suneeta Ramaswami. Connecting polygonizations via stretches and twangs. Theory of Computing Systems, 47(3):674-695, 2010.
- Mirela Damian and Sriram Pemmaraju. Localized spanners for wireless networks. Ad Hoc and Sensor Wireless Networks, 9(3-4):305-328, April 2010.
- Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán and Stefanie Wuhrer. Linear reconfiguration of cube-style modular robots. Computational Geometry Theory and Applications, 42(6-7):652-663, August 2009.
- Mirela Damian and Nagesh Javali. Distributed construction of low-interference spanners. Distributed Computing, 22(1):15-28, April 2009.
- Mirela Damian, Robin Flatland and Joseph O'Rourke. Unfolding Manhattan towers. Computational Geometry Theory and Applications, 40(2):102-114, July 2008.
- Mirela Damian, Robin Flatland and Joseph O'Rourke. Grid vertex-unfolding orthogonal polyhedra. Discrete & Computational Geometry, 39(1-3):213-238, March 2008.
- Mirela Damian and Joseph O'Rourke. On corners of objects built from parallelepiped bricks. Computational Geometry Theory and Applications, 39(1):43-54, January 2008.
- Mirela Damian, Robin Flatland and Joseph O'Rourke. Epsilon-unfolding orthogonal polyhedra. Graphs and Combinatorics, 23(Suppl 1):179-194, June 2007.
- Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane Souvaine and Godfried Toussaint. Efficient many-to-many point matching in one dimension. Graphs and Combinatorics, 23(1):169-178, June 2007.
- Mirela Damian and Sriram V. Pemmaraju. APX-hardness of domination problems in circle graphs. Information Processing Letters, 97(6):231-237, March 2006.
- Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami and Godfried T. Toussaint. An O(n log n)-time algorithm for the restriction scaffold assignment problem. Journal of Computational Biology, 13(4):979-989, January 2006.
- Mirela Damian and Sriram V. Pemmaraju. Computing optimal diameter-bounded polygon partitions. Algorithmica, 40(1):1-14, September 2004.
- Mirela Damian. Exact and approximation algorithms for computing optimal fat decompositions. Computational Geometry Theory and Applications, 28(1):19-27, May 2004.
- Valeriu Damian, Adrian Sandu, Mirela Damian, Gregory R. Carmichael and Florian A. Potra. The Kine\tic PreProcessor KPP: Software environment for solving chemical kinetics. Journal of Computers and Chemical Engineering, 26(11):1567-1579, November 2002.
- Mirela Damian and Sriram V. Pemmaraju. A (2+e)-approximation scheme for minimum domination on circle graphs. Journal of Algorithms, 42(2):255-276, February 2002.
- Gregory R. Carmichael, Valeriu Damian, Florian A. Potra, Adrian Sandu and Mirela Damian. The current state and the future directions in air quality modeling. Journal of Systems Analysis Modeling and Simulation, 25(1):75-105, 1997.
Conference Papers
- Brad Ballinger, Mirela Damian, David Eppstein, Robin Flatland, Jessica Ginepro and Thomas Hull. Minimum Forcing Sets for Miura Folding Patterns. In Proc. of the 26th ACM-SIAM Symposium on Discrete Algorithms, SODA'15, pages 136-147, San Diego, California, January 4-6, 2015.
- Mirela Damian and Dumitru V. Voicu. Spanning Properties of Theta-Theta Graphs. In Proc. of the 8th Int. Conference on Combinatorial Optimization and Applications, COCOA'14, LNCS 8881, pages 216-230, Wailea, Maui, HI, December 19-21, 2014.
- Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian and Sander Verdonschot. Continuous Yao Graphs. In online proceedings of the 26th Canadian Conference on Computational Geometry, CCCG'14, Halifax, Nova Scotia, August 11-13, 2014
- Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot and Ge Xia. New and Improved Spanning Ratios for Yao Graphs. In Proc. of the 30th Symposium on Computational Geometry, SoCG'14, Kyoto, Japan, June 2014.
- Mirela Damian, Erik Demaine and Robin Flatland. Unfolding Orthogrids with Constant Refinement. In Proc. of the 23rd Fall Workshop in Computational Geometry, FWCG'13, New York, NY, October 25-26, 2013.
- Matthew S. Bauer and Mirela Damian. An Infinite Class of Sparse-Yao Spanners. In Proc. of the 24th ACM-SIAM Symposium on Discrete Algorithms, SODA'13, pages 184-196, New Orleans, Louisiana, January 6-8, 2013.
- Matthew S. Bauer and Mirela Damian. Some sparse Yao graphs are spanners. In Proc. of the 28th European Workshop on Computational Geometry, EuroCG'12, pages 229-232, Assisi, Perugia, Italy, March 19-21, 2012.
- Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgur Özkan, David Rappaport and Stefanie Wuhrer. Establishing strong connectivity using optimal radius half-disk antennas. In Proc. of the 23rd Canadian Conference on Computational Geometry, CCCG'11, pages 361-366, August 2011.
- Mirela Damian, Robin Flatland, Matthew Katz, Prosenjit Bose, Paz Carmi and Anil Maheshwari. Switching to directional antennas with constant increase in radius and hop distance. In Proc. of the 12th Int. Conf. on Algorithms and Data Structures, WADS'11, pages 134-146, Berlin, Heidelberg, August 15-27, 2011.
- Mirela Damian and Abhaykumar Kumbhar. Undirected connectivity of sparse Yao graphs. In Proc. of the 7th ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing, FOMC'11, pages 25-32, June 9-11, 2011.
- Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid and Stefanie Wuhrer. Pi/2-angle Yao graphs are spanners. In Proc. of the 21st International Symposium on Algorithms and Computation, volume 6507 of ISAAC'10, pages 446-457, 2010.
- Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik Demaine, 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. In Proc. of the 4th International Conference on Combinatorial Optimization and Applications, COCOA'10, pages 1-15, Berlin, Heidelberg, December 2010.
- Mirela Damian and Kristin Raudonis. Yao graphs span Theta graphs. In Proc. of the 4th International Conference on Combinatorial Optimization and Applications, COCOA'10, pages 181-194, Berlin, Heidelberg, December 2010.
- Mirela Damian and Robin Flatland. Spanning properties of graphs induced by directional antennas. In Electronic Proc. of the 20th Annual Workshop on Computational Geometry, FWCG'10, October 29-10, 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. In Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'10, pages 1045-1064, Austin, Texas, January 2010.
- Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik Demaine, Robin Flatland, John Iacono and Stefanie Wuhrer. Effcient reconfiguration of lattice-based modular robots. In Proc. of the 4th European Conference on Mobile Robots, ECMR'09, pages 81-86, Mlini/Dubrovnik, Croatia, September 2009.
- Mirela Damian, Nawar Molla and Val Pinciu. Spanner properties of pi/2-angle yao graphs. In Proc. of the 25th European Workshop on Computational Geometry, EuroCG'09, pages 21-24, March 2009.
- Greg Aloupis, Sebastien Collette, Mirela Damian, Erik D. Demaine, Dania El-Khechen, Robin Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán and Stefanie Wuhrer. Realistic reconfiguration of Crystalline (and Telecube) robots. In Proc. of the 8th International Workshop on the Algorithmic Foundations of Robotics, WAFR'08, pages 433-447, December 2008.
- Mirela Damian, Robin Flatland, Joseph O'Rourke and Suneeta Ramaswani. Connecting polygonizations via stretches and twangs. In Proc. of the 25th International Symposium on Theoretical Aspects of Computer Science, volume 1 of STACS'08, pages 217-228, Dagstuhl, Germany, 2008.
- Mirela Damian and Nagesh Javali. Distributed construction of bounded-degree low-interference spanners of low weight. In Proc. of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'08, pages 101-110, New York, NY, USA, 2008.
- Mirela Damian. A simple Yao-Yao-based spanner of bounded degree. Online, http://arxiv.org/abs/0802.4325v2, 2008.
- Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristán and Stefanie Wuhrer. Linear reconfiguration of cubestyle modular robots. In Proc. of the 18th International Symposium of Algorithms and Computation, SAAC'07, pages 208-219, December 2007.
- Mirela Damian, Robin Flatland, Joseph O'Rourke and Suneeta Ramaswami. A new lower bound on guard placement for wireless localization. In Proc. of the 17th Fall Workshop on Computational Geometry, FWCG'07, pages 21-24, November 2007.
- Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik Demaine, Martin Demaine, Robin Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian and Godfried Toussaint. Vertex pops and popturns. In Proc. of the 19th Canadian Conference on Computational Geometry, CCCG'07, pages 137-140, August 2007.
- Mirela Damian, Erik D Demaine, Martin L Demaine, Vida Dujmović, Dania El-Khechen, Robin Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L Souvaine, Perouz Taslakian and Godfried T Toussaint. Curves in the sand: Algorithmic drawing. In Proc. of the 18th Canadian Conference on Computational Geometry, CCCG'06, pages 11-14, Kingston, ON, Canada, August 2006.
- Mirela Damian, Saurav Pandit and Sriram Pemmaraju. Local approximation schemes for topology control. In Proc. of the 25th Annual ACM Symposium on Principles of Distributed Computing, PODC'06, pages 208-217, New York, NY, USA, July 2006.
- Mirela Damian, Saurav Pandit and Sriram Pemmaraju. Distributed spanner construction in doubling metric spaces. In Proc. of the 10th International Conference on Principles of Distributed Computing, OPODIS'06, pages 157-171, 2006.
- Mirela Damian, Robin Flatland and Joseph O'Rourke. Grid vertex-unfolding orthogonal polyhedra. In Proc. of the 23rd Symposium on Theoretical Aspects of Computer Science, STACS'06, pages 264{276, Berlin, Heidelberg, March 2006.
- Mirela Damian, Robin Flatland, Henk Meijer and Joseph O'Rourke. Unfolding well-separated orthotrees. In Proc. of the 15th Annual Fall Workshop on Computational Geometry and Visualization, FWCG'05, pages 25-26, November 2005.
- Mirela Damian, Robin Flatland and Joseph O'Rourke. Unfolding Manhattan towers. In Proc. of the 17th Canadian Conference on Computational Geometry, CCCG'05, pages 211-214, August 2005.
- Mirela Damian and Henk Meijer. Grid edge-unfolding orthostacks with orthogonally convex slabs. In Proc. of the 14th Fall Workshop on Computational Geometry, FWCG'04, pages 25-26, November 2004.
- Mirela Damian and Joseph O'Rourke. On corners of objects built from parallelepiped bricks. In Proc. of the 16th Canadian Conference on Computational Geometry, CCCG'04, pages 20-23, August 2004.
- Mirela Damian and Joseph O'Rourke. Partitioning regular polygons into circular pieces I: Convex partitions. In Proc. of the 15th Canadian Conference on Computational Geometry, CCCG'03, pages 43-46, August 2003. Full version available cs.CG/0304023.
- Mirela Damian. Exact and approximation algorithms for computing a-fat decompositions. In Proc. of the 14th Canadian Conference on Computational Geometry, CCCG'02, pages 93-96, August 2002.
- Mirela Damian and Sriram V. Pemmaraju. Computing optimal a-fat and a-small decompositions. In Proc. of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'01, pages 338-339, January 2001.
- Mirela Damian and Sriram V. Pemmaraju. A (2+e)-approximation scheme for minimum domination on circle graphs. In Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00, pages 672-679, Philadelphia, PA, USA, 2000.
- Mirela Damian and Sriram V. Pemmaraju. Constant-factor approximation algorithms for domination problems on circle graphs. In Proc. of the 10th International Symposium on Algorithms and Computation, ISAAC'99, pages 70-82, London, UK, 1999.
- Mirela Damian and Sriram V. Pemmaraju. Hardness of approximating minimum domination in circle graphs. In Proc. of the 10th International Symposium on Algorithms and Computation, ISAAC'99, pages 56-69, London, UK, 1999.
- Mirela Damian and Sriram V. Pemmaraju. Automatic data decomposition for message-passing machines. In Proc. of the 10th International Workshop on Languages and Compilers for Parallel Computing, LCPC'97, pages 64-78, London, UK, 1998.