Laure Morelle

activity

20222025

most citedFaster parameterized algorithms for modification problems to minor-closed classes

2 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DS2024

Vertex identification to a forest

Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos

Let $H$ be a graph class and $k \in N$ . We say a graph $G$ admits a \emph{ $k$ -identification to $H$ } if there is a partition $P$ of some set $X…

cs.DS2024

On the parameterized complexity of computing good edge-labelings

Davi de Andrade, Júlio Araújo, Laure Morelle +2

A good edge-labeling (gel for short) of a graph $G$ is a function $λ : E (G) \to R$ such that, for any ordered pair of vertices $(x, y)$ of $G$ , there do not exist two disti…

math.CO2024

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

Nicolas Bousquet, Quentin Chuet, Victor Falgas-Ravry +2

In this short note, we prove that every twin-free graph on $n$ vertices contains a locating-dominating set of size at most $⌈ \frac{5}{8} n ⌉$ . This improves the earlier bou…