( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
Independent Feedback Vertex Set for P_5-free Graphs.

, , , , and . ISAAC, volume 92 of LIPIcs, page 16:1-16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Colouring on Hereditary Graph Classes Closed under Complementation., , , and . CoRR, (2016)Bounding Clique-Width via Perfect Graphs., , and . CoRR, (2014)Independent feedback vertex sets for graphs of bounded diameter., , , , and . Inf. Process. Lett., (2018)Finding Cactus Roots in Polynomial Time., , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 361-372. Springer, (2016)Critical vertices and edges in H-free graphs., , and . Discret. Appl. Math., (2019)Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2., , , , and . Algorithmica, 81 (7): 2795-2828 (2019)A Reconfigurations Analogue of Brooks' Theorem., , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 287-298. Springer, (2014)Upper Bounds and Algorithms for Parallel Knock-Out Numbers., , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 328-340. Springer, (2007)Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs., , , , and . J. Comb. Optim., 27 (1): 132-143 (2014)Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes., , and . WG, volume 10520 of Lecture Notes in Computer Science, page 220-233. Springer, (2017)