Journals in DBLP

Discrete Mathematics & Theoretical Computer Science
2006, volume: 8, number: 1

1. Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
   New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:1-16 [Journal]
   
2. R. Balasubramanian, C. R. Subramanian
   On Sampling Colorings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:17-30 [Journal]
   
3. Ludger Rüschendorf, Ralf Neininger
   Survey of Multivariate Aspects of the Contraction Method. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:31-56 [Journal]
   
4. Mekkia Kouider, Preben D. Vestergaard
   Generalized connected domination in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:57-64 [Journal]
   
5. Stavros D. Nikolopoulos, Leonidas Palios
   Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:65-82 [Journal]
   
6. Jakob Grue Simonsen
   On the Computability of the Topological Entropy of Subshifts. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:83-96 [Journal]
   
7. Ed Hong
   The Online Specialization Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:97-120 [Journal]
   
8. Alan Frieze, Juan Vera
   On randomly colouring locally sparse graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:121-128 [Journal]
   
9. Hui Rao, Yu-Mei Xue
   Tile Z² with translations of one set. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:129-140 [Journal]
   
10. Tiziana Calamoneri
    Optimal L(h, k)-Labeling of Regular Grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:141-158 [Journal]
    
11. Mustapha Kchikech, Olivier Togni
    Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:159-172 [Journal]
    
12. Andreas Brandstädt, Tilo Klembt, Suhail Mahfud
    P₆- and triangle-free graphs revisited: structure and bounded clique-width. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:173-188 [Journal]
    
13. Sylvie Corteel, Guy Louchard, Robin Pemantle
    Common intervals in permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:189-214 [Journal]
    
14. Arnold Knopfmacher, Helmut Prodinger
    The first descent in samples of geometric random variables and permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:215-234 [Journal]
    
15. Stavros D. Nikolopoulos, Charis Papadopoulos
    On the number of spanning trees of K_n^m±G graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:235-248 [Journal]
    
16. Samy Abbes
    A Cartesian closed category of event structures with quotients. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:249-272 [Journal]
    
17. Helmut Prodinger
    d-records in geometrically distributed random variables. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:273-284 [Journal]
    
18. Toufik Mansour, Basel Sirhan
    Counting l-letter subwords in compositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:285-298 [Journal]
    
19. Bao-Xing Chen, Ji-Xiang Meng, Wenjun Xiao
    Some new optimal and suboptimal infinite families of undirected double-loop networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:299-312 [Journal]