Laure Morelle

According to our database, Laure Morelle authored at least 10 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Vertex identification to a forest.

Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos

Discret. Math., 2026

2025

H-Planarity and Parametric Extensions: when Modulators Act Globally.

Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos

CoRR, July, 2025

When does FTP become FPT?

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle

CoRR, June, 2025

A note on locating-dominating sets in twin-free graphs.

Nicolas Bousquet, 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

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Fault-Tolerant Matroid Bases.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

On the parameterized complexity of computing good edge-labelings.

Davi de Andrade, Júlio Araújo, Laure Morelle, Ignasi Sau, Ana Silva

CoRR, 2024

2023

Dynamic Programming on Bipartite Tree Decompositions.

Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

PACE Solver Description: Touiouidth.

Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes.

Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023