( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithmic aspects of switch cographs.

, , и . Discret. Appl. Math., (2016)

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.

Fabien Guilmineau

Fabien Abeille

Fabien Amarger

Fabien Gandon

Fabien Leurent

 

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

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs., , , и . Theor. Comput. Sci., (2022)A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs, , и . CoRR, (2009)Computing H-Joins with Application to 2-Modular Decomposition., , и . Algorithmica, 70 (2): 245-266 (2014)Easy Identification of Generalized Common and Conserved Nested Intervals., , и . J. Comput. Biol., 21 (7): 520-533 (2014)Algebraic Operations on PQ Trees and Modular Decomposition Trees., и . WG, том 3787 из Lecture Notes in Computer Science, стр. 421-432. Springer, (2005)Algorithms for Some H-Join Decompositions., , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 446-457. Springer, (2012)A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension., , и . SWAT, том 3111 из Lecture Notes in Computer Science, стр. 187-198. Springer, (2004)Algorithmic aspects of switch cographs., , и . Discret. Appl. Math., (2016)Decomposing a graph into shortest paths with bounded eccentricity., , , и . Discret. Appl. Math., (2020)Graph Decompositions andFactorizing Permutations., , и . Discret. Math. Theor. Comput. Sci., 5 (1): 55-70 (2002)