Dilation-free graphs in the l1 metric. - José Cáceres; Clara I. Grima; Alberto Márquez 001; Auxiliadora Moreno-González (Networks, 2007)

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)

Local refinement based on the 7-triangle longest-edge partition. - Angel Plaza; Alberto Márquez 001; Auxiliadora Moreno-González; José P. Suárez (Math. Comput. Simul., 2009)

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)

Cover Contact Graphs. - Nieves Atienza; Natalia de Castro; Carmen Cortés; María Ángeles Garrido 001; Clara I. Grima; Carlos G. Hernández; Alberto Márquez 001; Auxiliadora Moreno-González; Martin Nöllenburg; José Ramón Portillo; Pedro Reyes; Jesus Valenzuela; et al. (J. Comput. Geom., 2012)

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)

There are simple and robust refinements (almost) as good as Delaunay. - Alberto Márquez 001; Auxiliadora Moreno-González; Ángel Plaza; José P. Suárez (Math. Comput. Simul., 2014)

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)