Ara es mostren els items 1-13 de 13

    • Blocking the k-holes of point sets in the plane 

      Cano, Javier; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Shakai, Toshinori; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2015-09)
      Article
      Accés obert
      Let P be a set of n points in the plane in general position. A subset H of P consisting of k elements that are the vertices of a convex polygon is called a k-hole of P, if there is no element of P in the interior of its ...
    • Colored Ray configurations 

      Fabila Monroy, Ruy; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Jaume, Rafel; Pérez Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2014)
      Text en actes de congrés
      Accés obert
      We study the cyclic sequences induced at in nity by pairwise-disjoint colored rays with apices on a given bal- anced bichromatic point set, where the color of a ray is inherited from the color of its apex. We derive a lower ...
    • Colored ray configurations 

      Fabila Monroy, Ruy; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Jaume, Rafel; Pérez Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2018-05)
      Article
      Accés obert
      We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We ...
    • Compatible spanning trees 

      Garcia Olaverri, Alfredo Martin; Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Tejel Altarriba, Francisco Javier (2014-07-01)
      Article
      Accés obert
      Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree ...
    • Configurations of non-crossing rays and related problems 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge (2016-04)
      Article
      Accés obert
      Let S be a set of n points in the plane and let R be a set of n pairwise non-crossing rays, each with an apex at a different point of S. Two sets of non-crossing rays R1R1 and R2R2 are considered to be different if the ...
    • Geometric biplane graphs I: maximal graphs 

      Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
      Text en actes de congrés
      Accés obert
    • Geometric biplane graphs I: maximal graphs 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
      Article
      Accés obert
      We study biplane graphs drawn on a finite planar point set in general position. This is the family of geometric graphs whose vertex set is and can be decomposed into two plane graphs. We show that two maximal biplane ...
    • Geometric biplane graphs II: graph augmentation 

      Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
      Article
      Accés obert
      We study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed into two plane graphs. We show that every ...
    • Geometric Biplane Graphs II: Graph Augmentation 

      Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
      Text en actes de congrés
      Accés obert
      We study biplane graphs drawn on a nite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every ...
    • Metric dimension of maximal outerplanar graphs 

      Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Hernández Peñalver, Gregorio; Garcia Olaverri, Alfredo Martin; Tejel, Javier (2019-03-28)
      Report de recerca
      Accés obert
    • Movilidad Ip: macromovilidad, micromovilidad, calidad de servicio y seguridad 

      Mangues Bafalluy, Josep; Cabellos Aparicio, Alberto; Serral Gracià, René; Domingo Pascual, Jordi; Gómez, A; Miguel, De T; Bagnulo, M; Garcia Olaverri, Alfredo Martin (Asociación de Técnicos de Informática, 2004-01)
      Article
      Accés obert
      a actual tendencia hacia la provisión de conectvidad ubícua, independientemente del lugar, instante, aplicación utilizada, o tecnología de acceso ha contrbuÍdo a acuñar la expresión, "Always Best Connected" (ABC), para ...
    • Total domination in plane triangulations 

      Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2020-11-09)
      Report de recerca
      Accés obert
    • Total domination in plane triangulations 

      Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2021-01-01)
      Article
      Accés obert
      A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ...