The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
2002, volume: 45, number: 2

  1. Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan
    Wavelength rerouting in optical networks, or the Venetian Routing problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:93-125 [Journal]
  2. Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi
    Diagnosability of regular systems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:126-143 [Journal]
  3. David R. Wood
    Degree constrained book embeddings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:144-154 [Journal]
  4. Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen
    A constructive enumeration of fusenes and benzenoids. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:155-166 [Journal]
  5. Klaus Jansen, Lorant Porkolab
    Polynomial time approximation schemes for general multiprocessor job shop scheduling. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:167-191 [Journal]
  6. Tomás Feder, Rajeev Motwani
    Worst-case time bounds for coloring and satisfiability problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:192-201 [Journal]
  7. Maurice Queyranne, Maxim Sviridenko
    A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:2, pp:202-212 [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