default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaure Morelle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j3]Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Vertex identification to a forest. Discret. Math. 349(1): 114699 (2026)- 2025
- [j2]Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry, Amaury Jacques, Laure Morelle:
A note on locating-dominating sets in twin-free graphs. Discret. Math. 348(2): 114297 (2025) - [i8]Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Graph modification of bounded size to minor-closed classes as fast as vertex deletion. CoRR abs/2504.16803 (2025) - [i7]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle:
When does FTP become FPT? CoRR abs/2506.17008 (2025) - [i6]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle:
Fault-Tolerant Matroid Bases. CoRR abs/2506.22010 (2025) - [i5]Fedor V. Fomin, Petr A. Golovach, Laure Morelle, Dimitrios M. Thilikos:
H-Planarity and Parametric Extensions: when Modulators Act Globally. CoRR abs/2507.08541 (2025) - 2024
- [j1]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. TheoretiCS 3 (2024) - [i4]Davi de Andrade, Júlio Araújo, Laure Morelle, Ignasi Sau, Ana Silva:
On the parameterized complexity of computing good edge-labelings. CoRR abs/2408.15181 (2024) - [i3]Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Vertex identification to a forest. CoRR abs/2409.08883 (2024) - 2023
- [c3]Laure Morelle
, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes. ICALP 2023: 93:1-93:19 - [c2]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming on Bipartite Tree Decompositions. IPEC 2023: 26:1-26:22 - [c1]Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton:
PACE Solver Description: Touiouidth. IPEC 2023: 38:1-38:4 - [i2]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming on bipartite tree decompositions. CoRR abs/2309.07754 (2023) - 2022
- [i1]Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
Faster parameterized algorithms for modification problems to minor-closed classes. CoRR abs/2210.02167 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-08-13 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
