The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
1997, volume: 17, number: 4

  1. Piotr Berman, Bhaskar DasGupta
    Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:331-356 [Journal]
  2. Elon Rimon
    Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For? [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:357-379 [Journal]
  3. Marco Pellegrini
    On Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:380-398 [Journal]
  4. Yijie Han, Victor Y. Pan, John H. Reif
    Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:399-415 [Journal]
  5. Sergio De Agostino, Rossella Petreschi, Andrea Sterbini
    An O(n³) Recognition Algorithm for Bithreshold Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:416-425 [Journal]
  6. Susanne E. Hambrusch, Hung-Yi Tu
    New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:426-448 [Journal]
  7. Noga Alon, Aravind Srinivasan
    Improved Parallel Approximation of a Class of Integer Programming Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:449-462 [Journal]
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