The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alfredo García Olaverri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel
    Packing Trees into Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:383-390 [Conf]
  2. Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro A. Ramos, Eduardo Rivera-Campo, Javier Tejel
    On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2004, pp:22-31 [Conf]
  3. Alfredo García Olaverri, Javier Tejel
    A Lower Bound for the Number of Polygonizations of N Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  4. Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
    Moving coins. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:35-48 [Journal]
  5. Alfredo García Olaverri, Marc Noy, Javier Tejel
    Lower bounds on the number of crossing-free subgraphs of KN. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:211-221 [Journal]
  6. Alfredo García Olaverri, Javier Tejel
    The Order of Points on the Second Convex Hull of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:2, pp:185-205 [Journal]
  7. Alfredo García Olaverri, Pedro Jodrá, Javier Tejel
    An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:1, pp:3-9 [Journal]
  8. Alfredo García Olaverri, Javier Tejel
    Using Total Monotonicity for Two Optimization Problems on the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:1, pp:13-17 [Journal]
  9. Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel
    On the minimum size of visibility graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:4, pp:223-230 [Journal]
  10. Alfredo García Olaverri, Pedro Jodrá, Javier Tejel
    A note on the traveling repairman problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:1, pp:27-31 [Journal]

  11. Augmenting the Connectivity of Outerplanar Graphs. [Citation Graph (, )][DBLP]


  12. On local transformations in plane geometric graphs embedded on small grids. [Citation Graph (, )][DBLP]


  13. Augmenting the connectivity of geometric graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002