| On the enumeration of minimal dominating sets and related notions MM Kanté, V Limouzy, A Mary, L Nourine SIAM Journal on Discrete Mathematics 28 (4), 1916-1929, 2014 | 110 | 2014 |
| Vertex intersection graphs of paths on a grid A Asinowski, E Cohen, MC Golumbic, V Limouzy, M Lipshteyn, M Stern Journal of Graph Algorithms and Applications 16 (2), 129-150, 2012 | 82 | 2012 |
| Enumeration of minimal dominating sets and variants MM Kanté, V Limouzy, A Mary, L Nourine International Symposium on Fundamentals of Computation Theory, 298-309, 2011 | 55 | 2011 |
| A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs MM Kanté, V Limouzy, A Mary, L Nourine, T Uno Graph-Theoretic Concepts in Computer Science: 41st International Workshop …, 2016 | 40 | 2016 |
| Polynomial delay algorithm for listing minimal edge dominating sets in graphs MM Kanté, V Limouzy, A Mary, L Nourine, T Uno Workshop on Algorithms and Data Structures, 446-457, 2015 | 38 | 2015 |
| On the enumeration and counting of minimal dominating sets in interval and permutation graphs MM Kanté, V Limouzy, A Mary, L Nourine, T Uno International Symposium on Algorithms and Computation, 339-349, 2013 | 34 | 2013 |
| On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets MM Kanté, V Limouzy, A Mary, L Nourine Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei …, 2012 | 30 | 2012 |
| A note on computing set overlap classes P Charbit, M Habib, V Limouzy, F De Montgolfier, M Raffinot, M Rao Information Processing Letters 108 (4), 186-191, 2008 | 18 | 2008 |
| String graphs of k-bend paths on a grid A Asinowski, E Cohen, MC Golumbic, V Limouzy, M Lipshteyn, M Stern Electronic Notes in Discrete Mathematics 37, 141-146, 2011 | 16 | 2011 |
| Algorithmic aspects of a general modular decomposition theory BM Bui-Xuan, M Habib, V Limouzy, F De Montgolfier Discrete Applied Mathematics 157 (9), 1993-2009, 2009 | 16 | 2009 |
| Seidel minor, permutation graphs and combinatorial properties V Limouzy International Symposium on Algorithms and Computation, 194-205, 2010 | 14 | 2010 |
| On some simplicial elimination schemes for chordal graphs M Habib, V Limouzy arXiv preprint arXiv:0901.2645, 2009 | 12 | 2009 |
| Co-TT graphs and a characterization of split co-TT graphs MC Golumbic, NL Weingarten, V Limouzy Discrete Applied Mathematics 165, 168-174, 2014 | 11 | 2014 |
| NLC-2 graph recognition and isomorphism V Limouzy, F De Montgolfier, M Rao Graph-Theoretic Concepts in Computer Science: 33rd International Workshop …, 2007 | 10 | 2007 |
| Polynomial delay algorithm for minimal chordal completions C Brosse, V Limouzy, A Mary arXiv preprint arXiv:2107.05972, 2021 | 9 | 2021 |
| Homogeneity vs. adjacency: generalising some graph decomposition algorithms BMB Xuan, M Habib, V Limouzy, F De Montgolfier Graph-Theoretic Concepts in Computer Science: 32nd International Workshop …, 2006 | 8 | 2006 |
| Unifying two graph decompositions with modular decomposition BM Bui-Xuan, M Habib, V Limouzy, F De Montgolfier International Symposium on Algorithms and Computation, 52-64, 2007 | 5 | 2007 |
| Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly L Beaudou, C Brosse, O Defrain, F Foucaud, A Lagoutte, V Limouzy, ... Discrete Mathematics & Theoretical Computer Science 25 (Graph Theory), 2024 | 4 | 2024 |
| Revisiting a theorem by Folkman on graph colouring M Bonamy, P Charbit, O Defrain, G Joret, A Lagoutte, V Limouzy, L Pastor, ... arXiv preprint arXiv:1907.11429, 2019 | 4 | 2019 |
| Hardness and algorithms for variants of line graphs of directed graphs M Baïou, L Beaudou, Z Li, V Limouzy International Symposium on Algorithms and Computation, 196-206, 2013 | 4 | 2013 |
