A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
DOI10.1137/20M1320870zbMath1497.68375WikidataQ115525545 ScholiaQ115525545MaRDI QIDQ3387760
Hans L. Bodlaender, Dániel Marx, Mark T. de Berg, Tom C. van der Zanden, Sándor Kisfaludi-Bak
Publication date: 13 January 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C62: Graph representations (geometric and intersection representations, etc.)
