Journals in DBLP

J. Discrete Algorithms
2006, volume: 4, number: 1

1. Alexandros V. Gerbessiotis
   An architecture independent study of parallel segment trees. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:1-24 [Journal]
   
2. Janet M. Six, Ioannis G. Tollis
   A framework and algorithms for circular drawings of graphs. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:25-50 [Journal]
   
3. Philipp Woelfel
   Symbolic topological sorting with OBDDs. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:51-71 [Journal]
   
4. Amotz Bar-Noy, Justin Goshi, Richard E. Ladner
   Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:72-105 [Journal]
   
5. George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis
   Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:106-141 [Journal]
   
6. Takehiro Ito, Xiao Zhou, Takao Nishizeki
   Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:142-154 [Journal]
   
7. Igor E. Zverovich, Olga I. Zverovich
   Polar SAT and related graphs. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:155-167 [Journal]
   
8. Sébastien Desreux, Eric Rémila
   An optimal algorithm to generate tilings. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:168-180 [Journal]
   
9. Thomas Jansen, Ingo Wegener
   On the analysis of a dynamic evolutionary algorithm. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:1, pp:181-199 [Journal]