Output details

Finding induced paths of given parity in claw-free graphs

<12>H. Bruhn and O. Schaudt, Claw-free t-perfect graphs can be recognised in polynomial time (http://arxiv.org/abs/1310.8186) makes "extensive use" of our paper. Their polynomial time algorithm heavily relies (step 7, page 16) on ours. Our work was also cited and continued in M. Kaminski and N. Nishimura, Finding an induced path of given parity in planar graphs in polynomial time, Proc. SODA2012, pp.656-670. The conference version of our paper (Proc. WG2009, pp. 341-352) has been discussed in the blog of Professor David Eppstein (http://11011110.livejournal.com/175133.html) who mentioned that the presentation of our paper was his favorite "contributed talk of the first day".