TY - GEN
T1 - Parameterized Computational Geometry via Decomposition Theorems
AU - Panolan, Fahad
AU - Saurabh, Saket
AU - Zehavi, Meirav
N1 - Publisher Copyright:
© 2019, Springer Nature Switzerland AG.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85062653586&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-10564-8_2
DO - 10.1007/978-3-030-10564-8_2
M3 - Conference contribution
AN - SCOPUS:85062653586
SN - 9783030105631
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 15
EP - 27
BT - WALCOM
A2 - Mukhopadhyaya, Krishnendu
A2 - Nakano, Shin-ichi
A2 - Das, Gautam K.
A2 - Mandal, Partha S.
PB - Springer Verlag
T2 - 13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019
Y2 - 27 February 2019 through 2 March 2019
ER -