Lower bounds for the number noncrossing free subgraphs of Kn. - Alfredo García Olaverri; Marc Noy; Javier Tejel (CCCG, 1995)

The Order of Points on the Second Convex Hull of a Simple Polygon. - Alfredo García Olaverri; Javier Tejel (Discret. Comput. Geom., 1995)

Using Total Monotonicity for Two Optimization Problems on the Plane. - Alfredo García Olaverri; Javier Tejel (Inf. Process. Lett., 1996)

A Lower Bound for the Number of Polygonizations of N Points in the Plane. - Alfredo García Olaverri; Javier Tejel (Ars Comb., 1998)

An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays. - Alfredo García Olaverri; Pedro Jodrá; Javier Tejel (Inf. Process. Lett., 1998)

Lower bounds on the number of crossing-free subgraphs of KN. - Alfredo García Olaverri; Marc Noy; Javier Tejel (Comput. Geom., 2000)

On the minimum size of visibility graphs. - Alfredo García Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel (Inf. Process. Lett., 2002)

Packing trees into planar graphs. - Alfredo García Olaverri; M. Carmen Hernando; Ferran Hurtado; Marc Noy; Javier Tejel (J. Graph Theory, 2002)

A note on the traveling repairman problem. - Alfredo García Olaverri; Pedro Jodrá; Javier Tejel (Networks, 2002)

Moving coins. - Manuel Abellanas; Sergey Bereg; Ferran Hurtado; Alfredo García Olaverri; David Rappaport; Javier Tejel (Comput. Geom., 2006)

On embedding triconnected cubic graphs on point sets. - Alfredo García Olaverri; Ferran Hurtado; Clemens Huemer; Javier Tejel; Pavel Valtr 001 (Electron. Notes Discret. Math., 2007)

On local transformations in plane geometric graphs embedded on small grids. - Manuel Abellanas; Prosenjit Bose; Alfredo García Olaverri; Ferran Hurtado; Pedro Ramos 001; Eduardo Rivera-Campo; Javier Tejel (Comput. Geom., 2008)

Augmenting the connectivity of geometric graphs. - Manuel Abellanas; Alfredo García Olaverri; Ferran Hurtado; Javier Tejel; Jorge Urrutia (Comput. Geom., 2008)

Compatible geometric matchings. - Oswin Aichholzer; Sergey Bereg; Adrian Dumitrescu; Alfredo García Olaverri; Clemens Huemer; Ferran Hurtado; Mikio Kano; Alberto Márquez 001; David Rappaport; Shakhar Smorodinsky; Diane L. Souvaine; Jorge Urrutia; et al. (Comput. Geom., 2009)

On triconnected and cubic plane graphs on given point sets. - Alfredo García Olaverri; Ferran Hurtado; Clemens Huemer; Javier Tejel; Pavel Valtr 001 (Comput. Geom., 2009)

Augmenting the Connectivity of Outerplanar Graphs. - Alfredo García Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel (Algorithmica, 2010)

Augmenting the Rigidity of a Graph in R2. - Alfredo García Olaverri; Javier Tejel (Algorithmica, 2011)

Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon. - Alfredo García Olaverri; Pedro Jodrá; Javier Tejel (Algorithmica, 2013)

Compatible spanning trees. - Alfredo García Olaverri; Clemens Huemer; Ferran Hurtado; Javier Tejel (Comput. Geom., 2014)

Blocking the k-Holes of Point Sets in the Plane. - Javier Cano; Alfredo García Olaverri; Ferran Hurtado; Toshinori Sakai; Javier Tejel; Jorge Urrutia (Graphs Comb., 2015)

Geometric Biplane Graphs I: Maximal Graphs. - Alfredo García Olaverri; Ferran Hurtado; Matias Korman; Inês Matos; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Csaba D. Tóth (Graphs Comb., 2015)

Geometric Biplane Graphs II: Graph Augmentation. - Alfredo García Olaverri; Ferran Hurtado; Matias Korman; Inês Matos; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Csaba D. Tóth (Graphs Comb., 2015)

Configurations of Non-crossing Rays and Related Problems. - Alfredo García Olaverri; Ferran Hurtado; Javier Tejel; Jorge Urrutia (Discret. Comput. Geom., 2016)

Polynomially solvable cases of the bipartite traveling salesman problem. - Alfredo García Olaverri; Javier Tejel (Eur. J. Oper. Res., 2017)

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

Colored ray configurations. - Ruy Fabila Monroy; Alfredo García Olaverri; Ferran Hurtado; Rafel Jaume; Pablo Pérez-Lantero; Maria Saumell; Rodrigo I. Silveira; Javier Tejel; Jorge Urrutia (Comput. Geom., 2018)

Plane augmentation of plane graphs to meet parity constraints. - Juan C. Catana-Salazar; Alfredo García Olaverri; Javier Tejel; Jorge Urrutia (Appl. Math. Comput., 2020)

Packing plane spanning trees into a point set. - Ahmad Biniaz; Alfredo García 002 (Comput. Geom., 2020)

On plane subgraphs of complete topological drawings. - Alfredo García Olaverri; Javier Tejel Altarriba; Alexander Pilz (Ars Math. Contemp., 2021)

Total domination in plane triangulations. - Mercè Claverol; Alfredo García 002; Carlos G. Hernández; Carmen Hernando 001; Montserrat Maureso; Mercè Mora; Javier Tejel (Discret. Math., 2021)

Shooting Stars in Simple Drawings of Km, n. - Oswin Aichholzer; Alfredo García 002; Irene Parada; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2022)

Empty Triangles in Generalized Twisted Drawings of Kn. - Alfredo García 002; Javier Tejel; Birgit Vogtenhuber; Alexandra Weinberger (J. Graph Algorithms Appl., 2023)

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. - Oswin Aichholzer; Alfredo García 002; Javier Tejel; Birgit Vogtenhuber; Alexandra Weinberger (Discret. Comput. Geom., 2024)