( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.

, , and . WG, volume 8747 of Lecture Notes in Computer Science, page 225-237. Springer, (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

Surjective H-Colouring over Reflexive Digraphs., , and . CoRR, (2017)Minimal Disconnected Cuts in Planar Graphs., , , and . FCT, volume 9210 of Lecture Notes in Computer Science, page 243-254. Springer, (2015)Graph Editing to a Fixed Target., , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 192-205. Springer, (2013)Induced Disjoint Paths in AT-free Graphs., , and . CoRR, (2020)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)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)