( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Edge Contractions in Subclasses of Chordal Graphs.

, , и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 528-539. Springer, (2011)

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.

Rémy Gassilloud

Rémy Frenoy

Rémy Pottier

Rémy Choquet

Rémy Apfelbacher

 

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

Induced Minor Free Graphs: Isomorphism and Clique-width., , и . WG, том 9224 из Lecture Notes in Computer Science, стр. 299-311. Springer, (2015)Grundy Distinguishes Treewidth from Pathwidth., , , , и . ESA, том 173 из LIPIcs, стр. 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Odd Chromatic Number of Graph Classes., , , и . WG, том 14093 из Lecture Notes in Computer Science, стр. 44-58. Springer, (2023)Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints., , , и . IPEC, том 8246 из Lecture Notes in Computer Science, стр. 16-27. Springer, (2013)On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings., и . WG, том 12301 из Lecture Notes in Computer Science, стр. 67-79. Springer, (2020)Defective Coloring on Classes of Perfect Graphs., , и . WG, том 10520 из Lecture Notes in Computer Science, стр. 113-126. Springer, (2017)Token Sliding on Split Graphs., , , , , и . STACS, том 126 из LIPIcs, стр. 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Parameterized (Approximate) Defective Coloring., , и . STACS, том 96 из LIPIcs, стр. 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)New Results on Directed Edge Dominating Set., , , , и . Discret. Math. Theor. Comput. Sci., (2023)Parameterized Complexity of (A, ℓ )-Path Packing., , , , , , , , и . IWOCA, том 12126 из Lecture Notes in Computer Science, стр. 43-55. Springer, (2020)