A FRAMEWORK FOR EXPONENTIAL-TIME-HYPOTHESIS-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

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Original languageEnglish
Pages (from-to)1291-1331
Number of pages41
JournalSiam Journal on Computing
Volume49
Issue number6
DOIs
Publication statusPublished - 2020

Keywords

  • unit disk graph
  • separator
  • fat objects
  • subexponential
  • ETH
  • COMPLEXITY
  • TREEWIDTH
  • PATHS
  • SET

Cite this