Rebuilding convex sets in graphs. - José Cáceres; Alberto Márquez 001; Ortrud R. Oellermann; María Luz Puertas (Discret. Math., 2005)

Searching for geodetic boundary vertex sets. - José Cáceres; María Luz Puertas; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; Carlos Seara (Electron. Notes Discret. Math., 2005)

On the metric dimension of some families of graphs. - M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; Carlos Seara; José Cáceres; María Luz Puertas (Electron. Notes Discret. Math., 2005)

On geodetic sets formed by boundary vertices. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas; Carlos Seara (Discret. Math., 2006)

Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. - Ortrud R. Oellermann; María Luz Puertas (Discret. Math., 2007)

On the Metric Dimension of Cartesian Products of Graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas; Carlos Seara; David R. Wood (SIAM J. Discret. Math., 2007)

Geodeticity of the contour of chordal graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas; Carlos Seara (Discret. Appl. Math., 2008)

Steiner distance and convexity in graphs. - José Cáceres; Alberto Márquez 001; María Luz Puertas (Eur. J. Comb., 2008)

On the geodetic and the hull numbers in strong product graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Comput. Math. Appl., 2010)

On the Determining Number and the Metric Dimension of Graphs. - José Cáceres; Delia Garijo; María Luz Puertas; Carlos Seara (Electron. J. Comb., 2010)

Towards a new framework for domination. - José Cáceres; Alberto Márquez 001; María Morales; María Luz Puertas (Comput. Math. Appl., 2011)

On the metric dimension of infinite graphs. - José Cáceres; M. Carmen Hernando; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Discret. Appl. Math., 2012)

Minimal trees and monophonic convexity. - José Cáceres; Ortrud R. Oellermann; María Luz Puertas (Discuss. Math. Graph Theory, 2012)

Combinatorial structures of three vertices and Lie algebras. - José Cáceres; Manuel Ceballos; Juan Núñez 001; María Luz Puertas; Ángel F. Tenorio (Int. J. Comput. Math., 2012)

Locating-dominating codes: Bounds and extremal cardinalities. - José Cáceres; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Appl. Math. Comput., 2013)

The determining number of Kneser graphs. - José Cáceres; Delia Garijo; Antonio González Herrera; Alberto Márquez 001; María Luz Puertas (Discret. Math. Theor. Comput. Sci., 2013)

Resolving sets for Johnson and Kneser graphs. - Robert F. Bailey; José Cáceres; Delia Garijo; Antonio González Herrera; Alberto Márquez 001; Karen Meagher; María Luz Puertas (Eur. J. Comb., 2013)

Graph operations and Lie algebras. - José Cáceres; Manuel Ceballos; Juan Núñez 001; María Luz Puertas; Ángel F. Tenorio (Int. J. Comput. Math., 2013)

The graph distance game and some graph operations. - José Cáceres; María Luz Puertas; Carmen Hernando 001; M. Mora 001; Ignacio M. Pelayo (Electron. Notes Discret. Math., 2014)

Quasiperfect Domination in Trees. - José Cáceres; María Luz Puertas; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo (Electron. Notes Discret. Math., 2015)

Independent [1, 2]-domination of grids via min-plus algebra. - Sahar A. Aleid; José Cáceres; María Luz Puertas (Electron. Notes Discret. Math., 2016)

Shortcut sets for plane Euclidean networks (Extended abstract). - José Cáceres; Delia Garijo; Auxiliadora Moreno-González; Alberto Márquez 001; María Luz Puertas; Paula Ribeiro (Electron. Notes Discret. Math., 2016)

Shortcut sets for the locus of plane Euclidean networks. - José Cáceres; Delia Garijo; Antonio González Herrera; Alberto Márquez 001; María Luz Puertas; Paula Ribeiro (Appl. Math. Comput., 2018)

Strong resolving graphs: The realization and the characterization problems. - Dorota Kuziak; María Luz Puertas; Juan A. Rodríguez-Velázquez; Ismael González Yero (Discret. Appl. Math., 2018)

On independent [1, 2]-sets in trees. - Sahar A. Aleid; José Cáceres; María Luz Puertas (Discuss. Math. Graph Theory, 2018)

General bounds on limited broadcast domination. - José Cáceres; Carmen Hernando 001; Mercè Mora; Ignacio M. Pelayo; María Luz Puertas (Discret. Math. Theor. Comput. Sci., 2018)

Efficient Location of Resources in Cylindrical Networks. - José Juan Carreño; José Antonio Martínez; María Luz Puertas (Symmetry, 2018)

Every grid has an independent [1, 2]-set. - Sahar A. Aleid; José Cáceres; María Luz Puertas (Discret. Appl. Math., 2019)

On Stronger Types of Locating-dominating Codes. - Ville Junnila; Tero Laihonen; Tuomo Lehtila; María Luz Puertas (Discret. Math. Theor. Comput. Sci., 2019)

Robust observer design by sign-stability for the monitoring of population systems. - Inmaculada López; María Luz Puertas; Carmelo Rodríguez; Manuel Gámez; Zoltán Varga (J. Frankl. Inst., 2019)

Powers of Large Matrices on GPU Platforms to Compute the Roman Domination Number of Cylindrical Graphs. - José Antonio Martínez; Ester M. Garzón; María Luz Puertas (IEEE Access, 2021)

On the 2-domination Number of Cylinders with Small Cycles. - Ester M. Garzón; José Antonio Martínez; Juan José Moreno; María Luz Puertas (Fundam. Informaticae, 2022)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs. - Ester M. Garzón; José Antonio Martínez; Juan José Moreno; María Luz Puertas (J. Supercomput., 2022)

The 2-domination number of cylindrical graphs. - José Antonio Martínez; Ana Belén Castaño-Fernández; María Luz Puertas (Comput. Appl. Math., 2022)

On the metric dimensions for sets of vertices. - Anni Hakanen; Ville Junnila; Tero Laihonen; María Luz Puertas (Discuss. Math. Graph Theory, 2023)

Elimination properties for minimal dominating sets of graphs. - Jaume Martí-Farré; Mercè Mora; María Luz Puertas; José Luis Ruiz (Discuss. Math. Graph Theory, 2023)