
Journals in DBLP
 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:124 [Journal]
 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:2550 [Journal]
 Philipp Woelfel
Symbolic topological sorting with OBDDs. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:1, pp:5171 [Journal]
 Amotz BarNoy, Justin Goshi, Richard E. Ladner
Offline and online guaranteed startup delay for MediaonDemand with stream merging. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:1, pp:72105 [Journal]
 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:106141 [Journal]
 Takehiro Ito, Xiao Zhou, Takao Nishizeki
Partitioning a graph of bounded treewidth to connected subgraphs of almost uniform size. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:1, pp:142154 [Journal]
 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:155167 [Journal]
 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:168180 [Journal]
 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:181199 [Journal]
