Pages that link to "Item:Q2428672"
From MaRDI portal
The following pages link to The parameterized complexity of stabbing rectangles (Q2428672):
Displaying 8 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Constant approximation algorithms for rectangle stabbing and related problems (Q866919) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- (Q4862345) (← links)
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems (Q5757391) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)