Mamadou Moustapha Kanté

According to our database, Mamadou Moustapha Kanté authored at least 62 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions.

Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev

CoRR, 2024

2023

Obstructions for matroids of path-width at most <i>k</i> and graphs of linear rank-width at most <i>k</i>.

Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum

J. Comb. Theory, Ser. B, May, 2023

Computing pivot-minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

CoRR, 2023

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.

Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Letter Graphs and Geometric Grid Classes of Permutations.

Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev

SIAM J. Discret. Math., December, 2022

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth.

Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos

SIAM J. Discret. Math., 2022

Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k.

Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Tree Pivot-Minors and Linear Rank-Width.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

SIAM J. Discret. Math., 2021

More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

SIAM J. Discret. Math., 2021

Maximal strongly connected cliques in directed graphs: Algorithms and bounds.

Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa

Discret. Appl. Math., 2021

Generalisations of Matrix Partitions : Complexity and Obstructions.

Alexey Barsukov, Mamadou Moustapha Kanté

CoRR, 2021

2020

Efficient enumeration of maximal <i>k</i>-degenerate induced subgraphs of a chordal graph.

Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa

Theor. Comput. Sci., 2020

Between clique-width and linear clique-width of bipartite graphs.

Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev

Discret. Math., 2020

An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.

Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon

Algorithmica, 2020

2019

On the parameterized complexity of the geodesic hull number.

Mamadou Moustapha Kanté, Thiago Braga Marcilon, Rudini M. Sampaio

Theor. Comput. Sci., 2019

Fast exact algorithms for some connectivity problems parameterized by clique-width.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

Theor. Comput. Sci., 2019

Counting minimal transversals of <i>β</i>-acyclic hypergraphs.

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté

J. Comput. Syst. Sci., 2019

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, Kunihiro Wasa

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.

Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions.

Mamadou Moustapha Kanté, O-joung Kwon

Eur. J. Comb., 2018

Counting Minimal Transversals of β-Acyclic Hypergraphs.

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté

CoRR, 2018

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger

Algorithmica, 2018

Computing Small Pivot-Minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Enumerating Minimal Transversals of Hypergraphs without Small Holes.

Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Minimal dominating sets in interval graphs and trees.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger

Discret. Appl. Math., 2017

Fast exact algorithms for some connectivity problems parametrized by clique-width.

Benjamin Bergougnoux, Mamadou Moustapha Kanté

CoRR, 2017

An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion.

Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul

Algorithmica, 2017

Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm.

Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon

Algorithmica, 2017

Counting Minimal Dominating Sets.

Mamadou Moustapha Kanté, Takeaki Uno

Proceedings of the Theory and Applications of Models of Computation, 2017

On Maximal Cliques with Connectivity Constraints in Directed Graphs.

Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.

Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Minimal Dominating Set Enumeration.

Mamadou Moustapha Kanté, Lhouari Nourine

Encyclopedia of Algorithms, 2016

Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs.

Mamadou Moustapha Kanté, Lhouari Nourine

SIAM J. Discret. Math., 2016

Enumerating minimal dominating sets in chordal bipartite graphs.

Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger

Discret. Appl. Math., 2016

2015

Linear rank-width and linear clique-width of trees.

Isolde Adler, Mamadou Moustapha Kanté

Theor. Comput. Sci., 2015

FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion.

Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul

CoRR, 2015

Finding Paths in Grids with Forbidden Transitions.

Mamadou Moustapha Kanté, Fatima Zahra Moataz, Benjamin Momège, Nicolas Nisse

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

On the Enumeration of Minimal Dominating Sets and Related Notions.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine

SIAM J. Discret. Math., 2014

An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width.

Mamadou Moustapha Kanté, O-joung Kwon

CoRR, 2014

Linear Rank-Width of Distance-Hereditary Graphs.

Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

The Rank-Width of Edge-Coloured Graphs.

Mamadou Moustapha Kanté, Michaël Rao

Theory Comput. Syst., 2013

A Note on Graphs of Linear Rank-Width 1.

Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy

CoRR, 2013

Trees in Graphs with Conflict Edges or Forbidden Transitions.

Mamadou Moustapha Kanté, Christian Laforest, Benjamin Momège

Proceedings of the Theory and Applications of Models of Computation, 2013

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

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

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

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Well-quasi-ordering of matrices under Schur complement and applications to directed graphs.

Mamadou Moustapha Kanté

Eur. J. Comb., 2012

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

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

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

2011

Compact labelings for efficient first-order model-checking.

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté

J. Comb. Optim., 2011

Enumeration of Minimal Dominating Sets and Variants.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

\mathbb <i>F</i>\mathbb F-Rank-Width of (Edge-Colored) Graphs.

Mamadou Moustapha Kanté, Michaël Rao

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2009

Graph operations characterizing rank-width.

Bruno Courcelle, Mamadou Moustapha Kanté

Discret. Appl. Math., 2009

Directed Rank-Width and Displit Decomposition.

Mamadou Moustapha Kanté, Michaël Rao

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008

Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques).

Mamadou Moustapha Kanté

PhD thesis, 2008

Connectivity check in 3-connected planar graphs with obstacles.

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg

Electron. Notes Discret. Math., 2008

Efficient First-Order Model-Checking Using Short Labels.

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

Vertex-minor reductions can simulate edge contractions.

Mamadou Moustapha Kanté

Discret. Appl. Math., 2007

The rank-width of Directed Graphs

Mamadou Moustapha Kanté

CoRR, 2007

Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.

Bruno Courcelle, Mamadou Moustapha Kanté

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007