Now showing items 1-3 of 3

  • Edge-Removal and Non-Crossing Configurations in Geometric Graphs 

    Aichholzer, Oswin; Cabello, Sergio; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Wood, David (2010)
    Article
    Open Access
    A geometric graph is a graph G = (V;E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . We study the following extremal problem for ...
  • Modem illumination of monotone polygons 

    Aichholzer, Oswin; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens; Urrutia Galicia, Jorge; Vogtenhuber, Birgit (2009)
    Conference report
    Open Access
    We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these ...
  • Proximity graphs inside large weighted graphs 

    Ábrego, Bernardo M.; Fabila Monroy, Ruy; Fernández-Merchant, Silvia; Flores Peñaloza, David; Hurtado Díaz, Fernando Alfredo; Meijer, Henk; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
    Conference report
    Open Access
    Given a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ...