( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving the Illumination Problem with Heuristics.

, , , и . Numerical Methods and Applications, том 4310 из Lecture Notes in Computer Science, стр. 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.

Estela Fabuel Peñalver

Stephanie Hernández

Héctor Hernández

Anja Hernández

Daniel Hernández

 

Другие публикации лиц с тем же именем

Approximated algorithms for the minimum dilation triangulation problem., , , и . J. Heuristics, 20 (2): 189-209 (2014)Bipartite Embeddings of Trees in the Plane., , , , и . Discret. Appl. Math., 93 (2-3): 141-148 (1999)Monitoring maximal outerplanar graphs., и . Electron. Notes Discret. Math., (2014)Distance domination, guarding and covering of maximal outerplanar graphs., , , и . Discret. Appl. Math., (2015)Using ACO Metaheuristic for MWT Problem., , , и . SCCC, стр. 228-237. IEEE Computer Society, (2011)Approximations on Minimum Weight Pseudo-triangulation Problem Using Ant Colony Optimization Metaheuristic., , , и . SCCC, стр. 238-246. IEEE Computer Society, (2011)Some Results on Open-Edge and Open Mobile Guarding of Polygons and Triangulations., , , , и . Comput. J., 58 (1): 160-171 (2015)Remote Monitoring by Edges and Faces of Maximal Outerplanar Graphs., и . Comput. J., 60 (9): 1279-1288 (2017)Voronoi Diagrams and Containment of Families of Convex Sets on the Plane., , , , и . SCG, стр. 71-78. ACM, (1995)Controlling Guards.. CCCG, стр. 387-392. University of Saskatchewan, (1994)