Jittering Reduction in Marker-Based Augmented Reality Systems. - Monica Rubio; Arturo Quintana; Hebert Pérez-Rosés; Ricardo Quirós; Emilio Camahort (ICCSA (1), 2006)

New Largest Graphs of Diameter 6: (Extended Abstract). - Guillermo Pineda-Villavicencio; José Gómez; Mirka Miller; Hebert Pérez-Rosés (Electron. Notes Discret. Math., 2006)

Image Processing using Voronoi diagrams. - Alondra Martinez; Jennifer Martinez; Hebert Pérez-Rosés; Ricardo Quirós (IPCV, 2007)

Un Método para la Detección en Tiempo Real de Perturbaciones Fotométricas en Imágenes Proyectadas. - Miguel Castañeda-Garay; Óscar Belmonte Fernández; José Gil-Altaba; Hebert Pérez-Rosés; Inmaculada Coma (CEIG, 2009)

Denotational Semantics for Social Communication among Agents. - Alejandro Garcés; Ricardo Quirós; Miguel Chover; Hebert Pérez-Rosés; Ianisse Quinzán; Pilar Espinosa (SEDE, 2009)

New largest known graphs of diameter 6. - Guillermo Pineda-Villavicencio; José Gómez; Mirka Miller; Hebert Pérez-Rosés (Networks, 2009)

Detection of Non-Stationary Photometric Perturbations on Projection Screens. - Miguel Castañeda-Garay; Antonio Diaz Tula; Óscar Belmonte Fernández; Hebert Pérez-Rosés (J. Res. Pract. Inf. Technol., 2012)

The maximum degree and diameter-bounded subgraph in the mesh. - Mirka Miller; Hebert Pérez-Rosés; Joe Ryan 001 (Discret. Appl. Math., 2012)

The Maximum Degree & Diameter-Bounded Subgraph and its Applications. - Anthony Dekker; Hebert Pérez-Rosés; Guillermo Pineda-Villavicencio; Paul A. Watters (J. Math. Model. Algorithms, 2012)

Sustainable Internet Services in Contributory Communities. - Guillem Cabrera; Hebert Pérez-Rosés; Angel A. Juan; Joan Manuel Marquès (CAEPIA, 2013)

Fitting Voronoi Diagrams to Planar Tesselations. - Greg Aloupis; Hebert Pérez-Rosés; Guillermo Pineda-Villavicencio; Perouz Taslakian; Dannier Trinchet-Almaguer (IWOCA, 2013)

Promoting green internet computing throughout simulation-optimization scheduling algorithms. - Guillem Cabrera; Hebert Pérez-Rosés; Angel A. Juan; Joan Manuel Marquès; Javier Faulin (WSC, 2013)

A Heuristic for Magic and Antimagic Graph Labellings - François Bertault; Mirka Miller; Hebert Pérez-Rosés; Ramiro Feria-Purón; Elaheh Vaezpour (CoRR, 2013)

Degree diameter problem on honeycomb networks. - Premysl Holub; Mirka Miller; Hebert Pérez-Rosés; Joe Ryan 001 (Discret. Appl. Math., 2014)

Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey. - Hebert Pérez-Rosés (Electron. J. Graph Theory Appl., 2014)

Searching for Large Multi-Loop Networks. - Ramiro Feria-Purón; Joe Ryan 001; Hebert Pérez-Rosés (Electron. Notes Discret. Math., 2014)

Mixed Moore Cayley graphs. - Nacho López; Hebert Pérez-Rosés; Jordi Pujolàs (Electron. Notes Discret. Math., 2014)

Degree/diameter Problem for Mixed Graphs. - Nacho López; Hebert Pérez-Rosés (ICGTIS, 2015)

Synthetic generation of social network data with endorsements. - Hebert Pérez-Rosés; Francesc Sebé (J. Simulation, 2015)

Endorsement deduction and ranking in social networks. - Hebert Pérez-Rosés; Francesc Sebé; Josep Maria Ribó (Comput. Commun., 2016)

A revised Moore bound for mixed graphs. - Dominique Buset; Mourad El Amiri; Grahame Erskine; Mirka Miller; Hebert Pérez-Rosés (Discret. Math., 2016)

A Moore-like bound for mixed abelian Cayley graphs. - Nacho López; Hebert Pérez-Rosés; Jordi Pujolàs (Electron. Notes Discret. Math., 2016)

A variant of the McKay-Miller-Širáň construction for mixed graphs. - Nacho López; Hebert Pérez-Rosés; Jordi Pujolàs; Mária Zdímalová (Electron. Notes Discret. Math., 2016)

Iterated endorsement deduction and ranking. - Hebert Pérez-Rosés; Francesc Sebé (Computing, 2017)

The Degree/Diameter Problem for mixed abelian Cayley graphs. - Nacho López; Hebert Pérez-Rosés; Jordi Pujolàs (Discret. Appl. Math., 2017)

The inverse Voronoi problem in graphs. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (CoRR, 2018)

Eulogy for Professor Mirka Miller (1949-2016). - Valentina Badia; Hebert Pérez-Rosés; Joe Ryan 001 (Math. Comput. Sci., 2018)

Sixty Years of Network Reliability. - Hebert Pérez-Rosés (Math. Comput. Sci., 2018)

Construction of extremal mixed graphs of diameter two. - Nacho López; Hebert Pérez-Rosés; Jordi Pujolàs; Mária Zdímalová (Discret. Appl. Math., 2019)

On the weak Roman domination number of lexicographic product graphs. - Magdalena Valveny; Hebert Pérez-Rosés; Juan A. Rodríguez-Velázquez (Discret. Appl. Math., 2019)

The Inverse Voronoi Problem in Graphs I: Hardness. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2020)

The Inverse Voronoi Problem in Graphs II: Trees. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2021)

Quasi-Ordinarization Transform of a Numerical Semigroup. - Maria Bras-Amorós; Hebert Pérez-Rosés; José Miguel Serradilla-Merinero (Symmetry, 2021)

Greedy Routing in Circulant Networks. - Hebert Pérez-Rosés; Maria Bras-Amorós; José Miguel Serradilla-Merinero (Graphs Comb., 2022)

Greedy Sets and Greedy Numerical Semigroups. - Hebert Pérez-Rosés; José Miguel Serradilla-Merinero; Maria Bras-Amorós (CoRR, 2024)

Totally Greedy Sequences Defined by Second-Order Linear Recurrences With Constant Coefficients. - Hebert Pérez-Rosés (ICCSA (1), 2025)