1. R. Downey, Parameterized complexity for the skeptic, in: Proceedings. 18th IEEE Annual Conference on Proceedings 18th IEEE Annual Conference on Computational Complexity, 2003, pp. 147–168.
2. Parameterized Complexity;Downey,1999
3. Computers and Intractability. A Guide to the Theory of NP-Completeness;Garey,1979
4. K. Weihe, Covering trains by stations or the power of data reduction, in: R. Battiti and A.A. Bertossi (Eds.), Proceedings of Algorithms and Experiments, ALEX98, 1998, pp. 1–8.
5. M. Grohe, K. Kawarabayashi, D. Marx, P. Wollan, Finding topological subgraphs is fixed-parameter tractable, in: STOC 2011, 2011, pp. 479–488.