The Parameterized Complexity of Regular Subgraph Problems and Generalizations

Mathieson, Luke; Szeider, Stefan

by Luke Mathieson, Stefan Szeider

Reference:

The Parameterized Complexity of Regular Subgraph Problems and GeneralizationsLuke Mathieson, Stefan SzeiderProceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland, P. Manyem, eds.), volume 77 of Conferences in Research and Practice in Information Technology, pages 79-86, 2008, Australian Computer Society.

Bibtex Entry:

@InProceedings{MathiesonSzeider08,
  author = 	 {Luke Mathieson and Stefan Szeider},
  title = 	 {The Parameterized Complexity of Regular Subgraph
                  Problems and Generalizations},
  booktitle = {Proceedings of CATS 2008, Computing: The Australasian
                  Theory Symposium, University of Wollongong, New
                  South Wales, Australia, January 22-25, 2008},
  pages = 	 {79-86},
  year = 	 {2008},
  editor = 	 {J. Harland and P. Manyem},
  volume = 	 {77},
  series = 	 {Conferences in Research and Practice in 
                  Information Technology},
  publisher =    {Australian Computer Society},
}