Research

 

Publications

 

Upcoming work

  • Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. With C. Brosse, V. Limouzy, A. Mary and L. Pastor. Submitted
  • (2K2, W4)-free graphs are ω +1 colorable. With N. Bousquet. In preparation

 

Journal papers

 

Conference papers

Book chapter

Unpublished

Talks (needs an update!):

 

Date Place & Title Slides
2016 - Mar 17 Combinatorial Opt. Seminar -G-SCOP, Grenoble  
 
Coloring perfect graphs with bounded clique number
 
2016 - Mar 10 COATI Seminar -I3S, Nice/Sophia-Antipolis  
 
Coloring graphs with no even hole >= 6: the triangle-free case
 
2016 - Feb 29 ACRO Seminar -LIF, Marseille  
 
Coloring perfect graphs with bounded clique number
 
2016 - Jan 28 AlGCo Seminar -LIRMM, Montpellier here
 
Coloring perfect graphs with bounded clique number
 
2016 - Jan 25 4th Workshop from ANR Project STINT, Saint-Bonnet-en-Champsaur here
 
Coloring perfect graphs with bounded clique number
 
2015 - Oct 15 Discrete Mathematics Seminar, Princeton University here
 
Clique-Stable set Separation
 
2015 - July 3 GOAL Seminar, LIRIS, University Lyon 1 here
 
Coloring graphs with no even holes of length at least 6: the triangle-free case
 
2014 - Dec 4 G-SCOP Seminar, University of Grenoble here
 
From extended formulations of polytopes to the Clique-Stablet Set separation
 
2014 - Nov 19 Conference BGW'2014, Bordeaux here
 
Identifying codes and VC-dimension
 
2014 - Nov 14 2nd Lyon-Sao Paulo Research Workshop, Sao Paulo, Brazil here
 
Extended formulations of polytopes and Communication Complexity
 
2014 - Oct 7 Graph Seminar in MC2/DANTE teams - LIP, ENS Lyon (blackboard)
 
Triangle-free graphs with no induced cycle of even length at least 6 have bounded chromatic number.
 
2014 - Sept 24 2nd Workshop from ANR project STINT, Lans-en-Vercors  
 
Extended Formulations: an Introduction
 
2014 - June 16 Informal seminar at the Dipartimento di Matematica, University of Padova, Italy (blackboard)
 
Clique-Stable set separation
 
2014 - Feb 13 AlGCo Seminar - LIRMM, University of Montpellier here
 
Clique Stable Set separation: an overview and a focus on perfect graphs with no balanced skew partition
 
2013 - Dec 19 Bertinoro Workshop on Algorithms and Graphs, Bertinoro, Italy here
 
Clique Stable Set separation in perfect graphs with no balanced skew partition
 
2013 - Dec 3 Graph Seminar in MC2/DANTE teams - LIP, ENS Lyon here
 
Clique Stable Set separation: an overview and a focus on perfect graphs with no balanced skew-partition
 
2013 - Nov 14 JGA (Journées Graphes et Algorithmes) - LRI, Orsay here
 
Clique Stable Set separation in perfect graphs with no balanced skew-partition
 
2013 - April 8 EJC (Ecole Jeunes Chercheurs) - University of Perpignan  
 
10 minutes to understand the Clique-Stable set Separation
 
2012 - Nov 15 JGA (Journées Graphes et Algorithmes) - LIMOS, Clermont-Ferrand here
 
Quasi P versus P: The Polynomial Alon-Saks- Seymour conjecture and related problems
 
2012 - Nov 8 LIMOS Seminar, Clermont-Ferrand here
 
Quasi P versus P: The Polynomial Alon-Saks- Seymour conjecture and related problems
 

 

 

Posted by May 13th, 2020