( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized complexity of three edge contraction problems with degree constraints.

, , , and . Acta Informatica, 51 (7): 473-497 (2014)

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.

Daniël Rossum

Daniël Wildt

Daniel

Daniel

Daniël Pieter Wierstra

 

Other publications of authors with the same name

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