Alfredo García Olaverri - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2021

On plane subgraphs of complete topological drawingsAlfredo García Olaverri, Javier Tejel Altarriba, Alexander Pilz. arsmc, 20(1):69-87, 2021. [doi]

2020

Plane augmentation of plane graphs to meet parity constraintsJuan C. Catana-Salazar, Alfredo García Olaverri, Javier Tejel, Jorge Urrutia. amc, 386:125513, 2020. [doi]

2018

2017

Polynomially solvable cases of the bipartite traveling salesman problemAlfredo García Olaverri, Javier Tejel. eor, 257(2):429-438, 2017. [doi]

2016

Configurations of Non-crossing Rays and Related ProblemsAlfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia. dcg, 55(3):522-549, 2016. [doi]

2015

2014

Colored Ray ConfigurationsRuy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia. cccg 2014: [doi]

Compatible spanning treesAlfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Javier Tejel. comgeo, 47(5):563-584, 2014. [doi]

2011

Augmenting the Rigidity of a Graph in ::::R:::::::2:::Alfredo García Olaverri, Javier Tejel. algorithmica, 59(2):145-168, 2011. [doi]

2008

Augmenting the connectivity of geometric graphsManuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia. comgeo, 40(3):220-230, 2008. [doi]

On local transformations in plane geometric graphs embedded on small gridsManuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro Ramos, Eduardo Rivera-Campo, Javier Tejel. comgeo, 39(2):65-77, 2008. [doi]

2006

Moving coinsManuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel. comgeo, 34(1):35-48, 2006. [doi]

2004

On Local Transformations in Plane Geometric Graphs Embedded on Small GridsManuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro A. Ramos, Eduardo Rivera-Campo, Javier Tejel. iccsa 2004: 22-31 [doi]

2002

On the minimum size of visibility graphsAlfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel. ipl, 81(4):223-230, 2002. [doi]

A note on the traveling repairman problemAlfredo García Olaverri, Pedro Jodrá, Javier Tejel. networks, 40(1):27-31, 2002. [doi]

2000

Lower bounds on the number of crossing-free subgraphs of K::N::Alfredo García Olaverri, Marc Noy, Javier Tejel. comgeo, 16(4):211-221, 2000.

1998

A Lower Bound for the Number of Polygonizations of N Points in the PlaneAlfredo García Olaverri, Javier Tejel. arscom, 49, 1998.

An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional ArraysAlfredo García Olaverri, Pedro Jodrá, Javier Tejel. ipl, 68(1):3-9, 1998. [doi]

1997

Packing Trees into Planar GraphsAlfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel. gd 1997: 383-390

1996

Using Total Monotonicity for Two Optimization Problems on the PlaneAlfredo García Olaverri, Javier Tejel. ipl, 60(1):13-17, 1996. [doi]

1995

The Order of Points on the Second Convex Hull of a Simple PolygonAlfredo García Olaverri, Javier Tejel. dcg, 14(2):185-205, 1995.

nAlfredo García Olaverri, Marc Noy, Javier Tejel. cccg 1995: 97-102 [doi]

Sign in or sign up to see more results.

runs on WebDSL