( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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

Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number., , , and . Discuss. Math. Graph Theory, 29 (1): 143-162 (2009)Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs., , and . SIAM J. Discret. Math., 36 (4): 2453-2472 (2022)A complete complexity classification of the role assignment problem., and . Theor. Comput. Sci., 349 (1): 67-81 (2005)Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter., , and . Theor. Comput. Sci., (2022)Kempe equivalence of colourings of cubic graphs., , and . Eur. J. Comb., (2017)Lift-contractions., , , and . Eur. J. Comb., (2014)Parameterizing cut sets in a graph by the number of their components., , , and . Theor. Comput. Sci., 412 (45): 6340-6350 (2011)On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest., , , , , and . Algorithmica, 82 (10): 2841-2866 (2020)Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy., , , , , and . Algorithmica, 83 (3): 822-852 (2021)Model Counting for CNF Formulas of Bounded Modular Treewidth., , and . Algorithmica, 76 (1): 168-194 (2016)