Output details
11 - Computer Science and Informatics
University of Durham
Article title
The k-in-a-path problem for claw-free graphs
Type
D - Journal article
Title of journal
Algorithmica
Article number
-
Volume number
62
Issue number
1-2
First page of article
499
ISSN of journal
0178-4617
Year of publication
2012
Number of additional authors
3
Additional information
<12>A conference version appeared in the proceedings of STACS 2010 (pp. 371-382) with acceptance ratio 23% and was selected to a special issue in Theory of Computing Systems only containing the very best conference papers (email verification can be supplied). We chose for Algorithmica. Our paper was cited by H. Bruhn and A. Saito, Clique or hole in claw-free graphs, Journal of Combinatorial Theory, Series B, 102 (2012) 1-13, as it provides an algorithmic extension of Theorem 5. We refined its techniques in P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced Disjoint Paths in Claw-Free Graphs, proc. ESA 2012, pp. 515-526.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Algorithms and Complexity Research Group
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
