( en | de | ru )

 

Disambiguation of "Kanté, Mamadou Moustapha"

Author of the publication

copydeleteadd this publication to your clipboard
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm.

, , and . CoRR, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kébé Kanté

Moustapha Bikienga

Henning Kante

Moustapha Haikal

Heinz Kante

 

Other publications of authors with the same name

Minimal Dominating Set Enumeration., and . Encyclopedia of Algorithms, (2016)Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions., and . Eur. J. Comb., (2018)Trees in Graphs with Conflict Edges or Forbidden Transitions., , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 343-354. Springer, (2013)Linear Rank-Width and Linear Clique-Width of Trees., and . WG, volume 8165 of Lecture Notes in Computer Science, page 12-25. Springer, (2013)Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques).. University of Bordeaux, France, (2008)Compact labelings for efficient first-order model-checking., , and . J. Comb. Optim., 21 (1): 19-46 (2011)Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs., and . SIAM J. Discret. Math., 30 (1): 311-326 (2016)Computing pivot-minors., , , , , , and . CoRR, (2023)Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth., , , , , , , and . ESA, volume 274 of LIPIcs, page 18:1-18:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions., , and . SOFSEM, volume 7741 of Lecture Notes in Computer Science, page 257-267. Springer, (2013)