The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2001, volume: 29, number: 4

  1. Teofilo F. Gonzalez
    Simple Algorithms for Multimessage Multicasting with Forwarding. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:511-533 [Journal]
  2. Hans L. Bodlaender, Babette van Antwerpen-de Fluiter
    Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:534-559 [Journal]
  3. Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
    Algorithms for the On-Line Travelling Salesman. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:560-581 [Journal]
  4. Santosh N. Kabadi, Yash P. Aneja
    Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:582-594 [Journal]
  5. Reuven Bar-Yehuda, Dror Rawitz
    Efficient Algorithms for Integer Programs with Two Variables per Constraint. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:595-609 [Journal]
  6. Roberto Battiti, Marco Protasi
    Reactive Local Search for the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:610-637 [Journal]
  7. J. F. Weng, J. MacGregor Smith
    Steiner Minimal Trees with One Polygonal Obstacle. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:638-648 [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