Homomorphisms and Polynomial Invariants of Graphs. - Delia Garijo; Jaroslav Nesetril; M. P. Revuelta (Electron. Notes Discret. Math., 2007)

Tutte Uniqueness of Locally Grid Graphs. - Delia Garijo; Alberto Márquez 001; M. P. Revuelta (Ars Comb., 2009)

Monochromatic geometric k-factors in red-blue sets with white and Steiner points. - Delia Garijo; María Ángeles Garrido 001; Clara I. Grima; Alberto Márquez 001; Auxiliadora Moreno-González; José Ramón Portillo; Pedro Reyes; Rafael Robles; Jesus Valenzuela (Electron. Notes Discret. Math., 2009)

Graph homomorphisms, the Tutte polynomial and "q-state Potts uniqueness". - Delia Garijo; Andrew J. Goodall; Jaroslav Nesetril (Electron. Notes Discret. Math., 2009)

Hexagonal Tilings: Tutte Uniqueness. - Delia Garijo; Alberto Márquez 001; M. P. Revuelta (Ars Comb., 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)

Stabbers of line segments in the plane. - Mercè Claverol; Delia Garijo; Clara I. Grima; Alberto Márquez 001; Carlos Seara (Comput. Geom., 2011)

Distinguishing graphs by their left and right homomorphism profiles. - Delia Garijo; Andrew J. Goodall; Jaroslav Nesetril (Eur. J. Comb., 2011)

Contractors for flows. - Delia Garijo; Andrew J. Goodall; Jaroslav Nesetril (Electron. Notes Discret. Math., 2011)

Minimizing the error of linear separators on linearly inseparable data. - Boris Aronov; Delia Garijo; Yurai Núñez Rodríguez; David Rappaport; Carlos Seara; Jorge Urrutia (Discret. Appl. Math., 2012)

Separability of Point Sets by k-Level Linear Classification Trees. - Esther M. Arkin; Delia Garijo; Alberto Márquez 001; Joseph S. B. Mitchell; Carlos Seara (Int. J. Comput. Geom. Appl., 2012)

Reporting Bichromatic Segment Intersections from Point Sets. - Carmen Cortés; Delia Garijo; María Ángeles Garrido 001; Clara I. Grima; Alberto Márquez 001; Auxiliadora Moreno-González; Jesus Valenzuela; Maria Trinidad Villar (Int. J. Comput. Geom. Appl., 2012)

On the metric dimension, the upper dimension and the resolving number of graphs. - Delia Garijo; Antonio González Herrera; Alberto Márquez 001 (Discret. Appl. Math., 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)

The resolving number of a graph. - Delia Garijo; Antonio González Herrera; Alberto Márquez 001 (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)

Computing the Tutte polynomial of Archimedean tilings. - Delia Garijo; M. E. Gegúndez; Alberto Márquez 001; Maria Pastora Revuelta Marchena; F. Sagols (Appl. Math. Comput., 2014)

The difference between the metric dimension and the determining number of a graph. - Delia Garijo; Antonio González Herrera; Alberto Márquez 001 (Appl. Math. Comput., 2014)

On the number of BB-flows of a graph. - Delia Garijo; Andrew J. Goodall; Jaroslav Nesetril (Eur. J. Comb., 2014)

Monochromatic geometric k-factors for bicolored point sets with auxiliary points. - Delia Garijo; María Ángeles Garrido 001; Clara I. Grima; Alberto Márquez 001; Auxiliadora Moreno-González; José Ramón Portillo; Pedro Reyes; Rafael Robles; Jesus Valenzuela (Inf. Process. Lett., 2014)

Polynomial graph invariants from homomorphism numbers. - Delia Garijo; Andrew J. Goodall; Jaroslav Nesetril (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)

Stabbing segments with rectilinear objects. - Mercè Claverol; Delia Garijo; Matias Korman; Carlos Seara; Rodrigo I. Silveira (Appl. Math. Comput., 2017)

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)

On Hamiltonian alternating cycles and paths. - Mercè Claverol; Alfredo García Olaverri; Delia Garijo; Carlos Seara; Javier Tejel (Comput. Geom., 2018)

Preface. - Delia Garijo; Alberto Márquez 001; Oriol Serra (Electron. Notes Discret. Math., 2018)

Computing optimal shortcuts for networks. - Delia Garijo; Alberto Márquez 001; Natalia Rodríguez; Rodrigo I. Silveira (Eur. J. Oper. Res., 2019)

Continuous mean distance of a weighted graph. - Delia Garijo; Alberto Márquez 001; Rodrigo I. Silveira (CoRR, 2021)

New results on the robust coloring problem. - Delia Garijo; Alberto Márquez 001; Rafael Robles (CoRR, 2022)

Homomorphisms between graphs embedded in surfaces. - Delia Garijo; Andrew J. Goodall; Lluís Vena (Eur. J. Comb., 2024)

Algorithms for Distance Problems in Continuous Graphs. - Sergio Cabello; Delia Garijo; Antonia Kalb; Fabian Klute; Irene Parada; Rodrigo I. Silveira (WADS, 2025)