A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q115525545, #quickstatements; #temporary_batch_1706273008033 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:53, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs |
scientific article |
Statements
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (English)
0 references
13 January 2021
0 references
unit disk graph
0 references
separator
0 references
fat objects
0 references
subexponential
0 references
ETH
0 references
