Compact Labelings For Efficient First-Order Model-Checking
Bruno Courcelle
,
Cyril Gavoille
,
Mamadou Moustapha Kanté
Journal of Combinatorial Optimization , 2011, 21 (1), pp.19--46
Journal articles
hal-00342668v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
The Rank-Width of Edge-Coloured Graphs
Mamadou Moustapha Kanté
,
Michaël Rao
Journal articles
hal-02083523v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
mathbb \emphF\mathbb F-Rank-Width of (Edge-Colored) Graphs
Mamadou Moustapha Kanté
,
Michaël Rao
Conference papers
istex
hal-02083539v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Mamadou Moustapha Kanté
,
Eun Jung Kim
,
O-Joung Kwon
,
Christophe Paul
Conference papers
lirmm-01264011v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Fast exact algorithms for some connectivity problems parametrized by clique-width
Benjamin Bergougnoux
,
Mamadou Moustapha Kanté
,
Mamadou Kanté
2017
Preprints, Working Papers, ...
hal-01560555v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
,
Takeaki Uno
et al.
Algorithms and Data Structures (WADS) , Aug 2015, Victoria, Canada. pp.446-457
Conference papers
hal-01248851v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Counting Minimal Transversals of ß-Acyclic Hypergraphs
Benjamin Bergougnoux
,
Florent Capelli
,
Mamadou Moustapha Kanté
2018
Preprints, Working Papers, ...
hal-01610959v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Enumeration of Minimal Dominating Sets and Variants
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
Conference papers
istex
hal-02083540v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
Isolde Adler
,
Mamadou Moustapha Kanté
,
O-Joung Kwon
Journal articles
hal-02083514v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
The Lattice of all Betweenness Relations: Structure and Properties
Laurent Beaudou
,
Mamadou Moustapha Kanté
,
Lhouari Nourine
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications , 2012, Fuengirola (Málaga), Spain. pp.317--326
Conference papers
hal-02083534v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
,
Takeaki Uno
et al.
Conference papers
istex
hal-02083525v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Finding Paths in Grids with Forbidden Transitions
Mamadou Moustapha Kanté
,
Fatima Zahra Moataz
,
Benjamin Momège
,
Nicolas Nisse
[Research Report] Inria Sophia Antipolis; Univeristé Nice Sophia Antipolis; CNRS. 2015
Reports
hal-01115395v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Enumerating minimal dominating sets in chordal bipartite graphs
Petr A. Golovach
,
Pinar Heggernes
,
Mamadou Moustapha Kanté
,
Dieter Kratsch
,
Yngve Villanger
et al.
Journal articles
hal-02083515v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the Enumeration of Minimal Dominating Sets and Related Notions
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
Journal articles
hal-01765527v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
A Note on Graphs of Linear Rank-Width 1
Binh-Minh Bui-Xuan
,
Mamadou Moustapha Kanté
,
Vincent Limouzy
CoRR , 2013, abs/1306.1345
Journal articles
hal-02083532v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
,
Takeaki Uno
et al.
Book sections
hal-02082337v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
Mamadou Moustapha Kanté
,
Christian Laforest
,
Benjamin Momège
Conference papers
istex
hal-02083527v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On paths in grids with forbidden transitions
Mamadou Moustapha Kanté
,
Fatima Zahra Moataz
,
Benjamin Momège
,
Nicolas Nisse
ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications , Jun 2015, Beaune, France
Conference papers
hal-01142745v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Counting Minimal Dominating Sets
Mamadou Moustapha Kanté
,
Takeaki Uno
Conference papers
hal-01630342v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions
Mamadou Moustapha Kanté
,
O-Joung Kwon
Journal articles
hal-02083482v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width
Mamadou Moustapha Kanté
,
O-Joung Kwon
CoRR , 2014, abs/1412.6201
Journal articles
hal-02083521v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
Mamadou Moustapha Kanté
,
Lhouari Nourine
Journal articles
hal-01765439v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
Benjamin Bergougnoux
,
O-Joung Kwon
,
Mamadou Moustapha Kanté
WADS 2017 , Jul 2017, St. John’s, Canada
Conference papers
hal-01590820v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Linear Rank-Width and Linear Clique-Width of Trees
Isolde Adler
,
Mamadou Moustapha Kanté
Conference papers
istex
hal-02083531v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Trees in Graphs with Conflict Edges or Forbidden Transitions
Mamadou Moustapha Kanté
,
Christian Laforest
,
Benjamin Momège
Conference papers
istex
hal-02083529v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
Mamadou Moustapha Kanté
,
Vincent Limouzy
,
Arnaud Mary
,
Lhouari Nourine
Conference papers
hal-02083535v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Mamadou Moustapha Kanté
,
Eun Jung Kim
,
O-Joung Kwon
,
Christophe Paul
Journal articles
lirmm-01692676v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
Alessio Conte
,
Roberto Grossi
,
Mamadou Moustapha Kanté
,
Andrea Marino
,
Takeaki Uno
et al.
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science , Aug 2019, Aachen, Germany. pp.1-14,
⟨10.4230/LIPIcs.MFCS.2019.73⟩
Conference papers
hal-02335601v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Petr A. Golovach
,
Pinar Heggernes
,
Mamadou Moustapha Kanté
,
Dieter Kratsch
,
Sigve Sæther
et al.
Journal articles
hal-02083480v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On Maximal Cliques with Connectivity Constraints in Directed Graphs
Alessio Conte
,
Mamadou Moustapha Kanté
,
Takeaki Uno
,
Kunihiro Wasa
Conference papers
hal-01630384v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More