Luke Mathieson, Stefan Szeider. The Parameterized Complexity of Regular Subgraph Problems and Generalizations. In James Harland, Prabhu Manyem, editors, Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings. Volume 77 of CRPIT, pages 79-86, Australian Computer Society, 2008. [doi]
Abstract is missing.