Publications
Conferences:
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
- With Mamadou Kanté, Arnaud MaryLhouari Nourine and Takeaki Uno
- WG 2015 - Munich - Germany
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
- With Mamadou Kanté, Arnaud MaryLhouari Nourine and Takeaki Uno
- WADS 2015 - Victoria - Canada
- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs DOI
- With Mourad Baïou, Laurent Beaudou and Zhentao Li
- ISAAC 2013 - Hong-Kong - LNCS 8283, pp 196-206
- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs DOI
- With Mamadou Kanté, Arnaud MaryLhouari Nourine and Takeaki Uno
- ISAAC 2013 - Hong-Kong - LNCS 8283, pp 339-349
- On the Neighbourhood Helly of some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets DOI
- With Mamadou Kanté, Arnaud Mary and Lhouari Nourine
- ISAAC 2012 - Taipei Taiwan , LNCS 7676, 2012, pp 289-298
- Enumeration of Minimal Dominating Sets and Variants. DOI
- With Mamadou Kanté, Arnaud Mary and Lhouari Nourine
- FCT 11 - Oslo, Norway - LNCS 6914, pp. 298-309
- String graphs of k-bend paths on a grid. DOI
- With Andrei Asinowski, Elad Cohen, Martin Golumbic, Marina Lipshteyn and Michal Stern
- LAGOS 11 - Bariloche, Argentina - Electronic Notes in Discrete Mathematics, 37, 2011, pp. 141-146
- Seidel Minor, Permutation Graphs and Combinatorial Properties.DOI
- ISAAC 2010 - Jeju, Korea, LNCS 6506, pp 194-205
- On some simplicial elimination schemes for chordal graphs DOI
- With Michel Habib
- AGT 2009 - Warwick, UK - Electronic Notes in Discrete Mathematics, 32, 2009, pp. 125-132
- NLC-2 graph recognition and isomorphism. DOI
- With Fabien de Montgolfier and Michaël Rao
- WG 2007 - Dornburg, Germany - Springer, LNCS 4769 - pp. 86-98
- Unifying two Graph Decompositions with Modular Decomposition. DOI
- With Binh-Minh Bui-Xuan, Michel Habib and Fabien de Montgolfier
- ISAAC 2007 - Sendai, Japan - Springer, LNCS 4835 - pp. 52-64
- Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. DOI
- With Binh-Minh Bui-Xuan, Michel Habib and Fabien de Montgolfier
- WG 2006 - Bergen, Norway - Springer, LNCS 4271 - pp. 278-288
Journals:
- Revisiting a Theorem by Folkman on Graph Colouring DOI
- With Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Lucas Pastor, and Jean-Sébastien Sereni
- The Electronic Journal of Combinatorics, Volume 27(1), 2020, P1.56
- Co-TT graphs and a characterization of split co-TT graphsDOI
- With Martin Golumbic, and Nirit Lefel-Weingarten
- Discrete Applied Mathematics, Volume 165, 11 March 2014, Pages 168-174
- Vertex Intersection Graphs of Paths on a Grid.DOI
- With Andrei Asinowski, Elad Cohen, Martin Golumbic, Marina Lipshteyn and Michal Stern
- Journal of Graph Algorithms and Applications, 16(2)-2012 - pp. 129-150
- Algorithmic Aspects of a General Modular Decomposition TheoryDOI
- With Binh-Minh Bui-Xuan, Michel Habib and Fabien de Montgolfier
- Discrete Applied Mathemathics.
- A Note On Computing Set Overlap ClassesDOI
- With Pierre Charbit, Michel Habib, Fabien de Montgolfier, Mathieu Raffinot and Michaël Rao
- Information Processing Letters. 108(4), 2008, pp. 186-191
