( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Graph Structurings: Some Algorithmic Applications. (Structurations de Graphes: Quelques Applications Algorithmiques).

. University of Bordeaux, France, (2008)

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.

Kébé Kanté

Moustapha Bikienga

Henning Kante

Moustapha Haikal

Heinz Kante

 

Другие публикации лиц с тем же именем

Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions., и . Eur. J. Comb., (2018)Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs., и . 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)Computing pivot-minors., , , , , , и . CoRR, (2023)Trees in Graphs with Conflict Edges or Forbidden Transitions., , и . TAMC, том 7876 из Lecture Notes in Computer Science, стр. 343-354. Springer, (2013)Linear Rank-Width and Linear Clique-Width of Trees., и . WG, том 8165 из Lecture Notes in Computer Science, стр. 12-25. Springer, (2013)Compact labelings for efficient first-order model-checking., , и . J. Comb. Optim., 21 (1): 19-46 (2011)Minimal Dominating Set Enumeration., и . Encyclopedia of Algorithms, (2016)Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth., , , , , , , и . ESA, том 274 из LIPIcs, стр. 18:1-18:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions., , и . SOFSEM, том 7741 из Lecture Notes in Computer Science, стр. 257-267. Springer, (2013)