A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q115525545, #quickstatements; #temporary_batch_1706273008033 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115525545 / rank | |||
Normal rank | |||
Revision as of 13:54, 26 January 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
