Journals in DBLP

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

1. David Pokrass Jacobs, Robert E. Jamison
   Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:201-208 [Journal]
   
2. Fabrizio Grandoni
   A note on the complexity of minimum dominating set. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:209-214 [Journal]
   
3. E. C. Park, Ian F. Blake
   On the mean number of encryptions for tree-based broadcast encryption schemes. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:215-238 [Journal]
   
4. Carlo Mereghetti, Beatrice Palano
   The complexity of minimum difference cover. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:239-254 [Journal]
   
5. Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jiri Sgall, Tomás Tichý
   Online competitive algorithms for maximizing weighted throughput of unit jobs. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:255-276 [Journal]
   
6. Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano
   CHECKCOL: Improved local search for graph coloring. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:277-298 [Journal]
   
7. Irene Finocchi
   Crossing-constrained hierarchical drawings. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:299-312 [Journal]
   
8. Sabine Cornelsen, Dorothea Wagner
   Completely connected clustered graphs. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:313-323 [Journal]
   
9. Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor Shparlinski
   Testing set proportionality and the Ádám isomorphism of circulant graphs. [Citation Graph (0, 0)][DBLP]
   J. Discrete Algorithms, 2006, v:4, n:2, pp:324-335 [Journal]