( en | de | ru )

 

Disambiguation of "Kanté, Mamadou Moustapha"

Author of the publication

copydeleteadd this publication to your clipboard
On the Enumeration of Minimal Dominating Sets and Related Notions.

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

Linear Rank-Width of Distance-Hereditary Graphs., , and . WG, volume 8747 of Lecture Notes in Computer Science, page 42-55. Springer, (2014)Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs., , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 446-457. Springer, (2015)Computing Small Pivot-Minors., , , , , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 125-138. Springer, (2018)An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion., , , and . Algorithmica, 79 (1): 66-95 (2017)On the Enumeration of Minimal Dominating Sets and Related Notions., , , and . CoRR, (2014)Well-quasi-ordering of matrices under Schur complement and applications to directed graphs.. Eur. J. Comb., 33 (8): 1820-1841 (2012)Vertex-minor reductions can simulate edge contractions.. Discret. Appl. Math., 155 (17): 2328-2340 (2007)Enumerating Minimal Transversals of Hypergraphs without Small Holes., , and . MFCS, volume 117 of LIPIcs, page 55:1-55:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Computing pivot-minors., , , , , , and . CoRR, (2023)Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques).. University of Bordeaux, France, (2008)