Parameterized Complexity of Geometric Problems (2007)
by
Panos Giannopoulos
,
Christian Knauer
,
Sue Whitesides
| Citations: | 7 - 1 self |
BibTeX
@MISC{Giannopoulos07parameterizedcomplexity,
author = {Panos Giannopoulos and Christian Knauer and Sue Whitesides},
title = { Parameterized Complexity of Geometric Problems},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
