#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2002

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Radoslav Fulek, Noushin Saeedi, Deniz Sariöz
- ArXiv
- 2011

The disjoint convex obstacle number of a graph G is the smallest number h such that there is a set of h pairwise disjoint convex polygons (obstacles) and a set of n points in the plane (corresponding… (More)

- Matthew P. Johnson, Deniz Sariöz, Amotz Bar-Noy, Theodore Brown, Dinesh C. Verma, Chai Wah Wu
- IEEE INFOCOM 2009
- 2009

Positioning disk-shaped sensors to optimize certain coverage parameters is a fundamental problem in ad hoc sensor networks. The hexagon lattice arrangement is known to be optimally efficient in the… (More)

- Deniz Sariöz
- ArXiv
- 2010

We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and… (More)

- Padmini Mukkamala, János Pach, Deniz Sariöz
- WG
- 2010

Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of points in the plane… (More)

- Deniz Sariöz
- CCCG
- 2011

An obstacle representation for a (straight-line) graph drawing consists of the positions of the graph vertices together with a set of polygonal obstacles such that every line segment between a pair… (More)

- János Pach, Deniz Sariöz
- Graphs and Combinatorics
- 2011

The obstacle number of a graph G is the smallest number of polygonal obstacles in the plane with the property that the vertices of G can be represented by distinct points such that two of them see… (More)

- Matthew P. Johnson, Deniz Sariöz
- ArXiv
- 2011

An obstacle representation of a plane graphG is V (G) together with a set of opaque polygonal obstacles such that G is the visibility graph on V (G) determined by the obstacles. We investigate the… (More)

- Matthew P. Johnson, Deniz Sariöz
- CCCG
- 2014

An obstacle representation of a planar straight-line graph (PSLG) G consists of the choice and placement of a set of opaque polygonal obstacles in such a way that the visibility graph on V (G)… (More)

- Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Deniz Sariöz, Dinesh C. Verma, Chai Wah Wu
- 2008 5th IEEE International Conference on Mobile…
- 2008

An ad-hoc sensor network is composed of sensing devices which can measure or detect features of their environment, communicate with one other and possibly with other devices that perform data fusion.… (More)

- José Luis Ambite, Yigal Arens, +16 authors Kazi A. Zaman
- Advances in Digital Government
- 2002