Now showing items 1-6 of 6

  • Enseñanza basada en contenidos: una experiencia para el desarrollo de competencias del EEES en grados en Ingeniería Informática 

    Cañete, Antonio; Garijo, Delia; Pérez, Rosario (Universidad de Castilla-La Mancha, 2012-07-10)
    Conference lecture
    Open Access
    En esta ponencia describimos una estrategia docente diseñada para potenciar la implicación del alumno en el desarrollo de las clases. Aprovechando la creación de grupos con docencia en inglés en los grados en Ingeniería ...
  • On the determining number and the metric dimension of graphs 

    Cáceres, Jose; Garijo, Delia; Puertas González, María Luz; Seara Ojea, Carlos (2010-04-19)
    Article
    Open Access
    This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian ...
  • Stabbers of line segments in the plane 

    Claverol Aguas, Mercè; Garijo, Delia; Grima, Clara; Márquez, Alberto; Seara Ojea, Carlos (2011-07)
    Article
    Open Access
    The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges ...
  • Stabbing Segments with Rectilinear Objects 

    Claverol Aguas, Mercè; Seara Ojea, Carlos; Garijo, Delia; Korman, M.; Silveira, Rodrigo Ignacio (2013)
    Conference report
    Restricted access - publisher's policy
    Given a set of n line segments in the plane, we say that a region R of the plane is a stabber if R contains exactly one end point of each segment of the set. In this paper we provide efficient algorithms for determining ...
  • Stabbing segments with rectilinear objects 

    Claverol Aguas, Mercè; Garijo, Delia; Korman, Matias; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2015-08-17)
    Part of book or chapter of book
    Restricted access - publisher's policy
    We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the plane that contain exactly one endpoint of each segment of S. Concretely, we provide efficient algorithms for reporting all ...
  • The alternating path problem revisited 

    Claverol Aguas, Mercè; Garijo, Delia; Hurtado Díaz, Fernando Alfredo; Lara Cuevas, María Dolores; Seara Ojea, Carlos (Universidad de Sevilla, 2013)
    Conference report
    Open Access
    It is well known that, given "n" red points and "n" blue points on acircle, it is not always possible to find a plane geometric. Hamiltonian alternating path. In this work we prove that if we relax the constraint on the ...