Alfredo García Olaverri                                                             
 

 

Address Research interests Publications Some interesting links

 

 ADDRESS

Departamento de Métodos Estadísticos
Edificio B. Facultad de Ciencias. Universidad de Zaragoza.
Pedro Cerbuna 12, 50009 Zaragoza (Spain)
Tfno:  34 976 761000 Ext. 3255            Fax:  34 976 761115           e-mail: olaverri@unizar.es

 RESEARCH INTERESTS

  • Discrete and Computational Geometry
  • Combinatorial Optimization
  • Graph Theory

 LIST OF PUBLICATIONS

 
  • Moving Coins. Manuel Abellanas, Ferran Hurtado, Alfredo Garcia Olaverri, David Rappaport, Javier Tejel.
    Japan Conference on Discrete and Computational Geometry  2004, to appear in LNCS.
  • On local transformations in plane geometric graphs embedded on small grids. M. Abellanas, P. Bose, A. García, F. Hurtado, P. Ramos, E. Rivera, J. Tejel.
    Proc. International Conference on Computational Science and its Applications ICCSA 2004, LNCS 3045, pp. 22-31, 2004.
  • Augmenting the connectivity of outerplanar graphs. Alfredo García Olaverri, Ferran Hurtado, Marc Noy and Javier Tejel.
    Submitted to Journal of Algorithms.
  • The asymptotic number of spanning trees in d-dimensional square lattices. Alfredo García Olaverri, Marc Noy and Javier Tejel.
    J. Combin. Math. Combin. Comput. Vol. 40, pp. 109-113, 2003.
  • On the minimum size of visibility graphs. Alfredo García Olaverri, Ferran Hurtado, Marc Noy and Javier Tejel.
    Information Processing Letter. Vol. 81, pp. 223-230, 2002.
  • Packing trees into planar graphs. Alfredo García Olaverri, Carmen Hernando, Ferran Hurtado, Marc Noy and Javier Tejel.
    Journal of Graph Theory Vol. 40, Issue 3, pp. 172-181, 2002.
  • A note on the traveling repairman problem.Alfredo García Olaverri, Pedro Jodrá  and Javier Tejel.
    Networks Vol. 40, Issue 1, pp. 27-31, 2002.
  • Lower bounds on the number of crossing-free subgraphs of K_N.Alfredo García Olaverri, Marc Noy and Javier Tejel.
    Comput. Geom. Theory and Applications Vol. 16, Issue 4, pp. 211-221, 2000.
  • An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays.Alfredo García Olaverri, Pedro Jodrá and Javier Tejel.
    Information Processing Letters Vol. 68, pp. 3-9, 1998.
  • A lower bound for the number of polygonizations of n points in the plane.Alfredo García Olaverri and Javier Tejel.
    Ars Combinatoria Vol. 49, pp. 3-19, 1998.
  •  The two-comvex-polygons TSP: a solvable case.Alfredo García Olaverri and Javier Tejel.
    TOP Vol. 5, Issue 1, pp. 105-126, 1997.
  • Using total monotonicity for two optimization problems on the plane.Alfredo García Olaverri and Javier Tejel.
    Information Processing Letters Vol. 60, pp. 13-17, 1996.
  • The order of points on the second convex hull of a simple polygon.Alfredo García Olaverri and Javier Tejel.
    Discrete Comput. Geometry Vol. 14, pp. 185-205, 1995.

 

 SOME INTERESTING LINKS