The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Journal of Experimental Algorithmics (JEA)
Note: Constrained k-center and movement to independence
Discrete Applied Mathematics
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixed-parameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixed-parameter intractability results are surveyed as well. Finally, we give some directions for future research.