PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

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.

No persons found for author name Kanté, Mamadou Moustapha
add a person with the name Kanté, Mamadou Moustapha
 

Other publications of authors with the same name

Compact labelings for efficient first-order model-checking., , and . J. Comb. Optim., 21 (1): 19-46 (2011)Minimal Dominating Set Enumeration., and . Encyclopedia of Algorithms, (2016)Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs., and . SIAM J. Discrete Math., 30 (1): 311-326 (2016)Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions., and . Eur. J. Comb., (2018)Directed Rank-Width and Displit Decomposition., and . WG, volume 5911 of Lecture Notes in Computer Science, page 214-225. (2009)Linear Rank-Width and Linear Clique-Width of Trees., and . WG, volume 8165 of Lecture Notes in Computer Science, page 12-25. Springer, (2013)Finding Paths in Grids with Forbidden Transitions., , , and . WG, volume 9224 of Lecture Notes in Computer Science, page 154-168. Springer, (2015)FF-Rank-Width of (Edge-Colored) Graphs., and . CAI, volume 6742 of Lecture Notes in Computer Science, page 158-173. Springer, (2011)Trees in Graphs with Conflict Edges or Forbidden Transitions., , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 343-354. 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)