On the Complexity Landscape of Connected f-factor Problems

Abstract

Full Citation:

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

Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.