( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time.

, , , , , and . Algorithmica, 69 (3): 501-521 (2014)

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)Induced Packing of Odd Cycles in a Planar Graph., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 514-523. Springer, (2009)The Computational Complexity of the Role Assignment Problem., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 817-828. Springer, (2003)Classifying Subset Feedback Vertex Set for H-Free Graphs., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 412-424. Springer, (2022)On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest., , , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 258-273. Springer, (2019)Computing Subset Vertex Covers in H-Free Graphs., , , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 88-102. Springer, (2023)Disjoint Paths and Connected Subgraphs for H-Free Graphs., , , , and . IWOCA, volume 12757 of Lecture Notes in Computer Science, page 414-427. Springer, (2021)Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars., , , and . SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, page 188-199. Springer, (2007)Contracting to a Longest Path in H-Free Graphs., and . ISAAC, volume 181 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)