49 citations · 62 across the 16 of their papers we have counts for
6 papers · 1 filter
On the complexity of covering points by guillotine cuts
Delia Garijo, Alberto Márquez, Rodrigo I. Silveira
We show that the problem of covering a set of points in the plane with a minimum number of guillotine cuts is NP-complete. To that end, first we present a new NP-completeness proof…
Algorithms for Distance Problems in Continuous Graphs
Sergio Cabello, Delia Garijo, Antonia Kalb +3
We study the problem of computing the diameter and the mean distance of a continuous graph, i.e., a connected graph where all points along the edges, instead of only the vertices,…
Continuous mean distance of a weighted graph
Delia Garijo, Alberto Márquez, Rodrigo I. Silveira
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances…
Computing optimal shortcuts for networks
Delia Garijo, Alberto Márquez, Natalia Rodríguez +1
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. P…
Stabbing segments with rectilinear objects
Mercè Claverol, Delia Garijo, Matias Korman +2
Given a set of line segments in the plane, we say that a region is a {\em stabber} for if contains exactly one endpoin…
On Hamiltonian alternating cycles and paths
Mercè Claverol, Alfredo García, Delia Garijo +2
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when t…