| Publication | Date of Publication | Type |
|---|
Antisquares and Critical Exponents
(available as arXiv preprint) | N/A | Paper |
Critical exponent of ternary words with few distinct palindromes
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-10-02 | Paper |
Critical exponent of ternary words with few distinct palindromes
(available as arXiv preprint) | 2026-01-01 | Paper |
| Avoiding abelian and additive powers in rich words | 2025-11-14 | Paper |
The repetition threshold for ternary rich words
The Electronic Journal of Combinatorics | 2025-07-11 | Paper |
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Dyck words, pattern avoidance, and automatic sequences
Communications in Mathematics | 2024-10-08 | Paper |
Antisquares and critical exponents
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Avoiding abelian and additive powers in rich words
(available as arXiv preprint) | 2024-01-01 | Paper |
The repetition threshold for ternary rich words
(available as arXiv preprint) | 2024-01-01 | Paper |
Network reliability: Heading out on the highway
Networks | 2023-12-11 | Paper |
On the mean subtree order of graphs under edge addition
Journal of Graph Theory | 2023-09-29 | Paper |
Dyck Words, Pattern Avoidance, and Automatic Sequences
Lecture Notes in Computer Science | 2023-07-25 | Paper |
The threshold dimension and irreducible graphs
Discussiones Mathematicae Graph Theory | 2022-12-02 | Paper |
The maximum average connectivity among all orientations of a graph
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
The maximum average connectivity among all orientations of a graph
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs
(available as arXiv preprint) | 2022-02-16 | Paper |
| On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs | 2022-02-16 | Paper |
The weak circular repetition threshold over large alphabets
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
| Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers | 2021-11-15 | Paper |
Lengths of extremal square-free ternary words
(available as arXiv preprint) | 2021-04-27 | Paper |
The undirected repetition threshold and undirected pattern avoidance
Theoretical Computer Science | 2021-04-14 | Paper |
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
Discrete Applied Mathematics | 2020-12-29 | Paper |
Extremal overlap-free and extremal -free binary words
The Electronic Journal of Combinatorics | 2020-12-13 | Paper |
The repetition threshold for binary rich words
(available as arXiv preprint) | 2020-10-28 | Paper |
The threshold dimension of a graph
Discrete Applied Mathematics | 2020-10-14 | Paper |
On the roots of the subtree polynomial
European Journal of Combinatorics | 2020-09-15 | Paper |
The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
(available as arXiv preprint) | 2020-05-12 | Paper |
| The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\) | 2020-05-12 | Paper |
On the mean order of connected induced subgraphs of block graphs
(available as arXiv preprint) | 2020-05-07 | Paper |
| On the mean order of connected induced subgraphs of block graphs | 2020-05-07 | Paper |
The Weak Circular Repetition Threshold Over Large Alphabets
(available as arXiv preprint) | 2019-12-22 | Paper |
Cobham’s Theorem and Automaticity
International Journal of Foundations of Computer Science | 2019-12-19 | Paper |
The undirected repetition threshold
(available as arXiv preprint) | 2019-11-06 | Paper |
Maximizing the mean subtree order
Journal of Graph Theory | 2019-08-15 | Paper |
The fully frustrated XY model revisited: A new universality class
Journal of Statistical Physics | 2019-08-01 | Paper |
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
The Electronic Journal of Combinatorics | 2019-06-06 | Paper |
Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
The Electronic Journal of Combinatorics | 2019-06-06 | Paper |
On the mean connected induced subgraph order of cographs
(available as arXiv preprint) | 2019-01-30 | Paper |
| On the mean connected induced subgraph order of cographs | 2019-01-30 | Paper |
On the roots of Wiener polynomials of graphs
Discrete Mathematics | 2018-07-26 | Paper |
Avoidance bases for formulas with reversal
Theoretical Computer Science | 2018-06-18 | Paper |
On the roots of the node reliability polynomial
Networks | 2018-05-11 | Paper |
On avoidability of formulas with reversal
RAIRO - Theoretical Informatics and Applications | 2018-05-04 | Paper |
The shape of node reliability
Discrete Applied Mathematics | 2018-02-22 | Paper |
Using zeros of the canonical partition function map to detect signatures of a Berezinskii-Kosterlitz-thouless transition
Computer Physics Communications | 2017-12-06 | Paper |
A family of formulas with reversal of high avoidability index
International Journal of Algebra and Computation | 2017-10-06 | Paper |
On the roots of all-terminal reliability polynomials
Discrete Mathematics | 2017-08-29 | Paper |
Diluted planar ferromagnets: nonlinear excitations on a non-simply connected manifold
Physics Letters. A | 2008-05-07 | Paper |
On phase transition and vortex stability in the generalized \(XY\) models
Physics Letters. A | 2003-11-16 | Paper |
