PACE Solver Description: Touiouidth. - Gaétan Berthe; Yoann Coudert-Osmont; Alexander Dobler; Laure Morelle; Amadeus Reinald; Mathis Rocton (IPEC, 2023)

Dynamic Programming on Bipartite Tree Decompositions. - Lars Jaffke; Laure Morelle; Ignasi Sau; Dimitrios M. Thilikos (IPEC, 2023)

On the parameterized complexity of computing good edge-labelings. - Davi de Andrade; Júlio Araújo 001; Laure Morelle; Ignasi Sau; Ana Silva 001 (CoRR, 2024)

Faster parameterized algorithms for modification problems to minor-closed classes. - Laure Morelle; Ignasi Sau; Giannos Stamoulis; Dimitrios M. Thilikos (TheoretiCS, 2024)

A note on locating-dominating sets in twin-free graphs. - Nicolas Bousquet 001; Quentin Chuet; Victor Falgas-Ravry; Amaury Jacques; Laure Morelle (Discret. Math., 2025)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion. - Laure Morelle; Ignasi Sau; Dimitrios M. Thilikos (CoRR, 2025)

When does FTP become FPT? - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Laure Morelle (CoRR, 2025)

Fault-Tolerant Matroid Bases. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Laure Morelle (CoRR, 2025)

H-Planarity and Parametric Extensions: when Modulators Act Globally. - Fedor V. Fomin; Petr A. Golovach; Laure Morelle; Dimitrios M. Thilikos (CoRR, 2025)

Vertex identification to a forest. - Laure Morelle; Ignasi Sau; Dimitrios M. Thilikos (Discret. Math., 2026)