Parameterized Computational Geometry via Decomposition Theorems

Fahad Panolan, Saket Saurabh, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


Parameterized complexity is one of the most established algorithmic paradigms to deal with computationally hard problems. In the first two decades, the field largely focused on problems arising from studies of graphs and networks. However, lately the focus has changed substantially and it has started to permeate into other fields such as computational geometry, and computational social choice theory. In this article, we will survey some exciting developments in the emerging field of parameterized computational geometry through our contributions. We will focus on designing efficient parameterized algorithms on unit-disk graphs via new graph decomposition theorems.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings
EditorsKrishnendu Mukhopadhyaya, Shin-ichi Nakano, Gautam K. Das, Partha S. Mandal
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783030105631
StatePublished - 1 Jan 2019
Event13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019 - Guwahati, India
Duration: 27 Feb 20192 Mar 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11355 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Parameterized Computational Geometry via Decomposition Theorems'. Together they form a unique fingerprint.

Cite this