Pages that link to "Item:Q3605506"
From MaRDI portal
The following pages link to Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506):
Displaying 12 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)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Approximation algorithms for orthogonal line centers (Q831691) (← links)
- Constant approximation algorithms for rectangle stabbing and related problems (Q866919) (← links)
- Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time (Q1208431) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems (Q5757391) (← links)
- Approximation algorithms for orthogonal line centers (Q6166042) (← links)
- Red blue set cover problem on axis-parallel hyperplanes and other objects (Q6551707) (← links)
