Skip Navigation


The Computer Journal Advance Access originally published online on July 27, 2007
The Computer Journal 2008 51(3):372-384; doi:10.1093/comjnl/bxm053
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
51/3/372    most recent
bxm053v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Giannopoulos, P.
Right arrow Articles by Whitesides, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Parameterized Complexity of Geometric Problems

Panos Giannopoulos1,*, Christian Knauer2 and Sue Whitesides3

1 Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany
2 Institut für Informatik, Freie Universität Berlin, Takustraße 9, D–14195 Berlin, Germany
3 School of Computer Science, McGill University, 3480 University Street, Montreal, Canada H3A 2A7

* Corresponding author: panos{at}informatik.hu-berlin.de

Received 5 February 2007; revised 31 March 2007

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.

Key Words: Computational geometry • graph drawing • Parameterized algorithms


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.