( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Acyclic, Star, and Injective Colouring: Bounding the Diameter.

, , , , , and . Electron. J. Comb., (2022)

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

Colouring on Hereditary Graph Classes Closed under Complementation., , , and . CoRR, (2016)Bounding Clique-Width via Perfect Graphs., , and . CoRR, (2014)On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal., , , , and . CoRR, (2019)Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)., , and . SAT, volume 6695 of Lecture Notes in Computer Science, page 47-60. Springer, (2011)Parameterizing Cut Sets in a Graph by the Number of Their Components., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 605-615. Springer, (2009)List Coloring in the Absence of a Linear Forest., , , and . WG, volume 6986 of Lecture Notes in Computer Science, page 119-130. Springer, (2011)Graph Labelings Derived from Models in Distributed Computing., and . WG, volume 4271 of Lecture Notes in Computer Science, page 301-312. Springer, (2006)Connected Vertex Cover for (sP1+P5)-Free Graphs., , and . Algorithmica, 82 (1): 20-40 (2020)Finding Cactus Roots in Polynomial Time., , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 361-372. Springer, (2016)Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes., , and . WG, volume 10520 of Lecture Notes in Computer Science, page 220-233. Springer, (2017)