Mamadou Moustapha Kanté

From MaRDI portal
Person:344850

Available identifiers

zbMath Open kante.mamadou-moustaphaMaRDI QIDQ344850

List of research outcomes

PublicationDate of PublicationType
Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)2023-03-23Paper
https://portal.mardi4nfdi.de/entity/Q58745362023-02-07Paper
Letter Graphs and Geometric Grid Classes of Permutations2022-11-15Paper
https://portal.mardi4nfdi.de/entity/Q50924362022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50757522022-05-11Paper
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth2022-03-15Paper
Tree Pivot-Minors and Linear Rank-Width2022-01-07Paper
Maximal strongly connected cliques in directed graphs: algorithms and bounds2021-09-15Paper
More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints2021-08-20Paper
https://portal.mardi4nfdi.de/entity/Q50051572021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q51362402020-11-25Paper
Between clique-width and linear clique-width of bipartite graphs2020-06-08Paper
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width2020-04-14Paper
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph2020-04-07Paper
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs2020-02-25Paper
On the parameterized complexity of the geodesic hull number2019-09-10Paper
Fast exact algorithms for some connectivity problems parameterized by clique-width2019-06-06Paper
Counting minimal transversals of \(\beta\)-acyclic hypergraphs2019-01-25Paper
Computing small pivot-minors2018-11-22Paper
Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions2018-09-07Paper
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width2018-04-06Paper
Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph2017-10-23Paper
An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion2017-10-10Paper
https://portal.mardi4nfdi.de/entity/Q53637672017-09-29Paper
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width2017-09-22Paper
On the geodetic rank of a graph2017-07-25Paper
Counting Minimal Dominating Sets2017-05-19Paper
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm2017-05-11Paper
Minimal dominating sets in interval graphs and trees2016-11-24Paper
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs2016-10-21Paper
Finding Paths in Grids with Forbidden Transitions2016-10-21Paper
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs2016-03-04Paper
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width2016-01-11Paper
Enumerating minimal dominating sets in chordal bipartite graphs2015-12-10Paper
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs2015-10-30Paper
Linear Rank-Width of Distance-Hereditary Graphs2015-09-09Paper
Linear rank-width and linear clique-width of trees2015-06-01Paper
On the Enumeration of Minimal Dominating Sets and Related Notions2015-04-17Paper
An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions2014-11-04Paper
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs2014-11-04Paper
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs2014-01-14Paper
Linear Rank-Width and Linear Clique-Width of Trees2013-12-06Paper
The rank-width of edge-coloured graphs2013-08-01Paper
Connectivity check in 3-connected planar graphs with obstacles2013-06-28Paper
Trees in Graphs with Conflict Edges or Forbidden Transitions2013-05-28Paper
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets2013-03-21Paper
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs2012-09-12Paper
Enumeration of Minimal Dominating Sets and Variants2011-08-19Paper
$\mathbb F$ -Rank-Width of (Edge-Colored) Graphs2011-07-08Paper
Compact labelings for efficient first-order model-checking2011-02-18Paper
Directed Rank-Width and Displit Decomposition2010-01-21Paper
Graph operations characterizing rank-width2009-06-30Paper
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions2008-07-01Paper
Efficient First-Order Model-Checking Using Short Labels2008-06-19Paper
Vertex-minor reductions can simulate edge contractions2007-10-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mamadou Moustapha Kanté