( en | de | ru )

 

Disambiguation of "Kanté, Mamadou Moustapha"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs.

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

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)Computing pivot-minors., , , , , , and . CoRR, (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)On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 289-298. Springer, (2012)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)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)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)