My research focuses on algorithmics, mainly for graph problems. Among others, I am interested in efficient algorithms for hard combinatorial problems: exact (parameterized) algorithms, approximation...

## News:

### Upcoming:

- Seymour is 70, a conference honoring the 70th birthday of Paul Seymour, is postponed to a further date :-(
- With some colleagues from Grenoble and Clermont-Ferrand, we are organizing once every two/three weeks an online seminar about graphs and combinatorics (GRAA)

### Past:

- I was a speaker at the CALDAM pre-conference school on algorithms and combinatorics on February 10-11, 2020 in Hyderabad, India.
- I participated in the organization of a 2-days workshop about Combinatorics, Graphs and Algorithms to celebrate Stéphan Thomassé's 50th birthday, december 10-11, 2018.
- I participated in the organization of the 10th International Colloquium on Graph Theory and combinatorics, july 9-13 2018.

## Papers: (see also my DBLP)

**Twin-width III: Max Independent Set, Min Dominating Set and Coloring**.

with Édouard Bonnet, Colin Geniet, Eun Jung Kim and Stéphan Thomassé.**Twin-width II: small classes**.

with Édouard Bonnet, Colin Geniet, Eun Jung Kim and Stéphan Thomassé.**Twin-width I: tractable FO model checking**.

with Édouard Bonnet, Eun Jung Kim and Stéphan Thomassé.**An algorithmic weakening of the Erdős-Hajnal conjecture**.

with Édouard Bonnet, Stéphan Thomassé and Xuan Thang Tran.**Overlaying a hypergraph with a graph with bounded maximum degree**.

with Frédéric Havet, Dorian Mazauric and Thi Viet Ha Nguyen.- CALDAM 2020, LNCS vol. 12016, 403-414.

**When Maximum Stable Set can be solved in FPT time**.

with Édouard Bonnet, Nicolas Bousquet and Stéphan Thomassé.- ISAAC 2019, LIPIcs vol. 149, 49:1-49:22. [Pre-Print]

**Comparing two clusterings using matchings between clusters of clusters**.

with Frédéric Cazals, Dorian Mazauric and Romain Tetley.- ACM Journal of Experimental Algorithmics 24(1): 1.17:1-1.17:41. accepted. [Pre-Print]

**Constraint Generation Algorithm for the Minimum Connectivity Inference Problem**.

with Édouard Bonnet and Diana-Elena Fălămaş.- SEA^2 2019, LNCS vol. 11544 167-183. [Pre-Print]

**Parameterized Complexity of Independent Set in H-Free Graphs**.

with Édouard Bonnet, Nicolas Bousquet, Pierre Charbit and Stéphan Thomassé.**Complexity Dichotomies for the Minimum F-Overlay Problem**.

with Nathann Cohen, Frédéric Havet, Dorian Mazauric and Ignasi Sau.- IWOCA 2017, LNCS 10765, pages 116-127. [Pre-Print]
- Journal of Discrete Algorithms, Vol. 52-53, Sept. 2018, pages 133-142 [Pre-Print]

**On the satisfiability of workflows with release points**.

with Jason Crampton and Gregory Gutin.- SACMAT 2017, pages 207-217.[Pre-Print]

**Parameterized Resiliency Problems via Integer Linear Programming**.

with Jason Crampton, Gregory Gutin and Martin Koutecký.**The Authorization Policy Existence Problem**.

with Pierre Bergé, Jason Crampton and Gregory Gutin.- CODASPY 2017, pages 163-165 (short paper). [Pre-Print]

**The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency**.

with Jason Crampton, Gregory Gutin and Daniel Karapetyan.- Journal of Computer Security, 25(1): 83-115, 2017. [Pre-Print]

**A Multivariate Approach for Testing Resiliency in Access Control**.

with Jason Crampton and Gregory Gutin.**Resiliency Policies in Access Control Revisited**.

with Jason Crampton and Gregory Gutin.- SACMAT 2016
**(best paper award)**, Proceedings of SACMAT 2016, ACM, pp 101-111. [Pre-print]

- SACMAT 2016
**Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations**.

with Marin Bougeret, Guillerme Duvillié and Rodolphe Giroudeau.**Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs**.

with Nicolas Bousquet, Marin Bougeret and Rodolphe Giroudeau.- SOFSEM 2014, Springer LNCS 8327, pp. 150-161. [Pre-print]

**Approximating the Sparsest k-Subgraph in Chordal Graphs**.

with Marin Bougeret and Rodolphe Giroudeau.**Sum-Max Graph Partitioning Problem**.

with Marin Bougeret, Rodolphe Giroudeau and Jean-Claude König.

### Theses:

- PhD thesis:
**Approximation et Complexité Paramétrée de Problèmes d'Optimisation dans les Graphes**, under the direction of Rodolphe Giroudeau and Marin Bougeret. LIRMM, Montpellier, France. [PDF] (french) - Master thesis:
**Bornes Inférieures pour la Kernelization**, under the direction of Christophe Paul. LIRMM, Montpellier, France. [PDF] (french)