Journals in DBLP

Theor. Comput. Sci.
2004, volume: 319, number: 1-3

1. Laurent Vuillon
   Foreword: Combinatorics of the Discrete Plane and Tilings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:1- [Journal]
   
2. Michael Korn, Igor Pak
   Tilings of rectangles with T-tetrominoes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:3-27 [Journal]
   
3. Eric Kuo
   Applications of graphical condensation for enumerating matchings and tilings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:29-57 [Journal]
   
4. Olivier Bodini, Eric Rémila
   Tilings with trichromatic colored-edges triangles. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:59-70 [Journal]
   
5. Nicolas Destainville, R. Mosseri, F. Bailly
   A formula for the number of tilings of an octagon by rhombi. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:71-81 [Journal]
   
6. Sébastien Desreux, Martín Matamala, Ivan Rapaport, Eric Rémila
   Domino tilings and related models: space of configurations of domains with holes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:83-101 [Journal]
   
7. Francis Oger
   Algebraic and model-theoretic properties of tilings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:103-126 [Journal]
   
8. Jean-Charles Delvenne, Vincent D. Blondel
   Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:127-143 [Journal]
   
9. Pierre Arnoux, Valérie Berthé, Anne Siegel
   Two-dimensional iterated morphisms and discrete planes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:319, n:1-3, pp:145-176 [Journal]
   
10. Valérie Berthé, Robert Tijdeman
    Lattices and multi-dimensional words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:177-202 [Journal]
    
11. Valentin E. Brimkov, Reneta P. Barneva
    Connectivity of discrete planes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:203-227 [Journal]
    
12. Anthony Quas, Luca Q. Zamboni
    Periodicity and local complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:229-240 [Journal]
    
13. E. O. Harriss, J. S. W. Lamb
    Canonical substitutions tilings of Ammann-Beenker type. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:241-279 [Journal]
    
14. Avi Elkharrat, Christiane Frougny, Jean-Pierre Gazeau, Jean-Louis Verger-Gaugry
    Symmetry groups for beta-lattices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:281-305 [Journal]
    
15. Peter J. Grabner, Clemens Heuberger, Helmut Prodinger
    Distribution results for low-weight binary representations for pairs of integers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:307-331 [Journal]
    
16. Svjetlan Feretic
    A q-enumeration of convex polyominoes by the festoon approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:333-356 [Journal]
    
17. Zoltán Füredi, Jeong-Hyun Kang
    Distance graph on Zⁿwith norm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:357-366 [Journal]
    
18. Codrin M. Nichitiu, Christophe Papazian, Eric Rémila
    Leader election in plane cellular automata, only with left-right global convention. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:367-384 [Journal]
    
19. Katherine Humphreys, Heinrich Niederhausen
    Counting lattice paths taking steps in infinitely many directions under special access restrictions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:385-409 [Journal]
    
20. Marc Daniel, Sylvain Gravier, Julien Moncel
    Identifying codes in some subgraphs of the square lattice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:411-421 [Journal]
    
21. F. Aguiló, D. Arteaga, I. Diego
    A symbolical algorithm on additive basis and double-loop networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:423-439 [Journal]
    
22. James D. Currie
    The number of binary words avoiding abelian fourth powers grows exponentially. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:441-446 [Journal]
    
23. Andrea Frosini, G. Simi
    The NP-completeness of a tomographical problem on bicolored domino tilings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:447-454 [Journal]
    
24. Régis Barbanchon
    On unique graph 3-colorability and parsimonious reductions in the plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:319, n:1-3, pp:455-482 [Journal]