1. Lecture Notes in Computer Science;D. Binkele-Raible,2010
2. Lecture Notes in Computer Science;H. Fernau,2006
3. Fomin, F., Gaspers, S., Saurabh, S., Stepanov, A.: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2), 181–207 (2009)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to The Theory of NP-Completeness. Freeman, San Francisco (1979)
5. Iwaide, K., Nagamochi, H.: An Improved Algorithm for Parameterized Edge Dominating Set Problem. Technical Report 2014-004 Kyoto University (2014),
http://www.amp.i.kyoto-u.ac.jp/tecrep/