A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden. A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 574-586, ACM, 2018. [doi]

Abstract

Abstract is missing.