Laure Morelle

Orcid: 0009-0000-1001-1801

According to our database1, Laure Morelle authored at least 11 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Identification to Subclasses of Chordal Graphs.
CoRR, April, 2026

On the parameterized complexity of computing good edge-labelings.
J. Comput. Syst. Sci., 2026

Vertex identification to a forest.
Discret. Math., 2026

ℋ-Planarity and Parametric Extensions: when Modulators Act Globally.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
A note on locating-dominating sets in twin-free graphs.
Discret. Math., 2025

When Does FTP Become FPT?
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2025

Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Fault-Tolerant Matroid Bases.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2023
Dynamic Programming on Bipartite Tree Decompositions.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

PACE Solver Description: Touiouidth.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023


  Loading...