1. Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements. J Algorithms 41(2):280–301
2. Courcelle B (1990) The monadic second-order logic of graphs I: recognizable sets of finite graphs. Inf Comput 85:12–75
3. Cygan M, Fomin FV, Kowalik L, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, Cham. http://www.springer.com/us/book/9783319212746
4. Fellows MR, Lokshtanov D, Misra N, Rosamond FA, Saurabh S (2008) Graph layout problems parameterized by vertex cover. In: 19th international symposium on algorithms and computation (ISAAC). Lecture notes in computer science, vol 5369. Springer, Berlin, pp 294–305
5. Fellows M, Lokshtanov D, Misra N, Mnich M, Rosamond F, Saurabh S (2009) The complexity ecology of parameters: an illustration using bounded max leaf number. ACM Trans Comput Syst 45:822–848