The Parameterized Complexity of Regular Subgraph Problems and Generalizations
Abstract
Luke Mathieson, Stefan Szeider. The Parameterized Complexity of Regular Subgraph Problems and Generalizations. Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland and P. Manyem), volume 77 of Conferences in Research and Practice in Information Technology, pages 79-86, 2008, Australian Computer Society.
Type
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.