default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 319
Volume 319, Number 1-3, 10 June 2004
- Laurent Vuillon:
Foreword: Combinatorics of the Discrete Plane and Tilings. 1 - Michael Korn, Igor Pak:
Tilings of rectangles with T-tetrominoes. 3-27 - Eric Kuo:
Applications of graphical condensation for enumerating matchings and tilings. 29-57 - Olivier Bodini, Eric Rémila:
Tilings with trichromatic colored-edges triangles. 59-70 - Nicolas Destainville, R. Mosseri, F. Bailly:
A formula for the number of tilings of an octagon by rhombi. 71-81 - Sébastien Desreux, Martín Matamala
, Ivan Rapaport, Eric Rémila:
Domino tilings and related models: space of configurations of domains with holes. 83-101 - Francis Oger:
Algebraic and model-theoretic properties of tilings. 103-126 - Jean-Charles Delvenne, Vincent D. Blondel:
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines. 127-143 - Pierre Arnoux, Valérie Berthé, Anne Siegel:
Two-dimensional iterated morphisms and discrete planes. 145-176 - Valérie Berthé, Robert Tijdeman:
Lattices and multi-dimensional words. 177-202 - Valentin E. Brimkov, Reneta P. Barneva:
Connectivity of discrete planes. 203-227 - Anthony Quas, Luca Q. Zamboni:
Periodicity and local complexity. 229-240 - E. O. Harriss, Jeroen S. W. Lamb:
Canonical substitutions tilings of Ammann-Beenker type. 241-279 - Avi Elkharrat, Christiane Frougny, Jean-Pierre Gazeau, Jean-Louis Verger-Gaugry:
Symmetry groups for beta-lattices. 281-305 - Peter J. Grabner, Clemens Heuberger, Helmut Prodinger:
Distribution results for low-weight binary representations for pairs of integers. 307-331 - Svjetlan Feretic:
A q-enumeration of convex polyominoes by the festoon approach. 333-356 - Zoltán Füredi, Jeong-Hyun Kang:
Distance graph on Znwith norm. 357-366 - Codrin M. Nichitiu, Christophe Papazian, Eric Rémila:
Leader election in plane cellular automata, only with left-right global convention. 367-384 - Katherine Humphreys, Heinrich Niederhausen:
Counting lattice paths taking steps in infinitely many directions under special access restrictions. 385-409 - Marc Daniel, Sylvain Gravier, Julien Moncel:
Identifying codes in some subgraphs of the square lattice. 411-421 - Francesc Aguiló, D. Arteaga, I. Diego:
A symbolical algorithm on additive basis and double-loop networks. 423-439 - James D. Currie:
The number of binary words avoiding abelian fourth powers grows exponentially. 441-446 - Andrea Frosini, Giulia Simi:
The NP-completeness of a tomographical problem on bicolored domino tilings. 447-454 - Régis Barbanchon:
On unique graph 3-colorability and parsimonious reductions in the plane. 455-482
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-08 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
