( en | de | ru )

 

Disambiguation of "van 't Hof, Pim"

Author of the publication

copydeleteadd this publication to your clipboard
Finding Disjoint Paths in Split Graphs.

, , , and . Theory Comput. Syst., 57 (1): 140-159 (2015)

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.

Pim Blomaard

Pim Schravendijk

Gordon Van 't Slot

Dominik Pimmer

Patricia Pimpl

 

Other publications of authors with the same name

On graph contractions and induced minors., , , , and . Discret. Appl. Math., 160 (6): 799-809 (2012)Finding Disjoint Paths in Split Graphs., , , and . Theory Comput. Syst., 57 (1): 140-159 (2015)Maximal induced matchings in triangle-free graphs., , , , and . CoRR, (2013)Vector Connectivity in Graphs., , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 331-342. Springer, (2013)On the Computational Complexity of Vertex Integrity and Component Order Connectivity., , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 285-297. Springer, (2014)Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints., , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 16-27. Springer, (2013)Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time., , , and . WG, volume 6410 of Lecture Notes in Computer Science, page 75-87. (2010)On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties., , , , and . WG, volume 7551 of Lecture Notes in Computer Science, page 332-343. Springer, (2012)Detecting Fixed Patterns in Chordal Graphs in Polynomial Time., , , , , and . Algorithmica, 69 (3): 501-521 (2014)Parameterized complexity of three edge contraction problems with degree constraints., , , and . Acta Informatica, 51 (7): 473-497 (2014)