( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Characterizing Graphs of Small Carving-Width.

, , , , и . COCOA, том 7402 из Lecture Notes in Computer Science, стр. 360-370. Springer, (2012)

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.

Daniël Rossum

Daniël Wildt

Daniel

Daniel

Daniël Pieter Wierstra

 

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

A complete complexity classification of the role assignment problem., и . Theor. Comput. Sci., 349 (1): 67-81 (2005)Model Counting for CNF Formulas of Bounded Modular Treewidth., , и . Algorithmica, 76 (1): 168-194 (2016)Induced Disjoint Paths in AT-free Graphs., , и . CoRR, (2020)Contracting to a Longest Path in H-Free Graphs., и . ISAAC, том 181 из LIPIcs, стр. 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Finding a Small Number of Colourful Components., , , , , и . CPM, том 128 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Graph Editing to a Fixed Target., , и . IWOCA, том 8288 из Lecture Notes in Computer Science, стр. 192-205. Springer, (2013)Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number., , , и . Discuss. Math. Graph Theory, 29 (1): 143-162 (2009)Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy., , , и . CoRR, (2018)Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms., , и . MFCS, том 3618 из Lecture Notes in Computer Science, стр. 340-351. Springer, (2005)Kempe Equivalence of Colourings of Cubic Graphs., , и . CoRR, (2015)