default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Limouzy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]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: 34-51 (2024)- [j13]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: 106469 (2024) - [c13]Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci:
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. IWOCA 2024: 382-395 - [c12]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: 19:1-19:16 - [i20]Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci:
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. CoRR abs/2402.18265 (2024) - [i19]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 abs/2403.01872 (2024) - 2023
- [i18]Daniel Gonçalves, Vincent Limouzy, Pascal Ochem:
Contact graphs of boxes with unidirectional contacts. CoRR abs/2301.03865 (2023) - [i17]Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. CoRR abs/2308.15444 (2023) - 2022
- [c11]Caroline Brosse, Vincent Limouzy, Arnaud Mary:
Polynomial Delay Algorithm for Minimal Chordal Completions. ICALP 2022: 33:1-33:16 - [i16]Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño, Marisa Gutierrez, Vincent Limouzy:
On dually-CPT and strong-CPT posets. CoRR abs/2204.04729 (2022) - 2021
- [j12]Martin Charles Golumbic, Vincent Limouzy:
Containment Graphs and Posets of Paths in a Tree: Wheels and Partial Wheels. Order 38(1): 37-48 (2021) - [i15]Caroline Brosse, Vincent Limouzy, Arnaud Mary:
Polynomial delay algorithm for minimal chordal completions. CoRR abs/2107.05972 (2021) - [i14]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 abs/2110.14003 (2021) - 2020
- [j11]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): 1 (2020) - [i13]Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor:
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. CoRR abs/2007.01031 (2020)
2010 – 2019
- 2019
- [j10]Arnaud Mary, Vincent Limouzy, Lhouari Nourine:
WEPA 2016 preface. Discret. Appl. Math. 268: 178 (2019) - 2017
- [j9]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: 267-272 (2017) - 2015
- [c10]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS 2015: 446-457 - [c9]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: 138-153 - 2014
- [j8]Martin Charles Golumbic, Nirit Lefel Weingarten, Vincent Limouzy:
Co-TT graphs and a characterization of split co-TT graphs. Discret. Appl. Math. 165: 168-174 (2014) - [j7]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): 1916-1929 (2014) - [i12]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR abs/1404.3501 (2014) - [i11]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR abs/1407.2036 (2014) - [i10]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR abs/1407.2053 (2014) - 2013
- [c8]Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy:
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. ISAAC 2013: 196-206 - [c7]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: 339-349 - [i9]Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy:
A Note on Graphs of Linear Rank-Width 1. CoRR abs/1306.1345 (2013) - [i8]Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy:
On a class of intersection graphs. CoRR abs/1306.2498 (2013) - 2012
- [j6]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): 129-150 (2012) - [c6]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: 289-298 - 2011
- [j5]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: 141-146 (2011) - [c5]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
Enumeration of Minimal Dominating Sets and Variants. FCT 2011: 298-309 - 2010
- [c4]Vincent Limouzy:
Seidel Minor, Permutation Graphs and Combinatorial Properties. ISAAC (1) 2010: 194-205
2000 – 2009
- 2009
- [j4]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. 157(9): 1993-2009 (2009) - [j3]Michel Habib, Vincent Limouzy:
On some simplicial elimination schemes for chordal graphs. Electron. Notes Discret. Math. 32: 125-132 (2009) - [i7]Michel Habib, Vincent Limouzy:
On some simplicial elimination schemes for chordal graphs. CoRR abs/0901.2645 (2009) - [i6]Vincent Limouzy:
Seidel Minor, Permutation Graphs and Combinatorial Properties. CoRR abs/0904.1923 (2009) - 2008
- [j2]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): 186-191 (2008) - 2007
- [c3]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Unifying Two Graph Decompositions with Modular Decomposition. ISAAC 2007: 52-64 - [c2]Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 Graph Recognition and Isomorphism. WG 2007: 86-98 - [i5]Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao:
A Note On Computing Set Overlap Classes. CoRR abs/0711.4573 (2007) - [i4]Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 graph recognition and isomorphism. CoRR abs/cs/0703013 (2007) - 2006
- [j1]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: 13-14 (2006) - [c1]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG 2006: 278-288 - [i3]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms. CoRR abs/cs/0603048 (2006) - [i2]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Unifying two Graph Decompositions with Modular Decomposition. CoRR abs/cs/0604065 (2006) - [i1]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic Aspects of a Novel Modular Decomposition Theory. CoRR abs/cs/0611019 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
