Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable

M. S. Ramanujan, Stefan Szeider. Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. In Satinder P. Singh, Shaul Markovitch, editors, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. pages 3929-3935, AAAI Press, 2017. [doi]

Abstract

Abstract is missing.