Pages that link to "Item:Q3507345"
From MaRDI portal
The following pages link to The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345):
Displaying 7 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)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time (Q1208431) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems (Q5757391) (← links)