The SCEAS System
Navigation Menu

Journals in DBLP

J. Discrete Algorithms
2003, volume: 1, number: 3-4

  1. Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek
    Directed acyclic subsequence graph - Overview. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:255-280 [Journal]
  2. Serafino Cicerone, Gabriele Di Stefano
    (k, +)-distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:281-302 [Journal]
  3. Fabrizio d'Amore, Fabio Iacobini
    On-line algorithms for networks of temporal constraints. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:303-312 [Journal]
  4. Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
    Approximate string matching on Ziv-Lempel compressed text. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:313-338 [Journal]
  5. Vojtech Bálint
    The non-approximability of bicriteria network design problems. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:339-355 [Journal]
  6. David E. Daykin, Jacqueline W. Daykin
    Lyndon-like and V-order factorizations of strings. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:357-365 [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