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]
@inproceedings{MathiesonS08:0,
title = {The Parameterized Complexity of Regular Subgraph Problems and Generalizations},
author = {Luke Mathieson and Stefan Szeider},
year = {2008},
url = {http://crpit.com/abstracts/CRPITV77Mathieson.html},
researchr = {https://researchr.org/publication/MathiesonS08%3A0},
cites = {0},
citedby = {0},
pages = {79-86},
booktitle = {Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings},
editor = {James Harland and Prabhu Manyem},
volume = {77},
series = {CRPIT},
publisher = {Australian Computer Society},
isbn = {978-1-920682-58-3},
}