Pages that link to "Item:Q3387760"
From MaRDI portal
The following pages link to A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760):
Displaying 5 items.
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
- An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)
- (Q6179341) (← links)
