( en | de | ru )

 

Disambiguation of "Hernández-Peñalver, Gregorio"

Author of the publication

copydeleteadd this publication to your clipboard
Solving the Illumination Problem with Heuristics.

, , , and . Numerical Methods and Applications, volume 4310 of Lecture Notes in Computer Science, page 205-213. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Estela Fabuel Peñalver

Stephanie Hernández

Héctor Hernández

Anja Hernández

Daniel Hernández

 

Other publications of authors with the same name

Approximated algorithms for the minimum dilation triangulation problem., , , and . J. Heuristics, 20 (2): 189-209 (2014)Bipartite Embeddings of Trees in the Plane., , , , and . Discret. Appl. Math., 93 (2-3): 141-148 (1999)Improving Shortest Paths in the Delaunay Triangulation., , , , , , and . Int. J. Comput. Geom. Appl., 22 (6): 559-576 (2012)Bipartite Embeddings of Trees in the Plane., , , , and . GD, volume 1190 of Lecture Notes in Computer Science, page 1-10. Springer, (1996)Connecting Red Cells in a Bicolour Voronoi Diagram., , , , , and . EGC, volume 7579 of Lecture Notes in Computer Science, page 210-219. Springer, (2011)Good Illumination of Minimum Range, , , , , and . CoRR, (2006)Controlling Guards.. CCCG, page 387-392. University of Saskatchewan, (1994)Solving the Illumination Problem with Heuristics., , , and . Numerical Methods and Applications, volume 4310 of Lecture Notes in Computer Science, page 205-213. Springer, (2006)Estimating the Maximum Hidden Vertex Set in Polygons., , , and . ICCSA Workshops, page 421-432. IEEE Computer Society, (2008)Combinatorial bounds on paired and multiple domination in triangulations., , and . Electron. Notes Discret. Math., (2018)