( en | de | ru )

 

Disambiguation of "Kanté, Mamadou Moustapha"

Author of the publication

copydeleteadd this publication to your clipboard
A Note on Graphs of Linear Rank-Width 1.

, , and . CoRR, (2013)

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

An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width., and . CoRR, (2014)Counting Minimal Dominating Sets., and . TAMC, volume 10185 of Lecture Notes in Computer Science, page 333-347. (2017)Efficient First-Order Model-Checking Using Short Labels., , and . FAW, volume 5059 of Lecture Notes in Computer Science, page 159-170. Springer, (2008)Graph Operations Characterizing Rank-Width and Balanced Graph Expressions., and . WG, volume 4769 of Lecture Notes in Computer Science, page 66-75. Springer, (2007)Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm., , and . Algorithmica, 78 (1): 342-377 (2017)An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion., , , and . IPEC, volume 43 of LIPIcs, page 138-150. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Maximal strongly connected cliques in directed graphs: Algorithms and bounds., , , and . Discret. Appl. Math., (2021)A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth., , and . SIAM J. Discret. Math., 36 (1): 411-435 (2022)Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs., , , , and . CoRR, (2014)Minimal Dominating Set Enumeration., and . Encyclopedia of Algorithms, (2016)