Alfredo García Olaverri

According to our database, Alfredo García Olaverri authored at least 28 papers between 1995 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

On plane subgraphs of complete topological drawings.

Alfredo García Olaverri, Javier Tejel Altarriba, Alexander Pilz

Ars Math. Contemp., 2021

2020

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

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

On Hamiltonian alternating cycles and paths.

Mercè Claverol, Alfredo García Olaverri, Delia Garijo, Carlos Seara, Javier Tejel

Comput. Geom., 2018

2017

Polynomially solvable cases of the bipartite traveling salesman problem.

Alfredo García Olaverri, Javier Tejel

Eur. J. Oper. Res., 2017

2016

Configurations of Non-crossing Rays and Related Problems.

Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia

Discret. Comput. Geom., 2016

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

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

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

2014

Compatible spanning trees.

Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Javier Tejel

Comput. Geom., 2014

2013

Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon.

Alfredo García Olaverri, Pedro Jodrá, Javier Tejel

Algorithmica, 2013

2011

Augmenting the Rigidity of a Graph in <i>R</i>².

Alfredo García Olaverri, Javier Tejel

Algorithmica, 2011

2010

Augmenting the Connectivity of Outerplanar Graphs.

Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel

Algorithmica, 2010

2009

On triconnected and cubic plane graphs on given point sets.

Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr

Comput. Geom., 2009

2008

Compatible Geometric Matchings.

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood

Electron. Notes Discret. Math., 2008

Augmenting the connectivity of geometric graphs.

Manuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia

Comput. Geom., 2008

On local transformations in plane geometric graphs embedded on small grids.

Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro Ramos, Eduardo Rivera-Campo, Javier Tejel

Comput. Geom., 2008

2007

On embedding triconnected cubic graphs on point sets.

Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr

Electron. Notes Discret. Math., 2007

2006

Moving coins.

Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel

Comput. Geom., 2006

2002

A note on the traveling repairman problem.

Alfredo García Olaverri, Pedro Jodrá, Javier Tejel

Networks, 2002

Packing trees into planar graphs.

Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel

J. Graph Theory, 2002

On the minimum size of visibility graphs.

Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel

Inf. Process. Lett., 2002

2000

Lower bounds on the number of crossing-free subgraphs of K_N.

Alfredo García Olaverri, Marc Noy, Javier Tejel

Comput. Geom., 2000

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

A Lower Bound for the Number of Polygonizations of N Points in the Plane.

Alfredo García Olaverri, Javier Tejel

Ars Comb., 1998

1996

Using Total Monotonicity for Two Optimization Problems on the Plane.

Alfredo García Olaverri, Javier Tejel

Inf. Process. Lett., 1996

1995

The Order of Points on the Second Convex Hull of a Simple Polygon.

Alfredo García Olaverri, Javier Tejel

Discret. Comput. Geom., 1995

Lower bounds for the number noncrossing free subgraphs of K_n.

Alfredo García Olaverri, Marc Noy, Javier Tejel

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995