|
Journals in DBLP
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
|