1. Alon N, Yuster R, Zwick U (1995) Color coding. J ACM 42(4):844–856
2. Böckenhauer HJ, Hromkovic J, Kneis J, Kupke J (2007) The parameterized approximability of TSP with deadlines. Theory Comput Syst 41(3):431–444
3. Bousquet N, Daligault J, Thomassé S (2011) Multicut is FPT. In: STOC’11, New York, pp 459–468
4. Calabro C, Impagliazzo R, Paturi R (1995) A duality between clause width and clause density for SAT. In: Computational Complexity, Prague, pp 252–260
5. Charikar M, Chekuri C, Cheung TY, Dai Z, Goel A, Guha S, Li M (1999) Approximation algorithms for directed steiner problems. J Algorithms 33(1):73–91