| Publication | Date of Publication | Type |
|---|
| Reconstructing words using queries on subwords or factors | 2024-10-08 | Paper |
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters
European Journal of Combinatorics | 2024-03-26 | Paper |
scientific article; zbMATH DE number 7788387 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Reconstructing words using queries on subwords or factors | 2023-01-04 | Paper |
Avoidability of Additive Cubes over Alphabets of Four Numbers
Developments in Language Theory | 2022-10-13 | Paper |
Avoiding squares over words with lists of size three amongst four symbols
Mathematics of Computation | 2022-08-23 | Paper |
It is undecidable whether the growth rate of a given bilinear system is 1
Linear Algebra and its Applications | 2022-07-26 | Paper |
Avoiding square-free words on free groups
Theoretical Computer Science | 2022-06-13 | Paper |
| Finding lower bounds on the growth and entropy of subshifts over countable groups | 2022-04-01 | Paper |
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge
The Electronic Journal of Combinatorics | 2021-11-22 | Paper |
Lower-bounds on the growth of power-free languages over large alphabets
Theory of Computing Systems | 2021-09-28 | Paper |
| Avoiding large squares in trees and planar graphs | 2021-06-02 | Paper |
Avoiding Square-Free Words on Free Groups
(available as arXiv preprint) | 2021-04-14 | Paper |
Avoidability of palindrome patterns
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
The binomial equivalence classes of finite words
International Journal of Algebra and Computation | 2020-10-14 | Paper |
Another approach to non-repetitive colorings of graphs of bounded degree
The Electronic Journal of Combinatorics | 2020-09-08 | Paper |
How far away must forced letters be so that squares are still avoidable?
Mathematics of Computation | 2020-08-27 | Paper |
Lower-bounds on the growth of power-free languages over large alphabets
(available as arXiv preprint) | 2020-08-12 | Paper |
| Nice formulas, $xyx$-formulas, and palindrome patterns | 2020-05-11 | Paper |
Templates for the \(k\)-binomial complexity of the Tribonacci word
Advances in Applied Mathematics | 2019-12-17 | Paper |
Templates for the \(k\)-binomial complexity of the Tribonacci word
Lecture Notes in Computer Science | 2019-11-06 | Paper |
Bisplit graphs satisfy the Chen-Chvátal conjecture
(available as arXiv preprint) | 2019-08-01 | Paper |
| Bisplit graphs satisfy the Chen-Chvátal conjecture | 2019-08-01 | Paper |
| Bounding the number of $(\sigma,\rho)$-dominating sets in trees, forests and graphs of bounded pathwidth | 2019-04-05 | Paper |
On some interesting ternary formulas
The Electronic Journal of Combinatorics | 2019-03-05 | 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 |
| Every binary pattern of length greater than 14 is abelian-2-avoidable | 2018-03-21 | Paper |
On some interesting ternary formulas
Lecture Notes in Computer Science | 2017-11-15 | Paper |
Avoidability of formulas with two variables
The Electronic Journal of Combinatorics | 2017-11-10 | Paper |
Avoidability of formulas with two variables
Developments in Language Theory | 2016-08-30 | Paper |
Avoidability of long \(k\)-abelian repetitions
Mathematics of Computation | 2016-07-25 | Paper |
On Vizing's problem for triangle-free graphs
(available as arXiv preprint) | N/A | Paper |
