The following publications are possibly variants of this publication:
- Induced Disjoint Paths in AT-free graphsPetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. jcss, 124:170-191, 2022. [doi]
- Induced Disjoint Paths in AT-Free GraphsPetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. swat 2012: 153-164 [doi]
- Induced Disjoint Paths and Connected Subgraphs for H-Free GraphsBarnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. wg 2022: 398-411 [doi]
- Induced Disjoint Paths and Connected Subgraphs for H-Free GraphsBarnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. algorithmica, 85(9):2580-2604, September 2023. [doi]
- Induced Disjoint Paths in Claw-Free GraphsPetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. siamdm, 29(1):348-375, 2015. [doi]
- Induced Disjoint Paths in Claw-Free GraphsPetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. esa 2012: 515-526 [doi]
- Disjoint Paths and Connected Subgraphs for H-Free GraphsWalter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. iwoca 2021: 414-427 [doi]
- Induced disjoint paths in circular-arc graphs in linear timePetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. TCS, 640:70-83, 2016. [doi]
- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint PathsRémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma. isaac 2011: 110-119 [doi]