#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1997

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Prosenjit Bose, Mirela Damian, +4 authors Stefanie Wuhrer
- Int. J. Comput. Geometry Appl.
- 2012

We show that the Yao graph Y 4 in the L 2 metric is a spanner with stretch factor 8 √ 2(29+ 23 √ 2). Enroute to this, we also show that the Yao graph Y ∞ 4 in the L∞ metric is a plane spanner with stretch factor 8.

- Matthew Bauer, Mirela Damian
- SODA
- 2013

We show that, for any integer k ≥ 6, the Sparse-Yao graph Y Y 6k (also known as Yao-Yao) is a spanner with stretch factor 11.67. The stretch factor drops down to 4.75 for k ≥ 8.

- Brad Ballinger, Nadia Benbernou, +11 authors Ryuhei Uehara
- J. Comb. Optim.
- 2010

The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters.

- Mirela Damian, Kristin Raudonis
- Discrete Math., Alg. and Appl.
- 2010

- Greg Aloupis, Nadia Benbernou, +4 authors Stefanie Wuhrer
- Comput. Geom.
- 2009

— Modular robots consist of many small units that attach together and can perform local motions. By combining these motions, we can achieve a reconfiguration of the global shape. The term modular comes from the idea of grouping together a fixed number of units into a module, which behaves as a larger individual component. Recently, a fair amount of research… (More)

- Justin Colannino, Mirela Damian, +5 authors Godfried T. Toussaint
- Graphs and Combinatorics
- 2007

Let S and T be two sets of points with total cardinality n. The minimum-cost many-to-many matching problem matches each point in S to at least one point in T and each point in T to at least one point in S, such that sum of the matching costs is minimized. Here we examine the special case where both S and T lie on the line and the cost of matching s ∈ S to t… (More)

- Mirela Damian
- ArXiv
- 2008

It is a standing open question to decide whether the Yao-Yao structure for unit disk graphs (UDGs) is a length spanner of not. This question is highly relevant to the topology control problem for wireless ad hoc networks. In this paper we make progress towards resolving this question by showing that the Yao-Yao structure is a length spanner for UDGs of… (More)

- Luis Barba, Prosenjit Bose, +5 authors Sander Verdonschot
- JoCG
- 2014

For a set of points in the plane and a fixed integer k > 0, the Yao graph Yk partitions the space around each point into k equiangular cones of angle &thetas; = 2π/k, and connects each point to a nearest neighbor in each cone. It is known for all Yao graphs, with the sole exception of Y5, whether or not they are geometric spanners. In this paper we… (More)

- Mirela Damian, Sriram V. Pemmaraju
- LCPC
- 1997

The data distribution problem is very complex, because it involves trade-off decisions between minimizing communication and maximizing parallelism. A common approach towards solving this problem is to break the data mapping into two stages: an alignment stage and a distribution stage. The alignment stage attempts to increase parallelism, while the… (More)

- Mirela Damian, Erik D. Demaine, +10 authors Godfried T. Toussaint
- CCCG
- 2006