#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2004

2018

- This year (1)
- Last 5 years (4)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jurek Czyzowicz, Stefan Dobrev, +4 authors Jorge Urrutia
- LATIN
- 2008

Many protocols in distributed computing make use of dominating and connected dominating sets, for example for broadcasting and the computation of routing. Ad hoc networks impose an additional… (More)

- József Balogh, Hernán González-Aguilar, Gelasio Salazar
- Comput. Geom.
- 2013

A convex hole (or empty convex polygon) of a point set P in the plane is a convex polygon with vertices in P , containing no points of P in its interior. Let R be a bounded convex region in the… (More)

- Jurek Czyzowicz, Stefan Dobrev, +5 authors Jorge Urrutia
- Theor. Comput. Sci.
- 2011

- Oswin Aichholzer, Ruy Fabila Monroy, +5 authors Birgit Vogtenhuber
- Comput. Geom.
- 2014

We consider a variant of a question of Erdős on the number of empty k-gons (k-holes) in a set of n points in the plane, where we allow the k-gons to be nonconvex. We show bounds and structural… (More)

- Crevel Bautista-Santiago, Javier Cano, +5 authors Jorge Urrutia
- Discrete Mathematics & Theoretical Computer…
- 2013

Let P be a set of n points in general position in the plane. A subset I of P is called an island if there exists a convex set C such that I = P ∩C. In this paper we define the generalized island… (More)

- Vladimir G. Boltyanski, Hernán González-Aguilar
- J. Comb. Theory, Ser. A
- 2004

In (Dokl. Math. 64 (2001) 385) we formulated shortly the results which contain a complete classification of compact, convex planar figures with respect to the maximal cardinality of their fixing… (More)

- Birgit Vogtenhuber, Oswin Aichholzer, +6 authors Pavel Valtr
- CCCG
- 2011

We consider a variation of the classical Erdős-Szekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be… (More)

- Jurek Czyzowicz, Stefan Dobrev, +5 authors Jorge Urrutia
- TAMC
- 2008

The problem of computing locally a coloring of an arbitrary planar subgraph of a unit disk graph is studied. Each vertex knows its coordinates in the plane, can directly communicate with all its… (More)

- Frank Duque, Hernán González-Aguilar, César Hernández-Vélez, Jesús Leaños, R. Carolina Medina Ramírez
- Electr. J. Comb.
- 2018

A plane drawing of a graph is cylindrical if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles.… (More)

- ‹
- 1
- ›