( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.

, , , , and . Algorithmica, 81 (7): 2795-2828 (2019)

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)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)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)On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal., , , , and . CoRR, (2019)Using contracted solution graphs for solving reconfiguration problems., and . Acta Inf., 56 (7-8): 619-648 (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)Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs., , and . Comput. J., 58 (11): 3074-3088 (2015)A Reconfigurations Analogue of Brooks' Theorem and Its Consequences., , and . J. Graph Theory, 83 (4): 340-358 (2016)