Parameterized Complexity of Geometric Covering Problems Having Conflicts

Aritra Banik, Fahad Panolan, Venkatesh Raman 0001, Vibha Sahlot, Saket Saurabh. Parameterized Complexity of Geometric Covering Problems Having Conflicts. In Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack, editors, Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings. Volume 10389 of Lecture Notes in Computer Science, pages 61-72, Springer, 2017. [doi]

Abstract

Abstract is missing.