Mamadou Moustapha Kanté

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 43

Top Venues

CoRR

SIAM J. Discret. Math.

Theor. Comput. Sci.

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Benjamin Bergougnoux, Mamadou Moustapha Kanté
Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. 38 (1) (2024)
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR (2024)
Alexey Barsukov, Mamadou Moustapha Kanté
Generalisations of matrix partitions: Complexity and obstructions. Theor. Comput. Sci. 1007 (2024)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
. J. Comb. Theory, Ser. B 160 (2023)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing pivot-minors. CoRR (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR (2023)
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA (2023)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. SIAM J. Discret. Math. 36 (1) (2022)
Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev
Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. 36 (4) (2022)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS (2022)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. 35 (4) (2021)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
Maximal strongly connected cliques in directed graphs: Algorithms and bounds. Discret. Appl. Math. 303 (2021)
Alexey Barsukov, Mamadou Moustapha Kanté
Generalisations of Matrix Partitions : Complexity and Obstructions. CoRR (2021)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. 35 (3) (2021)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A linear fixed parameter tractable algorithm for connected pathwidth. CoRR (2020)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
-degenerate induced subgraphs of a chordal graph. Theor. Comput. Sci. 818 (2020)
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
Between clique-width and linear clique-width of bipartite graphs. Discret. Math. 343 (8) (2020)
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. ESA (2020)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree pivot-minors and linear rank-width. CoRR (2020)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica 82 (6) (2020)
Mamadou Moustapha Kanté, Thiago Braga Marcilon, Rudini M. Sampaio
On the parameterized complexity of the geodesic hull number. Theor. Comput. Sci. 791 (2019)
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS (2019)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. ESA (2019)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. 782 (2019)
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
-acyclic hypergraphs. J. Comput. Syst. Sci. 101 (2019)
Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA (2019)
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR (2018)
Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri
Enumerating Minimal Transversals of Hypergraphs without Small Holes. MFCS (2018)
Mamadou Moustapha Kanté, O-joung Kwon
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. Eur. J. Comb. 74 (2018)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. Algorithmica 80 (2) (2018)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing Small Pivot-Minors. WG (2018)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints. CoRR (2018)
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 79 (1) (2017)
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm. Algorithmica 78 (1) (2017)
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Fast exact algorithms for some connectivity problems parametrized by clique-width. CoRR (2017)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Minimal dominating sets in interval graphs and trees. Discret. Appl. Math. 216 (2017)
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph. COCOON (2017)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS (2017)
Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa
On Maximal Cliques with Connectivity Constraints in Directed Graphs. ISAAC (2017)
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR (2017)
Mamadou Moustapha Kanté, Takeaki Uno
Counting Minimal Dominating Sets. TAMC (2017)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger
Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199 (2016)
Mamadou Moustapha Kanté, Lhouari Nourine
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SIAM J. Discret. Math. 30 (1) (2016)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. CoRR (2015)
Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse
Finding Paths in Grids with Forbidden Transitions. WG (2015)
Isolde Adler, Mamadou Moustapha Kanté
Linear rank-width and linear clique-width of trees. Theor. Comput. Sci. 589 (2015)
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width. ISAAC (2015)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR (2015)
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é, Eun Jung Kim, O-joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC (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)
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. CoRR (2014)
Mamadou Moustapha Kanté, O-joung Kwon
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width. CoRR (2014)
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear Rank-Width of Distance-Hereditary Graphs. WG (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR (2014)
Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège
Trees in Graphs with Conflict Edges or Forbidden Transitions. TAMC (2013)
Isolde Adler, Mamadou Moustapha Kanté
Linear Rank-Width and Linear Clique-Width of Trees. WG (2013)
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)
Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy
A Note on Graphs of Linear Rank-Width 1. CoRR (2013)
Mamadou Moustapha Kanté, Lhouari Nourine
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SOFSEM (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é, Michaël Rao
The Rank-Width of Edge-Coloured Graphs. Theory Comput. Syst. 52 (4) (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)
Mamadou Moustapha Kanté
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs. Eur. J. Comb. 33 (8) (2012)
Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine
The Lattice of all Betweenness Relations: Structure and Properties. CLA (2012)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
Enumeration of Minimal Dominating Sets and Variants. FCT (2011)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21 (1) (2011)
Mamadou Moustapha Kanté
Well-Quasi-Ordering of Matrices under Schur Complement and Applications to Directed Graphs. CoRR (2011)
Mamadou Moustapha Kanté, Michaël Rao
\mathbb F-Rank-Width of (Edge-Colored) Graphs. CAI (2011)
Bruno Courcelle, Mamadou Moustapha Kanté
Graph operations characterizing rank-width. Discret. Appl. Math. 157 (4) (2009)
Mamadou Moustapha Kanté, Michaël Rao
Directed Rank-Width and Displit Decomposition. WG (2009)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Compact Labelings For Efficient First-Order Model-Checking CoRR (2008)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
Efficient First-Order Model-Checking Using Short Labels. FAW (2008)
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg
Connectivity check in 3-connected planar graphs with obstacles. Electron. Notes Discret. Math. 31 (2008)
Mamadou Moustapha Kanté
The rank-width of Directed Graphs CoRR (2007)
Mamadou Moustapha Kanté
Vertex-minor reductions can simulate edge contractions. Discret. Appl. Math. 155 (17) (2007)
Bruno Courcelle, Mamadou Moustapha Kanté
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. WG (2007)

Mamadou Moustapha Kanté.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mamadou Moustapha Kanté