( en | de | ru )

 

Disambiguation of "Kanté, Mamadou Moustapha"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.

, , , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 150-161. Springer, (2017)

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 and Linear Clique-Width of Trees., and . WG, volume 8165 of Lecture Notes in Computer Science, page 12-25. Springer, (2013)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)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)Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques).. University of Bordeaux, France, (2008)Minimal Dominating Set Enumeration., and . Encyclopedia of Algorithms, (2016)Compact labelings for efficient first-order model-checking., , and . J. Comb. Optim., 21 (1): 19-46 (2011)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)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)