5 citations · 5 across the 8 of their papers we have counts for
8 papers
Almost Linear 3-Spanners of Temporal Cliques
Julia Baligacs, Davide Bilò, Václav Blažej +2
Temporal graphs model dynamic networks by assigning positive integer time labels to the edges, while information propagates along temporal paths, whose edge labels are traversed in…
Well-quasi-ordered classes of bounded clique-width
Maël Dumas, Aliaume Lopez
We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a…
Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
Clément Dallard, Maël Dumas, Claire Hilaire +1
The -Induced Minor Containment problem (-IMC) consists in deciding if a fixed graph is an induced minor of a graph given as input, that is, whether can be obtaine…
Induced Minor Models. I. Structural Properties and Algorithmic Consequences
Nicolas Bousquet, Clément Dallard, Maël Dumas +4
A graph is said to be an induced minor of a graph if can be obtained from by a sequence of vertex deletions and edge contractions. Equivalently, is an induced m…
An improved kernelization algorithm for Trivially Perfect Editing
Maël Dumas, Anthony Perez
In the Trivially Perfect Editing problem one is given an undirected graph and an integer and seeks to add or delete at most edges in to obtain a trivially p…
On graphs coverable by k shortest paths
Maël Dumas, Florent Foucaud, Anthony Perez +1
We show that if the edges or vertices of an undirected graph can be covered by shortest paths, then the pathwidth of is upper-bounded by a single-exponential function o…
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
Maël Dumas, Anthony Perez, Mathis Rocton +1
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph and an integer and seeks to…
A cubic vertex-kernel for Trivially Perfect Editing
Maël Dumas, Anthony Perez, Ioan Todinca
We consider the Trivially Perfect Editing problem, where one is given an undirected graph and a parameter and seeks to edit (add or delete) at most $…