Journals in DBLP

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

1. Kazuhisa Makino
   A linear time algorithm for recognizing regular Boolean functions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:43, n:2, pp:155-176 [Journal]
   
2. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
   Fast broadcasting and gossiping in radio networks. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:43, n:2, pp:177-189 [Journal]
   
3. Hans L. Bodlaender, Fedor V. Fomin
   Approximation of pathwidth of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:43, n:2, pp:190-200 [Journal]
   
4. Uriel Feige, Marek Karpinski, Michael Langberg
   Improved approximation of Max-Cut on graphs of bounded degree. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:43, n:2, pp:201-219 [Journal]
   
5. Richard Edwin Stearns, Harry B. Hunt III
   Exploiting structure in quantified formulas. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:43, n:2, pp:220-263 [Journal]
   
6. David Liben-Nowell
   Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:43, n:2, pp:264-283 [Journal]