Mamadou Moustapha Kanté

Orcid: 0000-0003-1838-7744

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints.
SIAM J. Discret. Math., March, 2024

Generalisations of matrix partitions: Complexity and obstructions.
Theor. Comput. Sci., 2024

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions.
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>.
J. Comb. Theory B, May, 2023

Computing pivot-minors.
CoRR, 2023

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Letter Graphs and Geometric Grid Classes of Permutations.
SIAM J. Discret. Math., December, 2022

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth.
SIAM J. Discret. Math., 2022

Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021
Tree Pivot-Minors and Linear Rank-Width.
SIAM J. Discret. Math., 2021

More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints.
SIAM J. Discret. Math., 2021

Maximal strongly connected cliques in directed graphs: Algorithms and bounds.
Discret. Appl. Math., 2021

2020
Efficient enumeration of maximal <i>k</i>-degenerate induced subgraphs of a chordal graph.
Theor. Comput. Sci., 2020

Between clique-width and linear clique-width of bipartite graphs.
Discret. Math., 2020

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

2019
On the parameterized complexity of the geodesic hull number.
Theor. Comput. Sci., 2019

Fast exact algorithms for some connectivity problems parameterized by clique-width.
Theor. Comput. Sci., 2019

Counting minimal transversals of <i>β</i>-acyclic hypergraphs.
J. Comput. Syst. Sci., 2019

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions.
Eur. J. Comb., 2018

Counting Minimal Transversals of β-Acyclic Hypergraphs.
CoRR, 2018

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

Computing Small Pivot-Minors.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Enumerating Minimal Transversals of Hypergraphs without Small Holes.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Minimal dominating sets in interval graphs and trees.
Discret. Appl. Math., 2017

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

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

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

Counting Minimal Dominating Sets.
Proceedings of the Theory and Applications of Models of Computation, 2017

On Maximal Cliques with Connectivity Constraints in Directed Graphs.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Minimal Dominating Set Enumeration.
Encyclopedia of Algorithms, 2016

Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs.
SIAM J. Discret. Math., 2016

Enumerating minimal dominating sets in chordal bipartite graphs.
Discret. Appl. Math., 2016

2015
Linear rank-width and linear clique-width of trees.
Theor. Comput. Sci., 2015

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

Finding Paths in Grids with Forbidden Transitions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014
On the Enumeration of Minimal Dominating Sets and Related Notions.
SIAM J. Discret. Math., 2014

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

Linear Rank-Width of Distance-Hereditary Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013
The Rank-Width of Edge-Coloured Graphs.
Theory Comput. Syst., 2013

A Note on Graphs of Linear Rank-Width 1.
CoRR, 2013

Trees in Graphs with Conflict Edges or Forbidden Transitions.
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.
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.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs.
Eur. J. Comb., 2012

On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

The Lattice of all Betweenness Relations: Structure and Properties.
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

2011
Compact labelings for efficient first-order model-checking.
J. Comb. Optim., 2011

Enumeration of Minimal Dominating Sets and Variants.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

\mathbb <i>F</i>\mathbb F-Rank-Width of (Edge-Colored) Graphs.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2009
Graph operations characterizing rank-width.
Discret. Appl. Math., 2009

Directed Rank-Width and Displit Decomposition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques).
PhD thesis, 2008

Connectivity check in 3-connected planar graphs with obstacles.
Electron. Notes Discret. Math., 2008

Efficient First-Order Model-Checking Using Short Labels.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007
Vertex-minor reductions can simulate edge contractions.
Discret. Appl. Math., 2007

The rank-width of Directed Graphs
CoRR, 2007

Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007


  Loading...