#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1983

2019

- This year (5)
- Last 5 years (24)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas
- Discrete Mathematics
- 2005

- Oswin Aichholzer, Sergey Bereg, +10 authors David R. Wood
- Comput. Geom.
- 2009

This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result… (More)

We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method… (More)

- Clara I. Grima, Alberto Márquez, Lidia M. Ortega
- Comput. Geom.
- 2006

- Clara I. Grima, Alberto Márquez
- Springer Netherlands
- 2001

Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a problem that arises when… (More)

- José Cáceres, Alberto Márquez, María Morales, María Luz Puertas
- Computers & Mathematics with Applications
- 2011

Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding different mathematical frameworks where domination notions naturally arise,… (More)

- José Cáceres, Alberto Márquez, María Luz Puertas
- Eur. J. Comb.
- 2008

We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known class of HHD-free graphs. For this graph class, we prove that any Steiner… (More)