default search action
Hebert Pérez-Rosés
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j24]Hebert Pérez-Rosés
, Maria Bras-Amorós
Greedy Routing in Circulant Networks. Graphs Comb. 38(3): 86 (2022) - 2021
- [j23]Édouard Bonnet, Sergio Cabello
The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica 83(5): 1165-1200 (2021) - [j22]Maria Bras-Amorós
Quasi-Ordinarization Transform of a Numerical Semigroup. Symmetry 13(6): 1084 (2021) - 2020
- [j21]Édouard Bonnet, Sergio Cabello
The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica 82(10): 3018-3040 (2020) - 2019
- [j20]Nacho López
Construction of extremal mixed graphs of diameter two. Discret. Appl. Math. 263: 204-211 (2019) - [j19]Magdalena Valveny, Hebert Pérez-Rosés
On the weak Roman domination number of lexicographic product graphs. Discret. Appl. Math. 263: 257-270 (2019) - 2018
- [j18]Valentina Badia, Hebert Pérez-Rosés
Eulogy for Professor Mirka Miller (1949-2016). Math. Comput. Sci. 12(3): 251-254 (2018) - [j17]Hebert Pérez-Rosés
Sixty Years of Network Reliability. Math. Comput. Sci. 12(3): 275-293 (2018) - 2017
- [j16]Hebert Pérez-Rosés
Iterated endorsement deduction and ranking. Computing 99(5): 431-446 (2017) - [j15]Nacho López
The Degree/Diameter Problem for mixed abelian Cayley graphs. Discret. Appl. Math. 231: 190-197 (2017) - 2016
- [j14]Hebert Pérez-Rosés
Endorsement deduction and ranking in social networks. Comput. Commun. 73: 200-210 (2016) - [j13]Dominique Buset, Mourad El Amiri, Grahame Erskine
A revised Moore bound for mixed graphs. Discret. Math. 339(8): 2066-2069 (2016) - [j12]Nacho López
A Moore-like bound for mixed abelian Cayley graphs. Electron. Notes Discret. Math. 54: 145-150 (2016) - [j11]Nacho López
A variant of the McKay-Miller-Širáň construction for mixed graphs. Electron. Notes Discret. Math. 54: 151-156 (2016) - 2015
- [j10]Hebert Pérez-Rosés
Synthetic generation of social network data with endorsements. J. Simulation 9(4): 279-286 (2015) - 2014
- [j9]Premysl Holub, Mirka Miller, Hebert Pérez-Rosés
Degree diameter problem on honeycomb networks. Discret. Appl. Math. 179: 139-151 (2014) - [j8]Hebert Pérez-Rosés:
Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey. Electron. J. Graph Theory Appl. 2(2): 166-190 (2014) - [j7]Nacho López
Mixed Moore Cayley graphs. Electron. Notes Discret. Math. 46: 193-200 (2014) - [j6]Ramiro Feria-Purón, Joe Ryan, Hebert Pérez-Rosés
Searching for Large Multi-Loop Networks. Electron. Notes Discret. Math. 46: 233-240 (2014) - 2012
- [j5]Miguel Castañeda-Garay, Antonio Diaz Tula, Óscar Belmonte Fernández, Hebert Pérez-Rosés:
Detection of Non-Stationary Photometric Perturbations on Projection Screens. J. Res. Pract. Inf. Technol. 44(4) (2012) - [j4]Mirka Miller, Hebert Pérez-Rosés
The maximum degree and diameter-bounded subgraph in the mesh. Discret. Appl. Math. 160(12): 1782-1790 (2012) - [j3]Anthony Dekker, Hebert Pérez-Rosés
The Maximum Degree & Diameter-Bounded Subgraph and its Applications. J. Math. Model. Algorithms 11(3): 249-268 (2012) - 2009
- [j2]Guillermo Pineda-Villavicencio
New largest known graphs of diameter 6. Networks 53(4): 315-328 (2009) - 2006
- [j1]Guillermo Pineda-Villavicencio
New Largest Graphs of Diameter 6: (Extended Abstract). Electron. Notes Discret. Math. 24: 153-160 (2006)
Conference and Workshop Papers
- 2015
- [c8]Nacho López
Degree/diameter Problem for Mixed Graphs. ICGTIS 2015: 2-9 - 2013
- [c7]Guillem Cabrera
Sustainable Internet Services in Contributory Communities. CAEPIA 2013: 260-268 - [c6]Greg Aloupis, Hebert Pérez-Rosés
Fitting Voronoi Diagrams to Planar Tesselations. IWOCA 2013: 349-361 - [c5]Guillem Cabrera
Promoting green internet computing throughout simulation-optimization scheduling algorithms. WSC 2013: 1917-1925 - 2009
- [c4]Miguel Castañeda-Garay, Óscar Belmonte Fernández
Un Método para la Detección en Tiempo Real de Perturbaciones Fotométricas en Imágenes Proyectadas. CEIG 2009: 239-242 - [c3]Alejandro Garcés, Ricardo Quirós, Miguel Chover, Hebert Pérez-Rosés, Ianisse Quinzán, Pilar Espinosa:
Denotational Semantics for Social Communication among Agents. SEDE 2009: 42-46 - 2007
- [c2]Alondra Martinez, Jennifer Martinez, Hebert Pérez-Rosés, Ricardo Quirós:
Image Processing using Voronoi diagrams. IPCV 2007: 485-491 - 2006
- [c1]Monica Rubio, Arturo Quintana
Jittering Reduction in Marker-Based Augmented Reality Systems. ICCSA (1) 2006: 510-517
Informal and Other Publications
- 2018
- [i7]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The inverse Voronoi problem in graphs. CoRR abs/1811.12547 (2018) - 2015
- [i6]Hebert Pérez-Rosés, Francesc Sebé, Josep Maria Ribó:
Endorsement Deduction and Ranking in Social Networks. CoRR abs/1510.01997 (2015) - 2014
- [i5]Hebert Pérez-Rosés, Francesc Sebé:
Synthetic Generation of Social Network Data With Endorsements. CoRR abs/1411.6273 (2014) - [i4]Miguel Castañeda-Garay, Óscar Belmonte Fernández, Hebert Pérez-Rosés, Antonio Diaz Tula:
Detection of Non-Stationary Photometric Perturbations on Projection Screens. CoRR abs/1411.6275 (2014) - 2013
- [i3]François Bertault, Mirka Miller, Hebert Pérez-Rosés, Ramiro Feria-Purón, Elaheh Vaezpour:
A Heuristic for Magic and Antimagic Graph Labellings. CoRR abs/1305.1880 (2013) - [i2]Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet:
Fitting Voronoi Diagrams to Planar Tesselations. CoRR abs/1308.5550 (2013) - 2012
- [i1]Mirka Miller, Hebert Pérez-Rosés, Joe Ryan:
The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh. CoRR abs/1203.4069 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: