Élise Vandomme
Élise Vandomme
Université de Liège
Verified email at uliege.be - Homepage
Title
Cited by
Cited by
Year
Some properties of abelian return words
M Rigo, P Salimov, É Vandomme
J. Integer Seq 16 (13.2), 5, 2013
262013
A new approach to the -regularity of the -abelian complexity of -automatic sequences
A Parreau, M Rigo, E Rowland, É Vandomme
Electronic Journal of Combinatorics 22 (4), #P4.6, 2015
182015
Identifying codes in vertex-transitive graphs and strongly regular graphs
S Gravier, A Parreau, S Rottey, L Storme, É Vandomme
Discussiones Mathematicae Graph Theory 37 (4), 891-918, 2017
142017
Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
A Lacroix, N Rampersad, M Rigo, É Vandomme
Fundamenta Informaticae 116 (1-4), 175-187, 2012
102012
Leaf realization problem, caterpillar graphs and prefix normal words
A Blondin Massé, J de Carufel, A Goupil, M Lapointe, É Nadeau, ...
Theoretical Computer Science 732, 1-13, 2018
92018
Critical exponents of infinite balanced words
N Rampersad, J Shallit, É Vandomme
Theoretical Computer Science 777, 454-463, 2019
82019
Fully leafed induced subtrees
AB Massé, J de Carufel, A Goupil, M Lapointe, É Nadeau, É Vandomme
International Workshop on Combinatorial Algorithms, 90-101, 2018
62018
Syntactic complexity of ultimately periodic sets of integers
M Rigo, É Vandomme
International Conference on Language and Automata Theory and Applications …, 2011
62011
Recurrence in Multidimensional Words
É Charlier, S Puzynina, É Vandomme
International Conference on Language and Automata Theory and Applications …, 2019
22019
Constant 2-labellings and an application to (r, a, b)-covering codes
S Gravier, É Vandomme
Discussiones Mathematicae Graph Theory 37 (4), 891-918, 2017
22017
Contributions to combinatorics on words in an abelian context and covering problems in graphs
E Vandomme
Université de Liège, Liège, Belgique, 2015
22015
Recurrence along directions in multidimensional words
É Charlier, S Puzynina, É Vandomme
Discrete Mathematics 343 (10), 112006, 2020
2020
Nearest constrained circular words
G Blin, A Blondin Massé, M Gasparoux, S Hamel, É Vandomme
Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
2018
Combinatorics on Words: 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings
S Brlek, F Dolce, C Reutenauer, É Vandomme
Springer, 2017
2017
How to count leaves in the trees from Tetris?
E Vandomme
2017
On a conjecture about regularity and l-abelian complexity
E Vandomme
2017
Mathématiques en Action; Interview à la radio CHOQ de l'Université du Québec à Montréal
E Vandomme
2017
Covering codes
E Vandomme
2017
Sous-arbres induits pleinement feuillus: résultats de complexité
E Vandomme
2017
Sous-arbres induits pleinement feuillus
E Vandomme
2017
The system can't perform the operation now. Try again later.
Articles 1–20