DaniÃ«l Paulusma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2010

The k-in-a-path Problem for Claw-free GraphsJirÃ Fiala, Marcin Kaminski, Bernard LidickÃ½, DaniÃ«l Paulusma. STACS 2010: 371-382 [doi]

On Contracting Graphs to Fixed Pattern GraphsPim van t Hof, Marcin Kaminski, DaniÃ«l Paulusma, Stefan Szeider, Dimitrios M. Thilikos. sofsem 2010: 503-514 [doi]

2009

Three Complexity Results on Coloring ::::P::::::::::k::::::-Free GraphsHajo Broersma, Fedor V. Fomin, Petr A. Golovach, DaniÃ«l Paulusma. iwoca 2009: 95-104 [doi]

Fast Exact Algorithms for Hamiltonicity in Claw-Free GraphsHajo Broersma, Fedor V. Fomin, Pim van t Hof, DaniÃ«l Paulusma. wg 2010: 44-53 [doi]

Induced Packing of Odd Cycles in a Planar GraphPetr A. Golovach, Marcin Kaminski, DaniÃ«l Paulusma, Dimitrios M. Thilikos. isaac 2009: 514-523 [doi]

Parameterizing Cut Sets in a Graph by the Number of Their ComponentsTakehiro Ito, Marcin Kaminski, DaniÃ«l Paulusma, Dimitrios M. Thilikos. isaac 2009: 605-615 [doi]

On the Core and ::::f::::-Nucleolus of Flow GamesWalter Kern, DaniÃ«l Paulusma. mor, 34(4):981-991, 2009. [doi]

On Partitioning a Graph into Two Connected SubgraphsDaniÃ«l Paulusma, Johan M. M. van Rooij. isaac 2009: 1215-1224 [doi]

Computing Role Assignments of Chordal GraphsPim van t Hof, DaniÃ«l Paulusma, Johan M. M. van Rooij. fct 2009: 193-204 [doi]

Finding Induced Paths of Given Parity in Claw-Free GraphsPim van t Hof, Marcin Kaminski, DaniÃ«l Paulusma. wg 2010: 341-352 [doi]

Partitioning graphs into connected partsPim van t Hof, DaniÃ«l Paulusma, Gerhard J. Woeginger. TCS, 410(47-49):4834-4843, 2009. [doi]

Partitioning Graphs into Connected PartsPim van t Hof, DaniÃ«l Paulusma, Gerhard J. Woeginger. csr 2009: 143-154 [doi]

Sign in or sign up to see more results.

runs on WebDSL