Pages that link to "Item:Q3452835"
From MaRDI portal
The following pages link to Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835):
Displaying 16 items.
- Packing and covering with non-piercing regions (Q1991095) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Computational complexity for the problem of optimal intersection of straight line segments by disks (Q2424188) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Sublinear Separators in Intersection Graphs of Convex Shapes (Q4992837) (← links)
- (Q5009574) (← links)
- (Q5115816) (← links)
- (Q5116474) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Hardness of the generalized coloring numbers (Q6614401) (← links)
