Recurrence along directions in multidimensional words.
Discret. Math., 2020
On non-repetitive complexity of Arnoux-Rauzy words.
Discret. Appl. Math., 2020
Critical exponents of infinite balanced words.
Theor. Comput. Sci., 2019
Recurrence in Multidimensional Words.
Proceedings of the Language and Automata Theory and Applications, 2019
Leaf realization problem, caterpillar graphs and prefix normal words.
Theor. Comput. Sci., 2018
Fully Leafed Induced Subtrees.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
Nearest constrained circular words.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018
Constant 2-labellings and an application to <i>(r, a, b)</i>-covering codes.
Discuss. Math. Graph Theory, 2017
A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences.
Electron. J. Comb., 2015
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs.
Electron. J. Comb., 2015
Identifying codes in vertex-transitive graphs.
CoRR, 2014
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure.
Fundam. Informaticae, 2012
Syntactic Complexity of Ultimately Periodic Sets of Integers.
Proceedings of the Language and Automata Theory and Applications, 2011