Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, Carlos Seara, Shakhar Smorodinsky
Given a set P of points in the plane, a set of points Q is a weak ε-net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing ε|P | points...
1 Introduction Small Weak Epsilon Nets (2008)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, Shakhar Smorodinsky, Carlos Seara
Let P be a set of n points in R 2. A point q (not
On the Steiner, geodetic and hull numbers of graphs ∗ (2008)
Given a graph G and a subset W ⊆ V (G), a Steiner W-tree is a tree of minimum order that contains all of W.LetS(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call...
The P log i and AC i−1 operators on the polynomial time hierarchy (2008)
In [CS-92] we studied the agreement of operators Plogi and ACi−1 acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on ΣP k, ΠP k,...
On the Steiner, hull and geodetic numbers of graphs ∗ (2008)
Given a graph G and a subset W ⊆ V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call...
Carmen Hern, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, José Cáceres, Mari L. Puertas
the metric dimension of some families of graphs
Abstract On Computing Enclosing Isosceles Triangles and Related Problems (2008)
Prosenjit Bose, Carlos Seara, Saurabh Sethia
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study a 3-dimensional...
Complexity Classes between Θ P k and ∆ P k (2008)
We give different characterizations of the classes Plogi(NP), which are located between ΘP 2 and ∆P 2. First we show that these classes are equal to the classes AC i−1 (NP). Second we prove that...
Ferran Hurtado, Departament Matemática, Aplicada Ii, Carlos Seara, Departament Matemática Aplicada, Saurabh Sethia
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the plane.
Chromatic Variants of the Erds-Szekeres Theorem on Points in Convex Position (2007)
Olivier Devillers, Ferran Hurtado, Carlos Seara, Thme Gnie Logiciel, Projets Prisme
apport de recherche
Separability by two lines and by flat polygonals ∗ (2007)
Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara
In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N log N)-time optimal algorithms for computing all the...
Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
In this paper we study the separability of two disjoint object sets in the plane by two criteria: we want to know if there is a wedge or a strip separating the object sets. In the affirmative case,...
Olivier Devillers, Olivier Devillers, Ferran Hurtado, Ferran Hurtado, Carlos Seara, Carlos Seara, ...
apport de recherche
Extremal Graph Theory for Metric Dimension and Diameter (2007)
Hernando, Carmen, Mora, Merce, Pelayo, Ignacio M., Seara, Carlos, Wood, David R.
A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum...
Mariano Ithuralde, Daniel Ferrante, Carlos Seara, Alejandro Ithuralde, María Ballestrini, Marisa García Nani, ...
IntroducciónEl método RACHS (Risk Adjustment for Congenital Heart Surgery) es ampliamente utilizado para predecir mortalidad y ajuste de riesgo en cirugía cardíaca pediátrica y constituye una...
On determining number and metric dimension of graphs (2007)
José Cáceres, Delia Garijo, María L. Puertas, Carlos Seara
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...
Mauricio Abello, José M. Moltedo, Nélida Fernández, Alejandro Ithuralde, Carlos Seara, Mariano Ithuralde
Un paciente de 28 años con diagnóstico de d-transposición de las grandes arterias (d-TGA)y corrección fisiológica con técnica de Senning fue sometido a estudio electrofisiológico porsíncopes...
On the Metric Dimension of Cartesian Products of Graphs (2005)
Cáceres, José, Hernando, Carmen, Mora, Mercé, Pelayo, Ignacio M., Puertas, María L., Seara, Carlos, ...
A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving...
Reverse facility location problems (2005)
Sergio Cabello, J. Miguel, Carlos Seara, Inma Ventura
The Reverse Nearest Neighbor (RNN) problem is to find all points in a given data set whose nearest neighbor is a given query point. Given a set of blue points and a set of red points, the bichromatic...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W)...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimumorder that contains all of W. Let S(W) denote the set of all vertices in G that lie onsome Steiner W-tree; we call S(W)...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G ifthere exists a vertex u such that no neighbor of v is further away from u than v.We obtain a number of properties...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2003)
Olivier Devillers, Ferran Hurtado, Gyula Károlyi, Carlos Seara
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W)...
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2003)
Devillers, Olivier, Hurtado, Ferran, Károlyi, Gyula, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2003)
Devillers, Olivier, Hurtado, Ferran, Károlyi, Gyula, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Red-blue separability problems in 3d (2003)
Ferran Hurtado, Carlos Seara, Saurabh Sethia
In this paper we study the problems of separability of two disjoint point sets in 3D by multiple criteria extending some notions on separability of two disjoint point sets in the plane. 1
Chromatic variants of the Erdös-Szekeres Theorem (2003)
Olivier Devillers, Ferran Hurtado, Carlos Seara
submitted to CGTA Abstract Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2002)
Devillers, Olivier, Hurtado, Ferran, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2002)
Devillers, Olivier, Hurtado, Ferran, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position (2002)
Devillers, Olivier, Hurtado, Ferran, Seara, Carlos
Let S be a point set in the plane in general position, such that its elements are partitioned into k classes or colors. In this paper we study several variants on problems related to the...
Separating several point sets in the plane (2001)
Olivier Devillers, Ferran Hurtado, Carlos Seara
In this paper we study some problems on the separability of k disjoint point sets in the plane. On one hand, we give algorithms for nding minimum-cardinality separators by means of parallel lines or...
Some lower bounds on geometric separability problems (2001)
Esther M. Arkin, Ferran Hurtado, Carlos Seara, Steven S. Skiena
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show Ω(n log n) time lower bounds for separability by...
Some lower bounds on geometric separability problems (2001)
Esther M. Arkin, Ferran Hurtado, Carlos Seara, Steven S. Skiena
In this paper we obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. More precisely, we show Ω(n log n) time lower bounds for the...
Separating objects in the plane by wedges and strips (1998)
Ferran Hurtado, Marc Noy, Pedro A. Ramos, Carlos Seara
In this paper we study the separability of two disjoint sets of objects in the plane according to two criteria: wedge separability and strip separability. We give algorithms for computing all the...