( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
L(2, 1, 1)-Labeling Is NP-Complete for Trees.

, , and . TAMC, volume 6108 of Lecture Notes in Computer Science, page 211-221. Springer, (2010)

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

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)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)Graph Editing to a Fixed Target., , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 192-205. Springer, (2013)Kempe Equivalence of Colourings of Cubic Graphs., , and . CoRR, (2015)Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy., , , and . CoRR, (2018)Induced Packing of Odd Cycles in a Planar Graph., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 514-523. Springer, (2009)The Computational Complexity of the Role Assignment Problem., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 817-828. Springer, (2003)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)