KANTE - Mamadou

All publications(48)
2019
UNDEFINED
Benjamin Bergougnoux, Mamadou Moustapha Kanté
A Meta-Algorithm for Solving Connectivity and Acyclicity Constraints on Locally Checkable Properties Parameterized by Graph Width Measures
Informatique/Algorithme et structure de données
2019
COMM
Alessio Conte, Roberto Grossi, Mamadou Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science - 2019
2019
ART
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of β-Acyclic Hypergraphs
Journal of Computer and System Sciences - 2019
Informatique/Algorithme et structure de données
2018
UNDEFINED
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.
Informatique/Algorithme et structure de données
2018
UNDEFINED
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of ß-Acyclic Hypergraphs
Informatique/Algorithme et structure de données
2018
COMM
Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
Computing Small Pivot-Minors
WG: Graph-Theoretic Concepts in Computer Science - 2018
Informatique/Complexité
2018
ART
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of (β)-Acyclic Hypergraphs
CoRR - 2018
Informatique/Complexité
2018
ART
Petr Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Algorithmica - 2018
Informatique/Complexité
2018
ART
Mamadou Moustapha Kanté, O-Joung Kwon
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions
Eur. J. Comb. - 2018
Informatique/Complexité
2018
COMM
Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri
Enumerating Minimal Transversals of Hypergraphs without Small Holes
43rd International Symposium on Mathematical Foundations of Computer Science - 2018
Informatique/Complexité
2017
ART
Mamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Algorithmica - 2017
Informatique/Mathématique discrète
2017
COMM
Benjamin Bergougnoux, O-Joung Kwon, Mamadou Moustapha Kanté
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
WADS 2017 - 2017
Informatique/Complexité
2017
ART
Petr Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Minimal dominating sets in interval graphs and trees
Discrete Applied Mathematics - 2017
Informatique/Algorithme et structure de données
2017
ART
Isolde Adler, Mamadou Moustapha Kanté, O-Joung Kwon
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
Algorithmica - 2017
Informatique/Complexité
2017
UNDEFINED
Benjamin Bergougnoux, Mamadou Moustapha Kanté, Mamadou Kanté
Fast exact algorithms for some connectivity problems parametrized by clique-width
Informatique/Complexité
2017
UNDEFINED
Benjamin Bergougnoux, Mamadou Moustapha Kanté, Mamadou Kanté
Fast exact algorithms for some connectivity problems parametrized by clique-width
Informatique/Complexité
2017
COMM
Mamadou Moustapha Kanté, Takeaki Uno
Counting Minimal Dominating Sets
TAMC'17 - 2017
Informatique/Complexité
2017
COMM
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph
Computing and Combinatorics - 23rd International Conference, {COCOON} 2017, Hong Kong, China, August 3-5, 2017, Proceedings - 2017
Informatique/Algorithme et structure de données
2017
COMM
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
On Maximal Cliques with Connectivity Constraints in Directed Graphs
28th International Symposium on Algorithms and Computation (ISAAC 2017) - 2017
Informatique/Complexité
2016
COUV
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Informatique/Algorithme et structure de données
2016
ART
Mamadou Moustapha Kanté, Lhouari Nourine
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
SIAM Journal on Discrete Mathematics - 2016
Informatique/Algorithme et structure de données
2016
ART
Petr Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Enumerating minimal dominating sets in chordal bipartite graphs
Discrete Applied Mathematics - 2016
Informatique/Complexité
2015
COMM
Christophe Paul, Eun Jung Kim, Mamadou Moustapha Kanté, O-Joung Kwon
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
IPEC: International symposium on Parameterized and Exact Computation - 2015
Informatique/Mathématique discrète
2015
COMM
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
Algorithms and Data Structures (WADS) - 2015
Informatique/Algorithme et structure de données
2015
COMM
Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse
Finding Paths in Grids with Forbidden Transitions
WG 2015, 41st International Workshop on Graph-Theoretic Concepts in Computer Science - 2015
Informatique/Complexité
2015
COMM
Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse
On paths in grids with forbidden transitions
ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications - 2015
Informatique/Complexité
2015
REPORT
Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse
Finding Paths in Grids with Forbidden Transitions
Informatique/Complexité
2015
ART
Mamadou Moustapha Kanté, Eun Kim, O-Joung Kwon, Christophe Paul
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion
CoRR - 2015
Informatique/Complexité
2015
ART
Isolde Adler, Mamadou Moustapha Kanté
Linear rank-width and linear clique-width of trees
Theoretical Computer Science - 2015
Informatique/Complexité
2014
ART
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Enumeration of Minimal Dominating Sets and Related Notions
SIAM Journal on Discrete Mathematics - 2014
Informatique/Algorithme et structure de données
2014
ART
Isolde Adler, Mamadou Moustapha Kanté, O-Joung Kwon
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
CoRR - 2014
Informatique/Complexité
2014
ART
Mamadou Moustapha Kanté, O-Joung Kwon
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width
CoRR - 2014
Informatique/Complexité
2014
COMM
Isolde Adler, Mamadou Moustapha Kanté, O-Joung Kwon
Linear Rank-Width of Distance-Hereditary Graphs
Graph-Theoretic Concepts in Computer Science - 40th International Workshop - 2014
Informatique/Complexité
2013
ART
Mamadou Moustapha Kanté, Michaël Rao
The Rank-Width of Edge-Coloured Graphs
Theory Comput. Syst. - 2013
Informatique/Complexité
2013
ART
Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy
A Note on Graphs of Linear Rank-Width 1
CoRR - 2013
Informatique/Complexité
2013
COMM
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
Algorithms and Computation - 24th International Symposium - 2013
Informatique/Complexité
2013
COMM
Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
SOFSEM 2013: Theory and Practice of Computer Science - 2013
Informatique/Complexité
2013
COMM
Mamadou Moustapha Kanté, Lhouari Nourine
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
SOFSEM 2013: Theory and Practice of Computer Science - 2013
Informatique/Complexité
2013
COMM
Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège
Trees in Graphs with Conflict Edges or Forbidden Transitions
Theory and Applications of Models of Computation - 2013
Informatique/Complexité
2013
COMM
Isolde Adler, Mamadou Moustapha Kanté
Linear Rank-Width and Linear Clique-Width of Trees
Graph-Theoretic Concepts in Computer Science - 39th International Workshop - 2013
Informatique/Complexité
2012
ART
Mamadou Moustapha Kanté
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
Eur. J. Comb. - 2012
Informatique/Complexité
2012
COMM
Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine
The Lattice of all Betweenness Relations: Structure and Properties
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications - 2012
Informatique/Complexité
2012
COMM
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
Algorithms and Computation - 23rd International Symposium - 2012
Informatique/Complexité
2011
ART
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact Labelings For Efficient First-Order Model-Checking
Journal of Combinatorial Optimization - 2011
Informatique/Logique en informatique
2011
ART
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact labelings for efficient first-order model-checking
J. Comb. Optim. - 2011
Informatique/Complexité
2011
ART
Mamadou Moustapha Kanté
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs
CoRR - 2011
Informatique/Complexité
2011
COMM
Mamadou Moustapha Kanté, Michaël Rao
mathbb emphFmathbb F-Rank-Width of (Edge-Colored) Graphs
Algebraic Informatics - 4th International Conference - 2011
Informatique/Complexité
2011
COMM
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
Enumeration of Minimal Dominating Sets and Variants
Fundamentals of Computation Theory - 18th International Symposium - 2011
Informatique/Complexité