Publications

Publications My Erdös number is 3.

Journal Papers:

M. Damian, R. Flatland, and J. O'Rourke. Unfolding Manhattan Towers. In Computational Geometry Theory and Applications, 40:102--114, July 2008.
M. Damian, R. Flatland, and J. O'Rourke. Grid vertex-unfolding orthogonal polyhedra. In Discrete and Computational Geometry, 39(13):213--238, March 2008.
M. Damian and J. O'Rourke. On corners of objects built from parallelepiped bricks. In Computational Geometry Theory and Applications, 39(1):43--54, January 2008.
M. Damian, R. Flatland, and J. O'Rourke. Epsilon-unfolding orthogonal polyhedra. In Graphs and Combinatorics, 23[Suppl]:179--194, June 2007. Akiyama-Chv´atal Festschrift.
J. Colannino, M. Damian, F. Hurtado, S. Langerman, H. Meijer, S. Ramaswami, D. Souvaine, and G. Toussaint. Efficient many-to-many point matching in one dimension. In Graphs and Combinatorics, 23[Suppl]:169--178, June 2007. Akiyama-Chv´atal Festschrift.
J. Colannino, M. Damian, F. Hurtado, J. Iacono, H. Meijer, S. Ramaswami, and G. Toussaint. An O(n log n)-time algorithm for the restricted scaffold assignment. In Journal of Computational Biology, 13(4):979--989, 2006.
M. Damian and S.V. Pemmaraju. APX-hardness of domination problems in circle graphs. In Information Processing Letters, 97(6):231--237, 2006.
M. Damian. Exact and approximation algorithms for computing optimal fat decompositions. In Computational Geometry Theory and Applications, 28(1):19--27, 2004.
M. Damian and S.V. Pemmaraju. Computing optimal diameter-bounded polygon partitions. In Algorithmica, 40(1):1--14, 2004.
M. Damian and S.V. Pemmaraju. A (2+e)-approximation scheme for minimum domination on circle graphs. In Journal of Algorithms, 42(2):255--276, 2002.
V. Damian, M. Damian, A. Sandu F.A. Potra, and G.R. Carmichael. The Kinetic Preprocessor KPP: Software environment for solving chemical kinetics. In Journal of Computers and Chemical Engineering, 26(11):1567--1579, 2002.
G.R. Carmichael, V. Damian, F.A. Potra, A. Sandu, and M. Damian. The current state and the future directions in air quality modelling. In Journal of Systems Analysis Modelling and Simulation, 25(1):75--105, 1996.

Conference Papers:

M. Damian and N. Javali. Bounded-degree low-interference spanners for wireless ad-hoc networks. In MobiHoc 08: Proc. of the 9th Ninth ACM Int. Symposium on Mobile Ad Hoc Networking and Computing, May 2008. To appear.
M. Damian, R. Flatland, J. O'Rourke, and S. Ramaswami. Connecting polygonizations via stretches and twangs. In STACS'08: Proc. of the 25th Symposium on Theoretical Aspects of Computer Science, pages 217--228. IBFI Schloss Dagstuhl, February 2008.
G. Aloupis, S. Collette, M. Damian, E. D. Demaine, R. Flatland, S. Langerman, J. O'Rourke, S. Ramaswami, V. Sacristan, and S. Wuhrer. Linear reconfiguration of cube-style modular robots. In ISAAC 07: Proc. of the 18th Int. Symposium of Algorithms and Computation, pages 208--219, December 2007.
M. Damian, R. Flatland, J. O'Rourke, and S. Ramaswami. A new lower bound on guard placement for wireless localization. In FWCG 07: Proc. of the 17th Fall Workshop on Computational Geometry, November 2007. (2-page abstract).
M. Damian, E. Demaine, M. Demaine, V. Dujmovic, D. El-Khechen, R. Flatland, J. Iacono, S. Langerman, H. Meijer, S. Ramaswami, D. Souvaine, P. Taslakian, and G. Toussaint. Curves in the sand: Algorithmic drawing. In CCCG 06: Proc. of the 18th Canadian Conference on Computational Geometry, pages 11--14, August 2006.
M. Damian, S. Pandit, and S.V. Pemmaraju. Local approximation schemes for topology control. In PODC 06: Proc. of the 25th ACM Symposium on the Principles of Distributed Computing, pages 208--218, July 2006.
M. Damian, S. Pandit, and S.V. Pemmaraju. Distributed spanner construction in doubling metric spaces. In OPODIS 06: Proc. of the 10th Int. Conf. on Principles of Distributed Computing, pages 157--171, December 2006.
M. Damian, R. Flatland, and J. O'Rourke. Grid vertex-unfolding orthogonal polyhedra. In STACS 06: Proc. of the 23rd Symposium on Theoretical Aspects of Computer Science, volume LNCS 3884, pages 264--276, 2006.
M. Damian, R. Flatland, H. Meijer, and J. O'Rourke. Unfolding well-separated orthotrees. In FWCG 05: Proc. of the 15th Workshop on Computational Geometry, pages 25--26, 2005.
M. Damian, R. Flatland, and J. O'Rourke. Unfolding Manhattan Towers. In CCCG 05: Proc. of the 17th Canadian Conference on Computational Geometry, pages 211--214, 2005.
M. Damian and H. Meijer. Grid edge-unfolding orthostacks with orthogonally convex slabs. In FWCG 04: Proc. of the 14th Workshop on Computational Geometry, pages 25--26, 2004.
M. Damian and J. O'Rourke. Partitioning regular polygons into circular pieces I: Convex partitions. In CCCG 03: Proc. of the 15th Canadian Conference on Computational Geometry, pages 43--47, 2003.
M. Damian and S.V. Pemmaraju. Hardness of approximating independent domination in circle graphs. In ISAAC 99: Proc. of the 10th International Symposium on Algorithms and Computation, volume LNCS 1741, pages 70--82, 1999.
M. Damian and S.V. Pemmaraju. Constant-factor approximation algorithms for domination problems on circle graphs. In ISAAC 99: Proc. of the 10th International Symposium on Algorithms and Computation, volume LNCS 1741, pages 56--69, 1999.
M. Damian and S.V. Pemmaraju. Automatic data decomposition for message-passing machines. In LCPC 97: Proc. of the 10th International Workshop on Languages and Compilers for Parallel Computing, volume LNCS 1366, pages 64--78, 1997.

Unrefereed Papers:

M. Damian and J. O'Rourke. Partitioning Regular Polygons into Circular Pieces II: Nonconvex Partitions. Dec. 2004, arXiv cs.CG/0412095.
M. Damian and J. O'Rourke. A Note on Objects Built from Bricks without Corners. Smith College Technical Report, July 2003, arXiv cs.CG/0307042.
M. Damian. Shape-Constrained Polygon Decomposition and Graph Domination Problems. PhD Thesis, University of Iowa, Computer Science Department, July 2000.
M. Damian and J. Cremer and S. Pemmaraju. On the Bounded Diameter Polygon Decompositions. University of Iowa Technical Report TR 99-01, 1999.
M. Damian. A Coarse-Grain Parallelizing Compiler for Distributed Memory Systems. MS Thesis, University of Iowa, Computer Science Department, December 1996.