22 citations · 51 across the 8 of their papers we have counts for
9 papers
The inverse Voronoi problem in graphs
Édouard Bonnet, Sergio Cabello, Bojan Mohar +1
We introduce the inverse Voronoi diagram problem in graphs: given a graph with positive edge-lengths and a collection of subsets of vertices of , decide whet…
On the weak Roman domination number of lexicographic product graphs
Magdalena Valveny, Hebert Pérez-Rosés, Juan A. Rodríguez-Velázquez
A vertex of a graph is said to be undefended with respect to a function if and for every vertex adjacent to …
Endorsement Deduction and Ranking in Social Networks
Hebert Pérez-Rosés, Francesc Sebé, Josep Maria Ribó
Some social networks, such as LinkedIn and ResearchGate, allow user endorsements for specific skills. In this way, for each skill we get a directed graph where the nodes correspond…
A revised Moore bound for mixed graphs
Dominique Buset, Mourad El Amiri, Grahame Erskine +2
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible v…
Searching for Large Circulant Graphs
Ramiro Feria-Puron, Hebert Perez-Roses, Joe Ryan
We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and…
Detection of Non-Stationary Photometric Perturbations on Projection Screens
Miguel Castañeda-Garay, Oscar Belmonte-Fernández, Hebert Pérez-Rosés +1
Interfaces based on projection screens have become increasingly more popular in recent years, mainly due to the large screen size and resolution that they provide, as well as their…
Synthetic Generation of Social Network Data With Endorsements
Hebert Pérez-Rosés, Francesc Sebé
In many simulation studies involving networks there is the need to rely on a sample network to perform the simulation experiments. In many cases, real network data is not available…
Fitting Voronoi Diagrams to Planar Tesselations
Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio +2
Given a tesselation of the plane, defined by a planar straight-line graph , we want to find a minimal set of points in the plane, such that the Voronoi diagram associated wi…
A Heuristic for Magic and Antimagic Graph Labellings
François Bertault, Mirka Miller, Hebert Pérez-Rosés +2
Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few gener…