( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Colouring Square-Free Graphs without Long Induced Paths.

, , and . STACS, volume 96 of LIPIcs, page 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Bounding Clique-Width via Perfect Graphs., , and . CoRR, (2014)Colouring on Hereditary Graph Classes Closed under Complementation., , , and . CoRR, (2016)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)Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)., , and . SAT, volume 6695 of Lecture Notes in Computer Science, page 47-60. 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)List Coloring in the Absence of a Linear Forest., , , and . WG, volume 6986 of Lecture Notes in Computer Science, page 119-130. Springer, (2011)Connected Vertex Cover for (sP1+P5)-Free Graphs., , and . Algorithmica, 82 (1): 20-40 (2020)A Reconfigurations Analogue of Brooks' Theorem., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 287-298. Springer, (2014)Upper Bounds and Algorithms for Parallel Knock-Out Numbers., , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs., , , , and . J. Comb. Optim., 27 (1): 132-143 (2014)