Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

On the tiling by translation problem

S. Brlek, X. Provençal and Jean-Marc Fédou
Discrete Applied Mathematics 157 (3) 464 (2009)
DOI: 10.1016/j.dam.2008.05.026
See this article

Language and Automata Theory and Applications

Alexandre Blondin Massé, Amadou Makhtar Tall and Hugo Tremblay
Lecture Notes in Computer Science, Language and Automata Theory and Applications 8370 198 (2014)
DOI: 10.1007/978-3-319-04921-2_16
See this article

Algorithms and Computation

Andrew Winslow
Lecture Notes in Computer Science, Algorithms and Computation 9472 3 (2015)
DOI: 10.1007/978-3-662-48971-0_1
See this article

SCHEDULING SENSORS BY TILING LATTICES

ANDREAS KLAPPENECKER, HYUNYOUNG LEE and JENNIFER L. WELCH
Parallel Processing Letters 20 (01) 3 (2010)
DOI: 10.1142/S0129626410000028
See this article

Language and Automata Theory and Applications

Nicolas Ollinger
Lecture Notes in Computer Science, Language and Automata Theory and Applications 5457 638 (2009)
DOI: 10.1007/978-3-642-00982-2_54
See this article

Non-lattice-periodic tilings of R3 by single polycubes

I. Gambini and L. Vuillon
Theoretical Computer Science 432 52 (2012)
DOI: 10.1016/j.tcs.2012.01.014
See this article

Small polyomino packing

Michael Brand
Information Processing Letters 126 30 (2017)
DOI: 10.1016/j.ipl.2017.06.004
See this article

On the Number of p4-Tilings by an n-Omino

Kazuyuki Amano and Yoshinobu Haruyama
International Journal of Computational Geometry & Applications 29 (01) 3 (2019)
DOI: 10.1142/S0218195919400016
See this article

Rectangular tileability and complementary tileability are undecidable

Jed Yang
European Journal of Combinatorics 41 20 (2014)
DOI: 10.1016/j.ejc.2014.03.008
See this article