Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable

Abstract

Full Citation:

M. S. Ramanujan, Stefan Szeider. Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929-3935, 2017.

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.