51 citations · 101 across the 16 of their papers we have counts for
8 papers · 1 filter
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…
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 $…
On the complexity of Broadcast Domination and Multipacking in digraphs
Florent Foucaud, Benjamin Gras, Anthony Perez +1
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph is a…
Polynomial kernels for Proper Interval Completion and related problems
Stéphane Bessy, Anthony Perez
Given a graph G = (V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V \times V)\E such that the graph…
Conflict Packing: an unifying technique to obtain polynomial kernels for editing problems on dense instances
Christophe Paul, Anthony Perez, Stéphan Thomassé
We develop a technique that we call Conflict Packing in the context of kernelization, obtaining (and improving) several polynomial kernels for editing problems on dense instances.…