| Publication | Date of Publication | Type |
|---|
An aperiodic set of 11 Wang tiles
Advances in Combinatorics | 2021-11-05 | Paper |
The 2-domination and Roman domination numbers of grid graphs
(available as arXiv preprint) | 2019-08-01 | Paper |
| The 2-domination and Roman domination numbers of grid graphs | 2019-08-01 | Paper |
Avoiding or limiting regularities in words
Trends in Mathematics | 2019-01-24 | Paper |
Avoiding two consecutive blocks of same size and same sum over \(\mathbb{Z}^2\)
SIAM Journal on Discrete Mathematics | 2018-10-08 | Paper |
| Exhaustive search of convex pentagons which tile the plane | 2017-08-01 | Paper |
On cardinalities of \(k\)-abelian equivalence classes
Theoretical Computer Science | 2016-12-19 | Paper |
Avoidability of long \(k\)-abelian repetitions
Mathematics of Computation | 2016-07-25 | Paper |
On some generalizations of abelian power avoidability
Theoretical Computer Science | 2015-09-16 | Paper |
On shuffling of infinite square-free words
The Electronic Journal of Combinatorics | 2015-03-11 | Paper |
Avoiding 2-binomial squares and cubes
Theoretical Computer Science | 2015-02-24 | Paper |
Finite repetition threshold for large alphabets
RAIRO - Theoretical Informatics and Applications | 2014-12-12 | Paper |
| Another remark on the radical of an odd perfect number | 2014-10-01 | Paper |
Regular simplices and periodic billiard orbits
Proceedings of the American Mathematical Society | 2014-09-16 | Paper |
On the number of prime factors of an odd perfect number
Mathematics of Computation | 2014-09-10 | Paper |
| Infinite square-free self-shuffling words | 2014-01-25 | Paper |
The rank-width of edge-coloured graphs
Theory of Computing Systems | 2013-08-01 | Paper |
Odd perfect numbers are greater than \(10^{1500}\)
Mathematics of Computation | 2012-06-29 | Paper |
Tree-representation of set families and applications to combinatorial decompositions
European Journal of Combinatorics | 2012-05-04 | Paper |
The domination number of grids
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Theoretical Computer Science | 2011-12-07 | Paper |
Distances on rhombus tilings
Theoretical Computer Science | 2011-09-12 | Paper |
\(\mathbb F\)-rank-width of (edge-colored) graphs
Algebraic Informatics | 2011-07-08 | Paper |
Last cases of Dejean's conjecture
Theoretical Computer Science | 2011-06-16 | Paper |
Well-quasi-order of relabel functions
Order | 2010-11-08 | Paper |
A note on computing set overlap classes
Information Processing Letters | 2010-06-09 | Paper |
Diamond-free circle graphs are Helly circle
Discrete Mathematics | 2010-04-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Directed rank-width and displit decomposition
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Clique-width of graphs defined by one-vertex extensions
Discrete Mathematics | 2009-01-28 | Paper |
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics | 2008-10-17 | Paper |
NLC-2 Graph Recognition and Isomorphism
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science | 2007-06-06 | Paper |
The bi-join decomposition
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On algorithms for (\(P_5\), gem)-free graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
How many square occurrences must a binary sequence contain?
The Electronic Journal of Combinatorics | 2003-05-07 | Paper |
How many square occurrences must a binary sequence contain?
The Electronic Journal of Combinatorics | 2003-05-07 | Paper |
