Welcome on my professional webpage! (version française ici)
Since December 2019 I am a permanent CNRS researcher in the LIMOS lab.
My research topics are graph theory, algorithms, and combinatorics, in particular in structural graph theory, well-quasi-ordering, packing/covering dualities, parameterized complexity, algorithmic enumeration, and intersection graphs.
Previous positions:
- From October 2017 to June 2019 I was postdoc at TU Berlin in the Logic and Semantics group, with Stephan Kreutzer.
- From October 2013 to November 2016 I was PhD student at the University of Warsaw and the University of Montpellier under the supervision of Dimitrios M. Thilikos and Marcin Kamiński. Thesis defended on 18/11/16; more details below.
Lucas Pastor and I are in charge of the AlCoLoCo seminar at LIMOS.
I am taking part in the organization of the GRAA online seminar.
A listing of results about the Erdős-Pósa Property can be found on that page.
Contact
LIMOS Campus des Cézeaux 1 rue de la Chebarde 63170 Aubière
Publications
At conferences
- Polynomial gap extensions of the Erdős-Pósa Theorem, with Dimitrios M. Thilikos.
- An O(log OPT)-approximation for covering/packing minor models of θr, with Dimitris Chatzidimitriou, Ignasi Sau, and Dimitrios M. Thilikos
- Induced minors and well-quasi-ordering, with Jarosław Błasiok, Marcin Kamiński, and Théophile Trunck
- Packing and covering immersion models of planar subcubic graphs, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
- Cutwidth: obstructions and algorithmic aspects, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
- IPEC 2016 (best paper award)
- doi
- arxiv
- bib
- Linear kernels for edge deletion problems to immersion-closed graph classes, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
- On the tractability of optimization problems in H-graphs, with Fedor V. Fomin and Petr Golovach
- A tight Erdős-Pósa function for planar minors, with Wouter Cames van Batenburg, Tony Huynh, and Gwenaël Joret
- Enumerating minimal dominating sets in triangle-free graphs, with Marthe Bonamy, Oscar Defrain, and Marc Heinrich
- Lean tree-cut decompositions: obstructions and algorithms, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
In journals
- Low polynomial exclusion of planar graph patterns, with Dimitrios M. Thilikos
- An edge variant of the Erdős-Pósa property, with Ignasi Sau and Dimitrios M. Thilikos
- Scattered packings of cycles, with Aistis Atminas and Marcin Kamiński
- Recent techniques and results on the Erdős-Pósa property, with Dimitrios M. Thilikos
- Minors in graphs of large θr-girth, with Dimitris Chatzidimitriou, Ignasi Sau, and Dimitrios M. Thilikos
- Well-quasi-ordering H-contraction-free graphs, with Marcin Kamiński, and Théophile Trunck
- Packing and covering immersion models of planar sub-cubic graphs, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
- An O(log OPT)-approximation for covering/packing minor models of θr, with Dimitris Chatzidimitriou, Ignasi Sau, and Dimitrios M. Thilikos
- Multigraphs without large bonds are wqo by contraction, with Marcin Kamiński and Théophile Trunck
- Polynomial expansion and sublinear separators, with Louis Esperet
- Hitting minors, subdivisions, and immersions in tournaments
- A tight Erdős-Pósa function for wheel minors, with Pierre Aboulkers, Samuel Fiorini, Tony Huynh, Gwenaël Joret, and Ignasi Sau
- Cutwidth: obstructions and algorithmic aspects, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
- Induced minors and well-quasi-ordering, with Jarosław Błasiok, Marcin Kamiński, and Théophile Trunck
- A tight Erdős-Pósa function for planar minors, with Wouter Cames van Batenburg, Tony Huynh, and Gwenaël Joret
- On the tractability of optimization problems in H-graphs, with Fedor V. Fomin and Petr Golovach
- Enumerating minimal dominating sets in Kt-free graphs and variants, with Marthe Bonamy, Oscar Defrain, Marc Heinrich, and Michał Pilipczuk
- Linear kernels for edge deletion problems to immersion-closed graph classes, with Archontia Giannopoulou, Michał Pilipczuk, Dimitrios M. Thilikos, and Marcin Wrochna
- accepted by SIAM Journal on Discrete Mathematics (2020)
- arxiv
- A Menger-like property of tree-cut width, with Archontia Giannopoulou, O-joung Kwon, and Dimitrios M. Thilikos
- Packing and covering induced subdivisions, with O-joung Kwon
Popular science
- Beaux ordres et graphes (poster in french)
- presented at the event Journées nationales du GDR-IM (2016)
- hal
Code
- phitigra, a visual graph editor for SageMath
- 2020-
- repository
- domenum, a python/sage implementation of the algorithm described in our article Enumerating minimal dominating sets in Kt-free graphs and variants (see above)
- 2018-2019
- part of SageMath since version 9.1
- source
- splitenum, a python/sage implemetation of the enumeration algorithm for minimal dominating sets in split graphs described by Kanté et al. in On the enumeration of minimal dominating sets and related notions. (doi, arxiv)
- 2018
- tarball
Education
- 2013-2016: PhD at the University of Warsaw and the University of Montpellier (cotutelle), supervised by Marcin Kamiński and Dimitrios M. Thilikos. Links to the manuscript and the slides.
- Thesis defended at LIRMM on 18/11/2016
- Reviewers: Petr Golovach and Nicolas Nisse
- Examiners: Stéphane Bessy, Fedor V. Fomin, Laurent Imbert, Jerzy Tiuryn, and Nicolas Trotignon
- 2011-2013: Master (equiv. Master's degree) at École Normale Supérieure de Lyon, France, including one term of Erasmus exchange program at Uppsala University, Sweden
- Master's thesis Extensions of the grid exclusion theorem prepared at LIRMM under the supervision of Dimitrios M. Thilikos
- 2010-2011: L3 (equiv. last year of Bachelor) at École Normale Supérieure de Lyon, France
- 2008-2010: classe prépa at Lycée Berthollet, Annecy, France.
Teaching
At the University of Montpellier (Faculté des Sciences):
- 2015-2016, spring term: exercise sessions for the lecture Models of computation (HLIN203, L1, 33h);
- 2015-2016, fall term: computer lab sessions for the lecture Graph algorithms (HLIN501, L3, 16.5h);
- 2014-2015, spring term: computer lab sessions for the lecture Imperative programming (HLIN202, L1, 18h);
- 2014-2015, fall term: exercise/lab sessions for the lecture Introduction to algorithms and programming (HLIN101, L1, 24h and 27h).
Student supervision
At the University Clermont Auvergne / ISIMA:
- spring 2020: supervision of the M1 internship of Hippolyte Lapendéry
- spring 2020: supervision of the Prep’ISIMA 2 programming project Lyapunov
- spring 2020: supervision of the Prep’ISIMA 2 programming project Space Billiard
At the University of Montpellier (Faculté des Sciences):
- spring 2016: supervision of Clément Daumet, Nicolas Theron, and Dorine Tabary for the programming project (TER L3) Growing trees by programming
- spring 2016: supervision of Mohamed Bareche, Jordan Ferrad, and Tianome Rasolohery programming project (TER L3) A shooter game with gravity
Talks
2019
- IRIF Graphs Seminar, Paris, France (May 2019): Enumerating minimal dominating sets in Kt-free graphs, joint work with Marthe Bonamy, Oscar Defrain, Marc Heinrich, and Michał Pilipczuk (slides);
- STACS 2019, Berlin, Germany (March 2019): Lean tree-cut decompositions: obstructions and algorithms, joint work with A. Giannopoulou, O.-j. Kwon, and D. M. Thilikos (slides);
- LaS Seminar, Berlin, Germany (February 2019): A Menger-like property for tree-cut width, joint work with A. Giannopoulou, O.-j. Kwon, and D. M. Thilikos (blackboard).
2018
- Seminar of the Combinatorial Optimization team, G-SCOP, Grenoble, France (November 2018): Enumerating minimal dominating sets in triangle-free graphs, joint work with M. Bonamy, O. Defrain, and M. Heinrich;
- JGA 2018, Grenoble, France (November 2018): Packing et couverture de mineurs, joint work with W. Cames van Batenburg, T. Huynh, and G. Joret;
- LaS Seminar, Berlin, Germany (October 2018): Enumerating minimal dominating sets in triangle-free graphs, joint work with M. Bonamy, O. Defrain, and M. Heinrich (slides);
- Dagstuhl Seminar on Algorithmic Enumeration, Dagstuhl, Germany (October 2018): Enumerating minimal dominating sets in triangle-free graphs, joint work with Marthe Bonamy, Oscar Defrain, and Marc Heinrich (slides);
- LaS Seminar, Berlin, Germany (October 2018): Tight Erdős-Pósa bounds for minors, joint work with W. Cames van Batenburg, T. Huynh, and G. Joret (slides);
- GT2018, Nyborg, Denmark (August 2018): Optimal min-max bounds for packing and covering minors, joint work with W. Cames van Batenburg, T. Huynh, and G. Joret (slides);
- Seminar ACRO, Luminy, France (March 2018): Separators and expansion, joint work with L. Esperet.
2017
- JGA 2017, Bordeaux, France (November 2017): (Un)tractable problems on H-graphs, joint work with F. V. Fomin and P. Golovach (slides in french);
- Seminar Graphes@Lyon, Lyon, France (September 2017): Separators and expansion, joint work with L. Esperet;
- Seminar of the Algorithms group of the University of Bergen, Norway (June 2017): Expansion & separators (slides), joint work with L. Esperet;
- Seminar at University of Primorska, Koper, Slovenia (May 2017): Polynomial expansion and sublinear separators (slides), joint work with L. Esperet;
- Seminar of the Graphes et Optimisation team, Labri, Bordeaux, France (May 2017): Polynomial expansion and balanced sublinear separators (slides), joint work with L. Esperet;
- Seminar of the Combinatorial Optimization team, G-SCOP, Grenoble, France (April 2017): Cutwidth: obstructions and algorithmic aspects (slides), joint work with A. Giannopoulou, Mi. Pilipczuk, D. M. Thilikos, and M. Wrochna;
- Seminar of the LaS group, Berlin, Germany (March 2017): Immersions and edge-deletion problems (slides), joint work with A. Giannopoulou, Mi. Pilipczuk, D. M. Thilikos, and M. Wrochna;
- Algolunch at ULB, Brussels, Belgium (February 2017): Algorithms for minor deletion problems (blackboard);
- Seminar of the Graphes et Optimisation team, Labri, Bordeaux, France, January 27, 2017: Recent results and techniques on the Erdős-Pósa property (slides);
- Seminar of the APR team, LIP6, Paris, France (January 2017): Well-quasi-orders: from combinatorics to algorithms, contains joint work with J. Błasiok, M. Kamiński, and T. Trunck.
2016
- Seminar Graphes@Lyon, Lyon, France (December 2016): Deleting immersions, joint work with A. Giannopoulou, Mi. Pilipczuk, D. M. Thilikos, and M. Wrochna;
- Journées du GT COA, Bordeaux, France (November 2016): Linear kernels for edge deletion problems to immersion-closed graph classes (slides), joint work with A. Giannopoulou, Mi. Pilipczuk, D. M. Thilikos, and M. Wrochna;
- BGW 2016, Bordeaux, France (November 2016): Obstructions to bounded cutwidth, joint work with A. Giannopoulou, Mi. Pilipczuk, D. M. Thilikos, and M. Wrochna;
- Seminar of the team AlGCo at LIRMM, Montpellier, France (April 2016): Packing and covering immersion models of planar subcubic graphs (slides), joint work with A. Giannopoulou, O.-j. Kwon, and D. M. Thilikos;
- 17-th JCALM at LIRMM, Montpellier, France (March 2016): Separators & expansion (slides), based on this article.
2015
- Seminar of the team AlGCo at LIRMM, Montpellier, France (December 2015): Minors of cliques in graphs of large θr-girth (blackboard), joint work with D. Chatzidimitriou, I. Sau and D. M. Thilikos;
- JGA 2015, Orléans, France (November 2015): Graph decompositions and well-quasi-ordering (slides), contains joint work with J. Błasiok, M. Kamiński and T. Trunck;
- GROW 2015, Aussois, France (October 2015): The structure of graphs excluding Gem and K4^ as induced minors (slides), joint work with J. Błasiok, M. Kamiński, and T. Trunck;
- Seminar of LIMOS, Clermont-Ferrand, France (September 2015): The Erdős-Pósa property: from combinatorics to approximation (slides), joint work with D. Chatzidimitriou, I. Sau, and D. M. Thilikos;
- EuroComb'15, Bergen, Norway (September 2015): Induced minors and well-quasi-ordering (slides), joint work with J. Błasiok, M. Kamiński and T. Trunck;
- Seminar of the team "Algorithmique Distribuée et Graphes" at LIAFA, Paris, France (March 2015): Erdős-Pósa for pumpkins and approximation (slides), joint work with D. Chatzidimitriou, I. Sau, and D. M. Thilikos;
- CIRM International Workshop on Graph Decomposition, Marseille, France (January 2015): Multigraphs without large bonds are wqo by contraction (slides), joint work with M. Kamiński and T. Trunck.
2014
- BGW 2014, Bordeaux, France, (November 2014): Multigraphs without large bonds are wqo by contraction (slides), joint work with M. Kamiński and T. Trunck;
- JGA 2014, Dijon, France, (November 2014): Packings induits de cycles (slides in french), joint work with Aistis Atminas and M. Kamiński;
- Seminar of the team AlGCo at LIRMM, Montpellier, France (September 2014): Induced packings of cycles (slides), joint work with Aistis Atminas and M. Kamiński;
- ICGT 2014, Grenoble, France (June 2014): An edge version of the Erdős-Pósa property (slides), joint work with I. Sau and D. M. Thilikos;
- Seminar of the team AlGCo at LIRMM, Montpellier, France (February 2014): Induced minors and well-quasi-ordering (slides), joint work with J. Błasiok, M. Kamiński and T. Trunck.
2013
- BWAG 2013, Bertinoro, Italy (December 2013): An edge version of the Erdős-Pósa property (slides), joint work with I. Sau and D. M. Thilikos;
- JGA 2013, Orsay, France (November 2013): Une version arêtes de la propriété d'Erdős-Pósa (slides in french), joint work with I. Sau and D. M. Thilikos;
- EuroComb'13, Pisa, Italy (September 2013): Polynomial gap extensions of the Erdős-Pósa theorem (slides), joint work with D. M. Thilikos;
- Seminar of the team AlGCo at LIRMM, Montpellier, France (May 2013): Extensions of the grid exclusion theorem, joint work with D. M. Thilikos and I. Sau.
2011
- JGA 2011 Lyon, France (November 2011): Implantation des algorithmes Oum-Seymour et Oum (slides), joint work with B.-M. Bùi-Xuân and P. Trébuchet.
Here and there
2019
- Journées Graphes et Algorithmes (JGA 2019), Brussels, Belgium, November 13-15 2019;
- stay in Paris (ENS/IRIF/Lamasade) with Pierre Aboulker, Eun-Jung Kim, and Valia Mitsou, May 20-28, 2019;
- STACS 2019, Berlin, Germany, March 13-16 2019;
- Free Computational Mathematics workshop, CIRM, Marseille, France, February 11-15 2019.
2018
- stay at in the Combinatorial Optimization team of G-SCOP with Louis Esperet, Grenoble, France, November 19-23 2018;
- Journées Graphes et Algorithmes (JGA 2018), Grenoble, France, November 14-16 2018;
- stay in the AlCoLoCo group at LIMOS with Aurélie Lagoutte and Lucas Pastor, Clermont-Ferrand, France, November 5-9 2018;
- Dagstuhl Seminar on Algorithmic Enumeration, Dagstuhl, Germany, October 14-19, 2018;
- stay at Universität Ulm with Henning Bruhn-Fujimoto, Ulm, Germany, October 1-5, 2018;
- GRASTA 2018, Berlin, Germany, September 24-27, 2018;
- ErichFest and Highlights of Logic, Games, and Automata, Berlin, Germany, September 17-21, 2018;
- GT2018, Nyborg, Denmark, August 29-September 1, 2018;
- Pessac Graph Workshop on enumeration, Pessac, France, August 6-10, 2018;
- Pessac Graph Workshop on reconstruction, Pessac, France, August 13-17, 2018;
- stay at in the Combinatorial Optimization team of G-SCOP with Louis Esperet, Grenoble, France, June 18-22 2018;
- stay in the ACRO group at LIF with Kolja Knauer, Luminy, March 26-30 2018;
- Algorithmic Model Theory Meeting (AlMoTh 2018), Berlin, March 6 2018.
2017
- stay at ULB with Gwenaël Joret, Brussels, Belgium, December 18-22 2017;
- Journées Graphes et Algorithmes (JGA 2017), Bordeaux, France, November 15-17 2017;
- stay in the Algorithms group of the University of Bergen with Fedor Fomin and Petr Golovach, Norway, May 28-June 19 2017;
- stay at the University of Primorska with Martin Milanič, Koper, Slovenia, May 8-26 2017;
- stay at in the Combinatorial Optimization team of G-SCOP with Louis Esperet and Nicolas Bousquet, Grenoble, France, April 3-21 2017;
- stay at the University of Rome La Sapienza in Paul Wollan's group, Rome, Italy, March 20-31 2017;
- stay at TU Berlin in the logic and semantics group with Archontia Giannopoulou and O-joung Kwon, Berlin, Germany, February 20 - March 10 2017;
- stay at ULB with Gwenaël Joret, Brussels, Belgium, January 30-February 17 2017;
- Combinatorics Days of Bordeaux (JCB 2017), Bordeaux, France, January 25-27 2017;
- stay in the GAMoC team at LIFO with Mathieu Liedloff and Pedro Montealegre, Orléans, France, January 9-20 2017;
- stay at LIP6 with Bình-Minh Bùi-Xuân, Paris, France, January 2-6 2017.
2016
- Journées du GT COA, Bordeaux, France, November 28-29 2016 ;
- Bordeaux Graph Workshop (BGW 2016), Bordeaux, France, November 7-10 2016;
- stay at TU Berlin with Archontia Giannopoulou and O-joung Kwon, Berlin, Germany, September 19-30 2016;
- Order & Geometry Workshop, Gułtowy, Poland, September 14-17 2016;
- stay at LIRIS with Nicolas Bousquet, Lyon, France, July 18-22 2016;
- DoctISS 2016, Montpellier, France, June 13 2016 (see my poster);
- 43th Spring School of Theoretical Computer Science, CIRM, Marseille, France, May 9-13 2016;
- 17e Journées Combinatoire et Algorithmes du Littoral Méditerranéen (JCALM), Montpellier, France, March 10-11, 2016;
- Journées nationales du GDR-IM, Villetaneuse, France, January 18-20 2016 (see my poster).
2015
- Journées Graphes et Algorithmes (JGA 2015), Orléans, France, November 4-6 2015;
- 7th Workshop on Graph Classes, Optimization and Width parameters (GROW 2015), Aussois, France, October 11-15 2015;
- European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Bergen, Norway, August 31-September 4 2015;
- Algorithmic Graph Theory on the Adriatic Coast, Koper, Slovenia, June 16-19 2015;
- School on graph theory (SGT2015), Porquerolles, France, May 18-22 2015;
- 15e Journées Combinatoire et Algorithmes du Littoral Méditerranéen (JCALM), Sophia-Antipolis, France, March 10-11, 2015;
- stay at LIAFA, Paris, France, February 23-March 6, 2015;
- CIRM International Workshop on Graph Decomposition, Marseille, France, January 19-23 2015.
2014
- Bordeaux Graph Workshop (BGW2014), Bordeaux, France, November 19-22 2014;
- Journées Graphes et Algorithmes (JGA 2014), Dijon, France, November 12-14 2014;
- Summer school on Parameterized Algorithms and Complexity, Będlewo, Poland, August 17-22 2014;
- 9th International Colloquium on Graph Theory and Combinatorics (ICGT 2014), Grenoble, France, June 30-July 4 2014;
- stay at LIAFA, Paris, France, April 7-18 2014;
2013
- Bertinoro Workshop on Algorithms and Graphs (BWAG 2013), Bertinoro, Italy, December 15-20 2013;
- Journées Graphes et Algorithmes (JGA 2013), Orsay, France, November 13-15 2013;
- 6th workshop on Graph Classes, Optimization, and Width Parameters (GROW 2013), Santorini, Greece, October 9-11 2013;
- European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2013), Pisa, Italy, September 9-13 2013;
- 13e Journées Combinatoire et Algorithmes du Littoral Méditerranéen (JCALM), Marseille, France, June 10-11 2013;
- research internship at LIRMM, Montpellier, France in the team AlGCo under the supervision of D. M. Thilikos (topics: Graph Minors, Erdős-Pósa property, graphs exclusion theorems), Febuary-June 2013;
2011
- Journées Graphes et Algorithmes (JGA 2011), Lyon, France, November 16-18 2011;
- research internship at LIP6, Paris, France in the team APR under the supervision of B.-M. Bùi-Xuân and P. Trébuchet (topic: implementation of a FPT algorithm for computing a rank decomposition), June-July 2011.
Misc
From 2014 to 2017 I was PI of the project Graphs within graphs funded by a PRELUDIUM grant from the Polish National Science Center.
During academic year 2013-2014 I was fellow of the Warsaw Center of Mathematics and Computer Science.
- March 2016: member of the organizing commitee of the days JCALM;
- October 2015: member of the organizing commitee of the workshop GROW.
Links
My pages on ORCID, HAL, DBLP, and arxiv.
On this page, I collect results about the Erdős-Pósa property.
Web pages of some friends: Paul-Elliot Anglès d'Auriac, Basile Augé, Simon Castellan, Vincent Cohen-Addad, Loïc Gaillard, Maxime Herda, Lucca Hirschi, Guillaume Lagarde.
Last updated: November 2020.