Mamadou Moustapha Kanté

发表

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

Christophe Paul, Mamadou Moustapha Kanté, Eun Jung Kim, 2015, ArXiv.

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

Petr A. Golovach, Dieter Kratsch, Pinar Heggernes, 2017, Algorithmica.

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions

Christian Laforest, Mamadou Moustapha Kanté, Benjamin Momège, 2013, SOFSEM.

Computing Small Pivot-Minors

Daniël Paulusma, Mamadou Moustapha Kanté, O-joung Kwon, 2018, WG.

A Meta-Algorithm for Solving Connectivity and Acyclicity Constraints on Locally Checkable Properties Parameterized by Graph Width Measures pdf

Mamadou Moustapha Kanté, Benjamin Bergougnoux, M. Kanté, 2019 .

On Maximal Cliques with Connectivity Constraints in Directed Graphs

Takeaki Uno, Kunihiro Wasa, Alessio Conte, 2017, ISAAC.

Counting Minimal Dominating Sets

Takeaki Uno, Mamadou Moustapha Kanté, 2017, TAMC.

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

Mamadou Moustapha Kanté, O-joung Kwon, M. Kanté, 2015, Eur. J. Comb..

Compact labelings for efficient first-order model-checking

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, 2011, J. Comb. Optim..

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

Mamadou Moustapha Kanté, O-joung Kwon, Benjamin Bergougnoux, 2019, Algorithmica.

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

Christophe Paul, Mamadou Moustapha Kanté, Eun Jung Kim, 2015, IPEC.

Directed Rank-Width and Displit Decomposition

Mamadou Moustapha Kanté, Michaël Rao, 2009, WG.

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

Mamadou Moustapha Kanté, O-joung Kwon, Isolde Adler, 2014, Algorithmica.

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs

Roberto Grossi, Takeaki Uno, Kunihiro Wasa, 2019, MFCS.

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

Vadim V. Lozin, Mamadou Moustapha Kanté, Viktor Zamaraev, 2020, Discret. Math..

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs

Takeaki Uno, Lhouari Nourine, Mamadou Moustapha Kanté, 2013, ISAAC.

Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph

Yota Otachi, Takeaki Uno, Kunihiro Wasa, 2020, Theor. Comput. Sci..

On the parameterized complexity of the geodesic hull number

Thiago Braga Marcilon, Rudini Menezes Sampaio, Mamadou Moustapha Kanté, 2019, Theor. Comput. Sci..

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

Mamadou Moustapha Kanté, 2008 .

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

Lhouari Nourine, Mamadou Moustapha Kanté, 2016, SIAM J. Discret. Math..

Linear Rank-Width of Distance-Hereditary Graphs

Mamadou Moustapha Kanté, O-joung Kwon, Isolde Adler, 2014, WG.

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

Takeaki Uno, Alessio Conte, Andrea Marino, 2019, IWOCA.

The Lattice of all Betweenness Relations: Structure and Properties

Lhouari Nourine, Mamadou Moustapha Kanté, Laurent Beaudou, 2012, CLA.

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

Petr A. Golovach, Dieter Kratsch, Pinar Heggernes, 2015, ISAAC.

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

Lhouari Nourine, Mamadou Moustapha Kanté, M. Kanté, 2013, SIAM J. Discret. Math..

Enumerating Minimal Transversals of Hypergraphs without Small Holes

Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, 2018, MFCS.

Vertex-minor reductions can simulate edge contractions

Mamadou Moustapha Kanté, M. Kanté, 2007, Discret. Appl. Math..

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

Takeaki Uno, Lhouari Nourine, Mamadou Moustapha Kanté, 2015, WG.

Minimal Dominating Set Enumeration

Lhouari Nourine, Mamadou Moustapha Kanté, 2016, Encyclopedia of Algorithms.

Linear rank-width and linear clique-width of trees

Mamadou Moustapha Kanté, Isolde Adler, 2015, Theor. Comput. Sci..

Finding Paths in Grids with Forbidden Transitions

Nicolas Nisse, Mamadou Moustapha Kanté, Fatima Zahra Moataz, 2015, WG.

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

Mamadou Moustapha Kanté, O-joung Kwon, M. Kanté, 2014, ArXiv.

Tree pivot-minors and linear rank-width pdf

Daniël Paulusma, Mamadou Moustapha Kanté, O-joung Kwon, 2019, SIAM J. Discret. Math..

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

Mamadou Moustapha Kanté, Benjamin Bergougnoux, 2019, Theor. Comput. Sci..

On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets

Lhouari Nourine, Mamadou Moustapha Kanté, Arnaud Mary, 2012, ISAAC.

The rank-width of Directed Graphs pdf

Mamadou Moustapha Kanté, 2007, ArXiv.

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

Mamadou Moustapha Kanté, Benjamin Bergougnoux, M. Kanté, 2019, ESA.

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

Mamadou Moustapha Kanté, O-joung Kwon, Benjamin Bergougnoux, 2017, Algorithmica.

Graph operations characterizing rank-width

Bruno Courcelle, Mamadou Moustapha Kanté, B. Courcelle, 2009, Discret. Appl. Math..

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

Christophe Paul, Mamadou Moustapha Kanté, Eun Jung Kim, 2015, Algorithmica.

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

Mamadou Moustapha Kanté, M. Kanté, 2011, Eur. J. Comb..

Minimal dominating sets in interval graphs and trees

Petr A. Golovach, Dieter Kratsch, Pinar Heggernes, 2017, Discret. Appl. Math..

The Rank-Width of Edge-Coloured Graphs

Mamadou Moustapha Kanté, Michaël Rao, M. Kanté, 2007, Theory of Computing Systems.

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs

Takeaki Uno, Lhouari Nourine, Mamadou Moustapha Kanté, 2014, WADS.

Enumerating minimal dominating sets in chordal bipartite graphs

Petr A. Golovach, Dieter Kratsch, Pinar Heggernes, 2016, Discret. Appl. Math..

On the Enumeration of Minimal Dominating Sets and Related Notions

Lhouari Nourine, Mamadou Moustapha Kanté, Arnaud Mary, 2014, SIAM J. Discret. Math..

Graph Operations Characterizing Rank-Width and Balanced Graph Expressions

Bruno Courcelle, Mamadou Moustapha Kanté, B. Courcelle, 2007, WG.

Connectivity check in 3-connected planar graphs with obstacles

Bruno Courcelle, Cyril Gavoille, Andrew Twigg, 2008, Electron. Notes Discret. Math..

Counting Minimal Transversals of β-Acyclic Hypergraphs pdf

Mamadou Moustapha Kanté, Benjamin Bergougnoux, Florent Capelli, 2019, J. Comput. Syst. Sci..

More applications of the d-neighbor equivalence: acyclicity and connectivity constraints

Mamadou Moustapha Kanté, Benjamin Bergougnoux, M. Kanté, 2018, SIAM J. Discret. Math..

\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs

Mamadou Moustapha Kanté, Michaël Rao, M. Kanté, 2011, CAI.

Trees in Graphs with Conflict Edges or Forbidden Transitions

Christian Laforest, Mamadou Moustapha Kanté, Benjamin Momège, 2013, TAMC.

Enumeration of Minimal Dominating Sets and Variants

Lhouari Nourine, Mamadou Moustapha Kanté, Arnaud Mary, 2011, FCT.

A Note on Graphs of Linear Rank-Width 1 pdf

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

Linear Rank-Width and Linear Clique-Width of Trees

Mamadou Moustapha Kanté, Isolde Adler, 2013, WG.

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

Yota Otachi, Takeaki Uno, Kunihiro Wasa, 2017, COCOON.

Efficient First-Order Model-Checking Using Short Labels

Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, 2008, FAW.

Maximal strongly connected cliques in directed graphs: Algorithms and bounds

Takeaki Uno, Kunihiro Wasa, Alessio Conte, 2020, Discret. Appl. Math..

On the geodetic rank of a graph

Jayme L. Szwarcfiter, Rudini Menezes Sampaio, Mamadou Moustapha Kanté, 2017 .

F-rank-width of (edge-colored) graphs

Mamadou Moustapha Kanté, M. Kanté, M. Rao, 2011, CAI 2011.