Pages that link to "Item:Q5920196"
From MaRDI portal
The following pages link to Optimality program in segment and string graphs (Q5920196):
Displaying 7 items.
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Fine-grained complexity of coloring unit disks and balls (Q4580091) (← links)
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (Q5230321) (← links)
- (Q6065396) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
- Proper colorability of segment intersection graphs (Q6571282) (← links)