| Publication | Date of Publication | Type |
|---|
An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence
Theoretical Computer Science | 2024-11-07 | Paper |
Further steps on the reconstruction of convex polyominoes from orthogonal projections
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Second Order Balance Property on Christoffel Words
Mathematical Aspects of Computer and Information Sciences | 2021-12-08 | Paper |
On the Markov numbers: fixed numerator, denominator, and sum conjectures
Advances in Applied Mathematics | 2021-08-05 | Paper |
Some special solutions to the hyperbolic NLS equation
Communications in Nonlinear Science and Numerical Simulation | 2020-10-21 | Paper |
Derived sequences of complementary symmetric Rote sequences
RAIRO - Theoretical Informatics and Applications | 2020-05-04 | Paper |
Facet connectedness of arithmetic discrete hyperplanes with non-zero shift
Discrete Geometry for Computer Imagery | 2019-10-16 | Paper |
Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
Theoretical Computer Science | 2019-06-18 | Paper |
Palindromic closures and Thue-Morse substitution for Markoff numbers
Uniform distribution theory | 2018-03-05 | Paper |
| First steps in the algorithmic reconstruction of digital convex sets | 2017-11-15 | Paper |
Tiling the space by polycube analogues of Fedorov's polyhedra
Fundamenta Informaticae | 2017-07-28 | Paper |
Palindromic language of thin discrete planes
Theoretical Computer Science | 2016-04-01 | Paper |
| \(2L\) convex polyominoes: discrete tomographical aspects | 2015-08-05 | Paper |
| scientific article; zbMATH DE number 6468924 (Why is no real title available?) | 2015-08-03 | Paper |
Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
Discrete Applied Mathematics | 2015-02-18 | Paper |
Facet connectedness of discrete hyperplanes with zero intercept: the general case
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Geometric palindromic closure
Uniform Distribution Theory | 2014-08-29 | Paper |
| On generalized pseudostandard words over binary alphabets | 2014-03-24 | Paper |
On the shape of permutomino tiles
Discrete Applied Mathematics | 2013-12-17 | Paper |
Codings of rotations on two intervals are full
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
| How to construct convex polyominoes in DNA Wang tiles? | 2013-05-02 | Paper |
Enumeration formula for \((2,n)\)-cubes in discrete planes
Discrete Applied Mathematics | 2012-10-26 | Paper |
Non-lattice-periodic tilings of \(\mathbb R^3\) by single polycubes
Theoretical Computer Science | 2012-06-25 | Paper |
On the tiling system recognizability of various classes of convex polyominoes
Annals of Combinatorics | 2012-01-24 | Paper |
Palindromic complexity of codings of rotations
Theoretical Computer Science | 2011-12-07 | Paper |
How many faces can the polycubes of lattice tilings by translation of \(\mathbb R^3\) have?
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
Tiling the plane with permutations
Discrete Geometry for Computer Imagery | 2011-05-19 | Paper |
scientific article; zbMATH DE number 5855061 (Why is no real title available?)
(available as arXiv preprint) | 2011-02-22 | Paper |
On the Shyr-Yu theorem
Theoretical Computer Science | 2009-11-06 | Paper |
An algorithm for deciding if a polyomino tiles the plane
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
An algorithm for deciding if a polyomino tiles the plane
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
An algorithm for deciding if a polyomino tiles the plane
RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
| scientific article; zbMATH DE number 5228183 (Why is no real title available?) | 2008-01-18 | Paper |
A characterization of balanced episturmian sequences
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
A characterization of balanced episturmian sequences
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
A characterization of balanced episturmian sequences
The Electronic Journal of Combinatorics | 2007-07-16 | Paper |
Complexity of cutting words on regular tilings
European Journal of Combinatorics | 2006-12-07 | Paper |
Combinatorial properties of smooth infinite words
Theoretical Computer Science | 2006-03-24 | Paper |
Tilings by translation: enumeration by a rational language approach
The Electronic Journal of Combinatorics | 2006-02-16 | Paper |
Tilings by translation: enumeration by a rational language approach
The Electronic Journal of Combinatorics | 2006-02-16 | Paper |
Graph encoding of 2D-gon tilings
Theoretical Computer Science | 2006-01-10 | Paper |
An introduction to periodical discrete sets from a tomographical perspective
Theoretical Computer Science | 2005-12-29 | Paper |
Balanced words
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2005-06-09 | Paper |
| scientific article; zbMATH DE number 2086609 (Why is no real title available?) | 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086609 (Why is no real title available?)
(available as arXiv preprint) | 2004-08-11 | Paper |
Palindromes and two-dimensional Sturmian sequences
Journal of Automata, Languages and Combinatorics | 2003-01-16 | Paper |
Local configurations in a discrete plane
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2003-01-16 | Paper |
Generalized balances in Sturmian words
Discrete Applied Mathematics | 2002-08-29 | Paper |
Coding rotations on intervals
Theoretical Computer Science | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1741026 (Why is no real title available?) | 2002-06-10 | Paper |
scientific article; zbMATH DE number 1741026 (Why is no real title available?)
(available as arXiv preprint) | 2002-06-10 | Paper |
Asymptotic behavior in a heap model with two pieces
Theoretical Computer Science | 2002-03-03 | Paper |
Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
Discrete Mathematics | 2001-10-21 | Paper |
Double sequences of low complexity
Journal de Théorie des Nombres de Bordeaux | 2001-07-30 | Paper |
Double sequences of low complexity
Journal de Théorie des Nombres de Bordeaux | 2001-07-30 | Paper |
Return words in Sturmian and episturmian words
RAIRO. Theoretical Informatics and Applications | 2001-06-26 | Paper |
Return words in Sturmian and episturmian words
RAIRO. Theoretical Informatics and Applications | 2001-06-26 | Paper |
A characterization of Sturmian words by return words
European Journal of Combinatorics | 2001-03-20 | Paper |
Combinatorics on patterns of a bidimensional Sturmian sequence
Theoretical Computer Science | 1999-01-12 | Paper |
