Mirela Damian

Henk Meijer

Proceedings of the Combinatorial Optimization and Applications, 2024

2023

Unfolding 3-separated polycube graphs of arbitrary genus.

[BibT_eX]

[DOI]

Comput. Geom., 2023

2022

Reconfiguration of Non-crossing Spanning Trees.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Unfolding polycube trees with constant refinement.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Unfolding a New Class of Orthographs of Arbitrary Genus.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Spanning Properties of Theta-Theta-6.

[BibT_eX]

[DOI]

John Iacono

Andrew Winslow

Graphs Comb., 2020

2019

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Unfolding Orthotrees with Constant Refinement.

[BibT_eX]

[DOI]

CoRR, 2018

Cone-based spanners of constant degree.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Toward Unfolding Doubly Covered n-Stars.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Unfolding Low-Degree Orthotrees with Constant Refinement.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Minimal forcing sets for 1D origami.

[BibT_eX]

[DOI]

CoRR, 2017

Improved bounds on the stretch factor of Y4.

[BibT_eX]

[DOI]

Naresh Nelavalli

Comput. Geom., 2017

2016

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Improved Bounds on the Stretch Factor of $Y_4$.

[BibT_eX]

[DOI]

Naresh Nelavalli

CoRR, 2016

2015

Minimum Forcing Sets for Miura Folding Patterns.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm.

[BibT_eX]

[DOI]

Erik D. Demaine

Graphs Comb., 2014

New and Improved Spanning Ratios for Yao Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Spanning Properties of Theta-Theta Graphs.

[BibT_eX]

[DOI]

Dumitru V. Voicu

Proceedings of the Combinatorial Optimization and Applications, 2014

Continuous Yao Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Coverage with k-transmitters in the presence of obstacles.

[BibT_eX]

[DOI]

Diane L. Souvaine

Ryuhei Uehara

J. Comb. Optim., 2013

Spanning Properties of graphs induced by Directional Antennas.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2013

Unfolding Orthogrids with Constant Refinement.

[BibT_eX]

[DOI]

Erik D. Demaine

CoRR, 2013

New and Improved Spanning Ratios for Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

An Infinite Class of Sparse-Yao Spanners.

[BibT_eX]

[DOI]

Matthew Bauer

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

π/2-Angle Yao Graphs are Spanners.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2012

2011

Efficient constant-velocity reconfiguration of crystalline robots.

[BibT_eX]

[DOI]

Robotica, 2011

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Undirected connectivity of sparse Yao graphs.

[BibT_eX]

[DOI]

Abhaykumar Kumbhar

Proceedings of the FOMC'11, 2011

Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Connectivity of Graphs Induced by Directional Antennas

[BibT_eX]

[DOI]

CoRR, 2010

Pi/2-Angle Yao Graphs are Spanners

[BibT_eX]

[DOI]

CoRR, 2010

Localized Spanners for Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Ad Hoc Sens. Wirel. Networks, 2010

Shape Replication through Self-Assembly and RNase Enzymes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

pi/2-Angle Yao Graphs Are Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Yao Graphs Span Theta Graphs.

[BibT_eX]

[DOI]

Kristin Raudonis

Proceedings of the Combinatorial Optimization and Applications, 2010

Coverage with k-Transmitters in the Presence of Obstacles.

[BibT_eX]

[DOI]

Diane L. Souvaine

Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Distributed construction of low-interference spanners.

[BibT_eX]

[DOI]

Nagesh Javali

Distributed Comput., 2009

Efficient Reconfiguration of Lattice-Based Modular Robots.

[BibT_eX]

Proceedings of the 4th European Conference on Mobile Robots, 2009

2008

Localized Spanners for Wireless Networks

[BibT_eX]

[DOI]

CoRR, 2008

A Simple Yao-Yao-Based Spanner of Bounded Degree.

[BibT_eX]

[DOI]

CoRR, 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Connecting Polygonizations via Stretches and Twangs.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, 2008

Distributed construction of bounded-degree low-interference spanners of low weight.

[BibT_eX]

[DOI]

Nagesh Javali

Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

2007

Epsilon-Unfolding Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Efficient Many-To-Many Point Matching in One Dimension.

[BibT_eX]

[DOI]

Graphs Comb., 2007

A New Lower Bound on Guard Placement for Wireless Localization

[BibT_eX]

[DOI]

CoRR, 2007

Linear Reconfiguration of Cube-Style Modular Robots.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Vertex Pops and Popturns.

[BibT_eX]

[DOI]

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

2006

An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

APX-hardness of domination problems in circle graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Grid Vertex-Unfolding Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Local approximation schemes for topology control.

[BibT_eX]

[DOI]

Saurav Pandit

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Distributed Spanner Construction in Doubling Metric Spaces.

[BibT_eX]

[DOI]

Saurav Pandit

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Curves in the Sand: Algorithmic Drawing.

[BibT_eX]

[DOI]

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

2005

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment

[BibT_eX]

[DOI]

CoRR, 2005

Unfolding Manhattan Towers.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Partitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions

[BibT_eX]

[DOI]

CoRR, 2004

Exact and approximation algorithms for computing optimal fat decompositions.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Computing Optimal Diameter-Bounded Polygon Partitions.

[BibT_eX]

[DOI]

Algorithmica, 2004

On corners of objects built from parallelepiped bricks.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

A Note on Objects Built From Bricks without Corners

[BibT_eX]

[DOI]

CoRR, 2003

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Exact and approximation algorithms for computing a-fat decompositions.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

Computing optimal alpha-fat and alpha-small decompositions.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

A (2 + epsilon)-approximation scheme for minimum domination on circle graphs.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Hardness of Approximating Independent Domination in Circle Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1997

Automatic Data Decomposition for Message-Passing Machines.

[BibT_eX]

[DOI]