( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Model Counting for CNF Formulas of Bounded Modular Treewidth.

, , and . Algorithmica, 76 (1): 168-194 (2016)

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

Kempe Equivalence of Colourings of Cubic Graphs., , and . CoRR, (2015)Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy., , , and . CoRR, (2018)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)Knocking Out P k -free Graphs., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 396-407. Springer, (2014)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)Minimal Disconnected Cuts in Planar Graphs., , , and . FCT, volume 9210 of Lecture Notes in Computer Science, page 243-254. Springer, (2015)Surjective H-Colouring over Reflexive Digraphs., , and . CoRR, (2017)The Computational Complexity of the Role Assignment Problem., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 817-828. Springer, (2003)