The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2002, volume: 34, number: 1

  1. Timothy M. Chan
    A Near-Linear Area Bound for Drawing Binary Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:1-13 [Journal]
  2. Peter C. Fishburn, J. C. Lagarias
    Pinwheel Scheduling: Achievable Densities. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:14-38 [Journal]
  3. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud
    Splitting a Delaunay Triangulation in Linear Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:39-46 [Journal]
  4. Thomas Jansen, Ingo Wegener
    The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:47-66 [Journal]
  5. Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan
    Testing and Spot-Checking of Data Streams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:67-80 [Journal]
  6. Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz
    Realistic Input Models for Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:81-97 [Journal]
  7. R. Ravi, David P. Williamson
    Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:98-107 [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