Alfredo García Olaverri

发表

Lower bounds for the number noncrossing free subgraphs of Kn

Marc Noy, Alfredo García Olaverri, Javier Tejel, 1995, CCCG.

Blocking the $$k$$k-Holes of Point Sets in the Plane

Javier Cano, Jorge Urrutia, Toshinori Sakai, 2015, Graphs Comb..

Compatible geometric matchings

Sergey Bereg, Jorge Urrutia, David R. Wood, 2007, Comput. Geom..

On the minimum size of visibility graphs

Marc Noy, Ferran Hurtado, Alfredo García Olaverri, 2002, Inf. Process. Lett..

Moving coins

Sergey Bereg, Manuel Abellanas, Ferran Hurtado, 2006, Comput. Geom..

Lower bounds on the number of crossing-free subgraphs of KN

Marc Noy, Alfredo García Olaverri, Javier Tejel, 2000, Comput. Geom..

Augmenting the Connectivity of Outerplanar Graphs

Marc Noy, Ferran Hurtado, Alfredo García Olaverri, 2008, Algorithmica.

Geometric Biplane Graphs II: Graph Augmentation

Csaba D. Tóth, Matias Korman, Ferran Hurtado, 2015, Graphs Comb..

A note on the traveling repairman problem

Alfredo García Olaverri, Javier Tejel, Pedro Jodrá, 2002, Networks.

Compatible spanning trees

Ferran Hurtado, Alfredo García Olaverri, Javier Tejel, 2014, Comput. Geom..

On embedding triconnected cubic graphs on point sets

Pavel Valtr, Ferran Hurtado, Alfredo García Olaverri, 2007, Electron. Notes Discret. Math..

On Local Transformations in Plane Geometric Graphs Embedded on Small Grids

Prosenjit Bose, Manuel Abellanas, Ferran Hurtado, 2004, ICCSA.

The order of points on the second convex hull of a simple polygon

Alfredo García Olaverri, Javier Tejel, J. Tejel, 1995, Discret. Comput. Geom..

Packing trees into planar graphs

Marc Noy, Ferran Hurtado, Alfredo García Olaverri, 2002, J. Graph Theory.

On dynamic programming with underlying Monge path-decomposable array

Alfredo García Olaverri, Pedro Jodrá Esteban, Francisco Javier Tejel Altarriba, 2002 .

An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays

Alfredo García Olaverri, Javier Tejel, Pedro Jodrá, 1998, Inf. Process. Lett..

Using Total Monotonicity for Two Optimization Problems on the Plane

Alfredo García Olaverri, Javier Tejel, 1996, Inf. Process. Lett..

Packing trees into planar graphs

Marc Noy, Ferran Hurtado, Alfredo García Olaverri, 1997, J. Graph Theory.

On triconnected and cubic plane graphs on given point sets

Pavel Valtr, Ferran Hurtado, Alfredo García Olaverri, 2009, Comput. Geom..

Configurations of Non-crossing Rays and Related Problems

Jorge Urrutia, Ferran Hurtado, Alfredo García Olaverri, 2016, Discret. Comput. Geom..

Geometric Biplane Graphs I: Maximal Graphs

Csaba D. Tóth, Matias Korman, Ferran Hurtado, 2015, Graphs Comb..

Compatible geometric matchings

Sergey Bereg, Jorge Urrutia, David R. Wood, 2009, Comput. Geom..

Augmenting the Rigidity of a Graph in R2

Alfredo García Olaverri, Javier Tejel, J. Tejel, 2011, Algorithmica.

Colored Ray Configurations pdf

Jorge Urrutia, Pablo Pérez-Lantero, Ferran Hurtado, 2018, CCCG.

Polynomially solvable cases of the bipartite traveling salesman problem

Alfredo García Olaverri, Javier Tejel, J. Tejel, 2017, Eur. J. Oper. Res..

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

Alfredo García Olaverri, Javier Tejel, Pedro Jodrá, 2011, Algorithmica.

On Hamiltonian alternating cycles and paths pdf

Alfredo García Olaverri, Javier Tejel, Mercè Claverol, 2018, Comput. Geom..

On Local Transformations in Plane Geometric Graphs Embedded on Small Grids

Prosenjit Bose, Manuel Abellanas, Ferran Hurtado, 2004, ICCSA.

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

Alfredo García Olaverri, Javier Tejel, 1998, Ars Comb..

Augmenting the connectivity of geometric graphs

Jorge Urrutia, Manuel Abellanas, Ferran Hurtado, 2008, Comput. Geom..

Compatible matchings in geometric graphs

Oswin Aichholzer, Alfredo García Olaverri, Fernando Alfredo Hurtado Díaz, 2011 .

On 4-connected geometric graphs

Pavel Valtr, Alfredo García Olaverri, Clemens Huemer, 2013 .

Drawings of the complete graph

Alfredo García Olaverri, Sergio Ferrer Benedí, 2018 .