default search action
Gregorio Hernández-Peñalver
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j17]Santiago Canales, Irene Castro, Gregorio Hernández-Peñalver
:
Combinatorial bounds on paired and multiple domination in triangulations. Electron. Notes Discret. Math. 68: 77-82 (2018) - 2017
- [j16]Gregorio Hernández-Peñalver
Remote Monitoring by Edges and Faces of Maximal Outerplanar Graphs. Comput. J. 60(9): 1279-1288 (2017) - 2016
- [j15]Santiago Canales, Irene Castro, Gregorio Hernández-Peñalver
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs. Electron. Notes Discret. Math. 54: 109-114 (2016) - 2015
- [j14]António Leslie Bajuelos, Santiago Canales, Gregorio Hernández-Peñalver
Some Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations. Comput. J. 58(1): 160-171 (2015) - [j13]Santiago Canales, Gregorio Hernández-Peñalver
Distance domination, guarding and covering of maximal outerplanar graphs. Discret. Appl. Math. 181: 41-49 (2015) - 2014
- [j12]Gregorio Hernández-Peñalver
Monitoring maximal outerplanar graphs. Electron. Notes Discret. Math. 46: 145-152 (2014) - [j11]Maria Gisela Dorzán, Mario Guillermo Leguizamón, Efrén Mezura-Montes
Approximated algorithms for the minimum dilation triangulation problem. J. Heuristics 20(2): 189-209 (2014) - 2013
- [i3]António Leslie Bajuelos, Santiago Canales, Gregorio Hernández-Peñalver, Ana Mafalda Martins, Inês Matos:
Some Results on Open Edge and Open Mobile Guarding of Polygons and Triangulations. CoRR abs/1306.4359 (2013) - [i2]Santiago Canales, Gregorio Hernández-Peñalver, Ana Mafalda Martins, Inês Matos:
Distance domination, guarding and vertex cover for maximal outerplanar graph. CoRR abs/1307.2043 (2013) - 2012
- [j10]Maria Gisela Dorzán, Edilma Olinda Gagliardi, Mario Guillermo Leguizamón, Gregorio Hernández-Peñalver
Approximations on Minimum Weight Triangulations and Minimum Weight Pseudo-Triangulations Using Ant Colony Optimization Metaheuristic. Fundam. Informaticae 119(1): 1-27 (2012) - [j9]Manuel Abellanas, Mercè Claverol
Improving Shortest Paths in the Delaunay Triangulation. Int. J. Comput. Geom. Appl. 22(6): 559-576 (2012) - [j8]António Leslie Bajuelos, Santiago Canales, Gregorio Hernández-Peñalver, Ana Mafalda Martins:
A Hybrid Metaheuristic Strategy for Covering with Wireless Devices. J. Univers. Comput. Sci. 18(14): 1906-1932 (2012) - 2011
- [c8]Manuel Abellanas, António Leslie Bajuelos, Santiago Canales, Mercè Claverol
Connecting Red Cells in a Bicolour Voronoi Diagram. EGC 2011: 210-219 - [c7]Maria Gisela Dorzán, Edilma Olinda Gagliardi, Mario Guillermo Leguizamón, Gregorio Hernández-Peñalver:
Using ACO Metaheuristic for MWT Problem. SCCC 2011: 228-237 - [c6]Edilma Olinda Gagliardi, Maria Gisela Dorzán, Mario Guillermo Leguizamón, Gregorio Hernández-Peñalver:
Approximations on Minimum Weight Pseudo-triangulation Problem Using Ant Colony Optimization Metaheuristic. SCCC 2011: 238-246
2000 – 2009
- 2009
- [j7]Santiago Canales, Gregorio Hernández-Peñalver:
Visibilidad de Alcance Limitado en Polígonos Escalera. Computación y Sistemas 12(4) (2009) - [j6]Manuel Abellanas, Santiago Canales, Gregorio Hernández-Peñalver
An "Art Gallery Theorem" for pyramids. Inf. Process. Lett. 109(13): 719-721 (2009) - 2008
- [j5]José Miguel Díaz-Báñez
Computing shortest heterochromatic monotone routes. Oper. Res. Lett. 36(6): 684-687 (2008) - [c5]António Leslie Bajuelos, Santiago Canales, Gregorio Hernández-Peñalver
Estimating the Maximum Hidden Vertex Set in Polygons. ICCSA Workshops 2008: 421-432 - 2006
- [c4]Manuel Abellanas, Enrique Alba, Santiago Canales, Gregorio Hernández-Peñalver:
Solving the Illumination Problem with Heuristics. Numerical Methods and Applications 2006: 205-213 - [i1]Manuel Abellanas, António Leslie Bajuelos, Gregorio Hernández-Peñalver, Ferran Hurtado, Inês Matos, Belén Palop:
Good Illumination of Minimum Range. CoRR abs/cs/0606013 (2006)
1990 – 1999
- 1999
- [j4]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos
Bipartite Embeddings of Trees in the Plane. Discret. Appl. Math. 93(2-3): 141-148 (1999) - 1997
- [j3]Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia:
A Combinatorial Property of Convex Sets. Discret. Comput. Geom. 17(3): 307-318 (1997) - 1996
- [j2]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver
Onion Polygonizations. Inf. Process. Lett. 57(3): 165-173 (1996) - [c3]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos
Bipartite Embeddings of Trees in the Plane. GD 1996: 1-10 - 1995
- [c2]Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia:
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. SCG 1995: 71-78 - 1994
- [c1]Gregorio Hernández-Peñalver:
Controlling Guards. CCCG 1994: 387-392 - 1993
- [j1]Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver
Updating Polygonizations. Comput. Graph. Forum 12(3): 143-152 (1993)
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-04-25 05:54 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: