Syntactic Complexity of Ultimately Periodic Sets of Integers. - Michel Rigo; Élise Vandomme (LATA, 2011)

Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure. - Anne Lacroix; Narad Rampersad; Michel Rigo; Élise Vandomme (Fundam. Informaticae, 2012)

Identifying codes in vertex-transitive graphs. - Sylvain Gravier; Aline Parreau; Sara Rottey; Leo Storme; Élise Vandomme (CoRR, 2014)

Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs. - Sylvain Gravier; Aline Parreau; Sara Rottey; Leo Storme; Élise Vandomme (Electron. J. Comb., 2015)

A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences. - Aline Parreau; Michel Rigo; Eric Rowland; Élise Vandomme (Electron. J. Comb., 2015)

Constant 2-labellings and an application to (r, a, b)-covering codes. - Sylvain Gravier; Élise Vandomme (Discuss. Math. Graph Theory, 2017)

Nearest constrained circular words. - Guillaume Blin; Alexandre Blondin Massé; Marie Gasparoux; Sylvie Hamel; Élise Vandomme (CPM, 2018)

Fully Leafed Induced Subtrees. - Alexandre Blondin Massé; Julien de Carufel; Alain Goupil; Mélodie Lapointe; Émile Nadeau; Élise Vandomme (IWOCA, 2018)

Leaf realization problem, caterpillar graphs and prefix normal words. - Alexandre Blondin Massé; Julien de Carufel; Alain Goupil; Mélodie Lapointe; Émile Nadeau; Élise Vandomme (Theor. Comput. Sci., 2018)

Recurrence in Multidimensional Words. - Émilie Charlier; Svetlana Puzynina; Élise Vandomme (LATA, 2019)

Critical exponents of infinite balanced words. - Narad Rampersad; Jeffrey O. Shallit; Élise Vandomme (Theor. Comput. Sci., 2019)

On non-repetitive complexity of Arnoux-Rauzy words. - Katerina Medková; Edita Pelantová; Élise Vandomme (Discret. Appl. Math., 2020)

Recurrence along directions in multidimensional words. - Émilie Charlier; Svetlana Puzynina; Élise Vandomme (Discret. Math., 2020)