Gregorio Hernández-Peñalver

Orcid: 0000-0002-7178-0249

According to our database1, Gregorio Hernández-Peñalver authored at least 26 papers between 1993 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Combinatorial bounds on paired and multiple domination in triangulations.
Electron. Notes Discret. Math., 2018

2017
Remote Monitoring by Edges and Faces of Maximal Outerplanar Graphs.
Comput. J., 2017

2016
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs.
Electron. Notes Discret. Math., 2016

2015
Distance domination, guarding and covering of maximal outerplanar graphs.
Discret. Appl. Math., 2015

Some Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations.
Comput. J., 2015

2014
Approximated algorithms for the minimum dilation triangulation problem.
J. Heuristics, 2014

Monitoring maximal outerplanar graphs.
Electron. Notes Discret. Math., 2014

2013
Distance domination, guarding and vertex cover for maximal outerplanar graph.
CoRR, 2013

2012
A Hybrid Metaheuristic Strategy for Covering with Wireless Devices.
J. Univers. Comput. Sci., 2012

Improving Shortest Paths in the Delaunay Triangulation.
Int. J. Comput. Geom. Appl., 2012

Approximations on Minimum Weight Triangulations and Minimum Weight Pseudo-Triangulations Using Ant Colony Optimization Metaheuristic.
Fundam. Informaticae, 2012

2011
Approximations on Minimum Weight Pseudo-triangulation Problem Using Ant Colony Optimization Metaheuristic.
Proceedings of the 30th International Conference of the Chilean Computer Science Society, 2011

Using ACO Metaheuristic for MWT Problem.
Proceedings of the 30th International Conference of the Chilean Computer Science Society, 2011

Connecting Red Cells in a Bicolour Voronoi Diagram.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2009
An "Art Gallery Theorem" for pyramids.
Inf. Process. Lett., 2009

Visibilidad de Alcance Limitado en Polígonos Escalera.
Computación y Sistemas, 2009

2008
Computing shortest heterochromatic monotone routes.
Oper. Res. Lett., 2008

Estimating the Maximum Hidden Vertex Set in Polygons.
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

2006
Good Illumination of Minimum Range
CoRR, 2006

Solving the Illumination Problem with Heuristics.
Proceedings of the Numerical Methods and Applications, 6th International Conference, 2006

1999
Bipartite Embeddings of Trees in the Plane.
Discret. Appl. Math., 1999

1997
A Combinatorial Property of Convex Sets.
Discret. Comput. Geom., 1997

1996
Onion Polygonizations.
Inf. Process. Lett., 1996

1995
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Controlling Guards.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Updating Polygonizations.
Comput. Graph. Forum, 1993


  Loading...