Hebert Pérez-Rosés

Orcid: 0000-0002-3569-3885

According to our database1, Hebert Pérez-Rosés authored at least 34 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Greedy Routing in Circulant Networks.
Graphs Comb., 2022

2021
Quasi-Ordinarization Transform of a Numerical Semigroup.
Symmetry, 2021

The Inverse Voronoi Problem in Graphs II: Trees.
Algorithmica, 2021

2020
The Inverse Voronoi Problem in Graphs I: Hardness.
Algorithmica, 2020

2019
On the weak Roman domination number of lexicographic product graphs.
Discret. Appl. Math., 2019

Construction of extremal mixed graphs of diameter two.
Discret. Appl. Math., 2019

2018
Sixty Years of Network Reliability.
Math. Comput. Sci., 2018

Eulogy for Professor Mirka Miller (1949-2016).
Math. Comput. Sci., 2018

The inverse Voronoi problem in graphs.
CoRR, 2018

2017
The Degree/Diameter Problem for mixed abelian Cayley graphs.
Discret. Appl. Math., 2017

Iterated endorsement deduction and ranking.
Computing, 2017

2016
A variant of the McKay-Miller-Širáň construction for mixed graphs.
Electron. Notes Discret. Math., 2016

A Moore-like bound for mixed abelian Cayley graphs.
Electron. Notes Discret. Math., 2016

A revised Moore bound for mixed graphs.
Discret. Math., 2016

Endorsement deduction and ranking in social networks.
Comput. Commun., 2016

2015
Synthetic generation of social network data with endorsements.
J. Simulation, 2015

Degree/diameter Problem for Mixed Graphs.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

2014
Mixed Moore Cayley graphs.
Electron. Notes Discret. Math., 2014

Searching for Large Multi-Loop Networks.
Electron. Notes Discret. Math., 2014

Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey.
Electron. J. Graph Theory Appl., 2014

Degree diameter problem on honeycomb networks.
Discret. Appl. Math., 2014

2013
A Heuristic for Magic and Antimagic Graph Labellings
CoRR, 2013

Promoting green internet computing throughout simulation-optimization scheduling algorithms.
Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013

Fitting Voronoi Diagrams to Planar Tesselations.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Sustainable Internet Services in Contributory Communities.
Proceedings of the Advances in Artificial Intelligence, 2013

2012
The Maximum Degree & Diameter-Bounded Subgraph and its Applications.
J. Math. Model. Algorithms, 2012

The maximum degree and diameter-bounded subgraph in the mesh.
Discret. Appl. Math., 2012

Detection of Non-Stationary Photometric Perturbations on Projection Screens.
J. Res. Pract. Inf. Technol., 2012

2009
New largest known graphs of diameter 6.
Networks, 2009

Denotational Semantics for Social Communication among Agents.
Proceedings of the 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), 2009

Un Método para la Detección en Tiempo Real de Perturbaciones Fotométricas en Imágenes Proyectadas.
Proceedings of the XIX Spanish Computer Graphics Conference, 2009

2007
Image Processing using Voronoi diagrams.
Proceedings of the 2007 International Conference on Image Processing, 2007

2006
New Largest Graphs of Diameter 6: (Extended Abstract).
Electron. Notes Discret. Math., 2006

Jittering Reduction in Marker-Based Augmented Reality Systems.
Proceedings of the Computational Science and Its Applications, 2006


  Loading...