Journals in DBLP

Discrete Mathematics & Theoretical Computer Science
2005, volume: 7, number: 1

1. Arthur Holshouser, Harold Reiter
   Two Pile Move-Size Dynamic Nim. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:1-10 [Journal]
   
2. Mohamud Mohammed
   Infinite families of accelerated series for some classical constants by the Markov-WZ Method. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:11-24 [Journal]
   
3. L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian
   Graphs of low chordality. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:25-36 [Journal]
   
4. David R. Wood
   Acyclic, Star and Oriented Colourings of Graph Subdivisions. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:37-50 [Journal]
   
5. Gérard Duchamp, Hatem Hadj Kacem, Éric Laugerotte
   Algebraic elimination of epsilon-transitions. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:51-70 [Journal]
   
6. Mike D. Atkinson
   Some equinumerous pattern-avoiding classes of permutations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:71-74 [Journal]
   
7. Chunhui Lai
   An extremal problem on potentially K_{p, 1, 1} -graphic sequences. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:75-80 [Journal]
   
8. Shunji Ito, Hiromi Ei
   Tilings from some non-irreducible, Pisot substitutions. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:81-122 [Journal]
   
9. Ana M. Breda, Altino F. Santos
   Dihedral f-tilings of the sphere by rhombi and triangles. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:123-140 [Journal]
   
10. Nesrine Abbas, Joseph C. Culberson, Lorna Stewart
    Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:141-154 [Journal]
    
11. Vida Dujmovic, David R. Wood
    Stacks, Queues and Tracks: Layouts of Graph Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:155-202 [Journal]
    
12. Mohammad Hosseini Dolama, Eric Sopena
    On the maximum average degree and the incidence chromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:203-216 [Journal]
    
13. Kumar Neeraj Verma, Jean Goubault-Larrecq
    Karp-Miller Trees for a Branching Extension of VASS. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:217-230 [Journal]
    
14. Stavros D. Nikolopoulos, Leonidas Palios
    On the Recognition of Bipolarizable and P₄-simplicial Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:231-254 [Journal]
    
15. David R. Wood
    Queue Layouts of Graph Products and Powers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:255-268 [Journal]
    
16. Shigeki Akiyama, Nertila Gjini
    Connectedness of number theoretical tilings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:269-312 [Journal]
    
17. Charles Knessl, Wojciech Szpankowski
    Enumeration of Binary Trees and Universal Types. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:313-400 [Journal]