### Recent Submissions

• #### On global location-domination in bipartite graphs ﻿

(2015-06-10)
External research report
Open Access
• #### On global location-domination in graphs ﻿

(2015-05-29)
Article
Open Access
A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ...
• #### Empty non-convex and convex four-gons in random point sets ﻿

(2015-03-01)
Article
Open Access
Let S be a set of n points distributed uniformly and independently in a convex, bounded set in the plane. A four-gon is called empty if it contains no points of S in its interior. We show that the expected number of empty ...
• #### On perfect and quasiperfect domination in graphs ﻿

(2014-11-28)
External research report
Open Access
• #### Global location-domination in graphs ﻿

(2013-12-03)
External research report
Open Access
A dominating set S of a graph G is called locating-dominating, LD-setfor short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ...
• #### Las habilidades sociales del docente universitario: una formación hacia la competencia interpersonal ﻿

(Congrés Internacional de Docència Universitària i Innovació (CIDUI), 2014)
Conference lecture
Open Access
Desde el ICE de la UPC se ha planteado una nueva formación dirigida a todo el profesorado basada en la adquisición de competencias docentes. Uno de los módulos de formación puesto en marcha trabaja la adquisición de la ...
• #### Colored Ray configurations ﻿

(2014)
Conference report
Open Access
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 ...
• #### A faster algorithm to compute the visibility map of a 1.5D terrain ﻿

(2014)
Conference report
Open Access
Given a 1.5D terrain, i.e., an x -monotone polygonal line in R 2 with n vertices, and 1 m n viewpoints placed on some of the terrain vertices, we study the problem of computing the parts of the terrain that are visible ...
• #### Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) ﻿

(2014)
Conference report
Open Access
Let p and q be two imprecise points, given as prob- ability density functions on R 2 , and let R be a set of n line segments in R 2 . We study the problem of approximating the probability that p and q can see each other; ...
• #### Note on the number of obtuse angles in point sets ﻿

(2014-09)
Article
Open Access
In $1979$ Conway, Croft, Erd\H{o}s and Guy proved that every set $S$ of $n$ points in general position in the plane determines at least $\frac{n^3}{18}-O(n^2)$ obtuse angles and also presented a special set of $n$ points ...