( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)

, , and . CoRR, (2011)

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

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)., , and . SAT, volume 6695 of Lecture Notes in Computer Science, page 47-60. Springer, (2011)Connected Vertex Cover for (sP1+P5)-Free Graphs., , and . Algorithmica, 82 (1): 20-40 (2020)Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2., , , , and . Algorithmica, 81 (7): 2795-2828 (2019)Critical vertices and edges in H-free graphs., , and . Discret. Appl. Math., (2019)Independent feedback vertex sets for graphs of bounded diameter., , , , and . Inf. Process. Lett., (2018)A Reconfigurations Analogue of Brooks' Theorem and Its Consequences., , and . J. Graph Theory, 83 (4): 340-358 (2016)Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs., , and . Comput. J., 58 (11): 3074-3088 (2015)Surjective H-colouring: New hardness results., , , , and . Comput., 8 (1): 27-42 (2019)Upper Bounds and Algorithms for Parallel Knock-Out Numbers., , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)A Reconfigurations Analogue of Brooks' Theorem., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 287-298. Springer, (2014)