María Ángeles Garrido

According to our database, María Ángeles Garrido authored at least 9 papers between 1997 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Minimum gradation in greyscales of graphs.

Natalia de Castro, María Ángeles Garrido, Rafael Robles, María Trinidad Villar-Liñán

Discret. Optim., May, 2023

2020

Contrast in greyscales of graphs.

Natalia de Castro, María Ángeles Garrido-Vizuete, Rafael Robles, María Trinidad Villar-Liñán

J. Comb. Optim., 2020

2014

Monochromatic geometric k-factors for bicolored point sets with auxiliary points.

Delia Garijo, María Ángeles Garrido, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González, José Ramón Portillo, Pedro Reyes, Rafael Robles, Jesus Valenzuela

Inf. Process. Lett., 2014

2012

Cover Contact Graphs.

Nieves Atienza, Natalia de Castro, Carmen Cortés, María Ángeles Garrido, Clara I. Grima, Carlos G. Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff

J. Comput. Geom., 2012

Reporting Bichromatic Segment Intersections from Point Sets.

Carmen Cortés, Delia Garijo, María Ángeles Garrido, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González, Jesus Valenzuela, Maria Trinidad Villar

Int. J. Comput. Geom. Appl., 2012

2009

Monochromatic geometric k-factors in red-blue sets with white and Steiner points.

Delia Garijo, María Ángeles Garrido, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González, José Ramón Portillo, Pedro Reyes, Rafael Robles, Jesus Valenzuela

Electron. Notes Discret. Math., 2009

2002

Single bend wiring on surfaces.

María Ángeles Garrido, Alberto Márquez, Aurora Morgana, José Ramón Portillo

Discret. Appl. Math., 2002

2001

Labeling Subway Lines.

María Ángeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1997

Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is NP-hard.

María Ángeles Garrido, Alberto Márquez

Proceedings of the Graph Drawing, 5th International Symposium, 1997