Parallelogram Morphisms and Circular Codes. - Alexandre Blondin Massé; Mélodie Lapointe; Hugo Tremblay (LATA, 2016)

Study of Christoffel Classes: Normal Form and Periodicity. - Mélodie Lapointe (WORDS, 2017)

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)

Number of orbits of Discrete Interval Exchanges. - Mélodie Lapointe (Discret. Math. Theor. Comput. Sci., 2019)

Palindromization and construction of Markoff triples. - Antoine Abram; Mélodie Lapointe; Christophe Reutenauer (Theor. Comput. Sci., 2020)

Reprint of: Palindromization and construction of Markoff triples. - Antoine Abram; Mélodie Lapointe; Christophe Reutenauer (Theor. Comput. Sci., 2020)

Perfectly Clustering Words are Primitive Positive Elements of the Free Group. - Mélodie Lapointe (WORDS, 2021)

The $q$-analog of the Markoff injectivity conjecture over the language of a balanced sequence. - Sébastien Labbé 001; Mélodie Lapointe (Comb. Theory, 2022)

Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet. - Mélodie Lapointe; Nathan Plourde-Hébert (GASCom, 2024)

Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees. - Moussa Abdenbi; Alexandre Blondin Massé; Alain Goupil; Mélodie Lapointe; Martin Lavoie (RAIRO Theor. Informatics Appl., 2024)

Characterizations of Perfectly Clustering Words. - Mélodie Lapointe; Christophe Reutenauer (Electron. J. Comb., 2025)

A generalization of perfectly clustering words and band bricks for certain gentle algebras. - Benjamin Dequêne; Mélodie Lapointe; Yann Palu; Pierre-Guy Plamondon; Christophe Reutenauer; Hugh Thomas (Comb. Theory, 2025)