On the Complexity Landscape of Connected f-factor Problems

Ganian, Robert; Narayanaswamy, N.S.; Ordyniak, Sebastian; Rahul, C.S.; S., Ramanujan M.

by Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S.

Reference:

On the Complexity Landscape of Connected f-factor ProblemsRobert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S.Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), pages 41:1–41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Bibtex Entry:

@inproceedings{GNORRamanujan16,
  author    = {Robert Ganian and N.S. Narayanaswamy and Sebastian Ordyniak and C.S. Rahul and Ramanujan M. S.},
  title     = {On the Complexity Landscape of Connected f-factor Problems},
  booktitle = {Mathematical Foundations of Computer Science 2016 - 41st International Symposium, {MFCS} 2016},
  year      = {2016},
  pages     = {41:1--41:14},  
  editor    = {Piotr Faliszewski and
               Anca Muscholl and
               Rolf Niedermeier},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2016/6501/},
  keywords  = {xtract}
}