Vincent Limouzy

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 19

Top Topics

Graph Isomorphism

Maximal Cliques

Polynomial Delay

Graph Colouring

Top Venues

Discret. Appl. Math.

Electron. J. Comb.

Publications

Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. 185 (2024)
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on Outerplanar Graphs. MFCS (2024)
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
The Canadian Traveller Problem on outerplanar graphs. CoRR (2024)
Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. IWOCA (2024)
Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. CoRR (2024)
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. Discret. Appl. Math. 345 (2024)
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
Contact graphs of boxes with unidirectional contacts. CoRR (2023)
Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
On the hardness of inclusion-wise minimal separators enumeration. CoRR (2023)
Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño, Marisa Gutierrez, Vincent Limouzy
On dually-CPT and strong-CPT posets. CoRR (2022)
Caroline Brosse, Vincent Limouzy, Arnaud Mary
Polynomial Delay Algorithm for Minimal Chordal Completions. ICALP (2022)
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR (2021)
Martin Charles Golumbic, Vincent Limouzy
Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels. Order 38 (1) (2021)
Caroline Brosse, Vincent Limouzy, Arnaud Mary
Polynomial delay algorithm for minimal chordal completions. CoRR (2021)
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. CoRR (2020)
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27 (1) (2020)
Arnaud Mary, Vincent Limouzy, Lhouari Nourine
WEPA 2016 preface. Discret. Appl. Math. 268 (2019)
Henri Perret du Cray, Mourad Baïou, Laurent Beaudou, Vincent Limouzy
Bounds on Directed star arboricity in some digraph classes. Electron. Notes Discret. Math. 62 (2017)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS (2015)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG (2015)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Enumeration of Minimal Dominating Sets and Related Notions. SIAM J. Discret. Math. 28 (4) (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR (2014)
Martin Charles Golumbic, Nirit Lefel Weingarten, Vincent Limouzy
Co-TT graphs and a characterization of split co-TT graphs. Discret. Appl. Math. 165 (2014)
Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy
A Note on Graphs of Linear Rank-Width 1. CoRR (2013)
Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. ISAAC (2013)
Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
On a class of intersection graphs. CoRR (2013)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. ISAAC (2013)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. ISAAC (2012)
Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
Vertex Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 16 (2) (2012)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
Enumeration of Minimal Dominating Sets and Variants. FCT (2011)
Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
String graphs of k-bend paths on a grid. Electron. Notes Discret. Math. 37 (2011)
Vincent Limouzy
Seidel Minor, Permutation Graphs and Combinatorial Properties. ISAAC (1) (2010)
Michel Habib, Vincent Limouzy
On some simplicial elimination schemes for chordal graphs. Electron. Notes Discret. Math. 32 (2009)
Vincent Limouzy
Seidel Minor, Permutation Graphs and Combinatorial Properties CoRR (2009)
Michel Habib, Vincent Limouzy
On some simplicial elimination schemes for chordal graphs CoRR (2009)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. 157 (9) (2009)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A note on computing set overlap classes. Inf. Process. Lett. 108 (4) (2008)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Unifying Two Graph Decompositions with Modular Decomposition. ISAAC (2007)
Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
NLC-2 Graph Recognition and Isomorphism. WG (2007)
Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
NLC-2 graph recognition and isomorphism CoRR (2007)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A Note On Computing Set Overlap Classes CoRR (2007)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms CoRR (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. 27 (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Algorithmic Aspects of a Novel Modular Decomposition Theory CoRR (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Unifying two Graph Decompositions with Modular Decomposition CoRR (2006)