Journals in DBLP

J. Algorithms
1999, volume: 32, number: 2

1. Paola Bonizzoni, Gianluca Della Vedova
   An Algorithm for the Modular Decomposition of Hypergraphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:2, pp:65-86 [Journal]
   
2. J. Scott Provan, Roger C. Burk
   Two-Connected Augmentation Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:2, pp:87-107 [Journal]
   
3. Joseph Gil, Alon Itai
   How to Pack Trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:2, pp:108-132 [Journal]
   
4. Nils Klarlund
   An n log n Algorithm for Online BDD Refinement. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:2, pp:133-154 [Journal]
   
5. Ming Li, Louxin Zhang
   Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:2, pp:155-166 [Journal]
   
6. Hans L. Bodlaender, Dimitrios M. Thilikos
   Graphs with Branchwidth at Most Three. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:2, pp:167-194 [Journal]
   
7. Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
   Bounding the Compression Loss of the FGK Algorithm. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:2, pp:195-211 [Journal]