( en | de | ru )

 

Disambiguation of "Paulusma, Daniël"

Author of the publication

copydeleteadd this publication to your clipboard
On graph contractions and induced minors.

, , , , and . Discret. Appl. Math., 160 (6): 799-809 (2012)

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

Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity., , , , and . CoRR, (2017)Contracting planar graphs to contractions of triangulations, , and . CoRR, (2010)Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy., , , and . CoRR, (2018)The Computational Complexity of the Role Assignment Problem., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 817-828. Springer, (2003)Induced Packing of Odd Cycles in a Planar Graph., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 514-523. Springer, (2009)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)Finding a Small Number of Colourful Components., , , , , and . CPM, volume 128 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Graph Editing to a Fixed Target., , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 192-205. Springer, (2013)Cycles through specified vertices in triangle-free graphs., and . Discuss. Math. Graph Theory, 27 (1): 179-191 (2007)