## Karthik C. S.
## Research InterestsI am broadly interested in Theoretical Computer Science. In particular, I have spent the last few yearsproving Hardness of Approximation results for problems in P, and understanding the Hardness of Geometric problems (such as Clustering, Steiner Tree, Closest Pair, and Fixed Point Computation). Here are some buzzwords that I associate my research interests with: ## Community ServiceSODA'24, FSTTCS'23, UAI'23 , ICALP'23, WAOA'22, UAI'22 (Top Reviewer!), ITCS'22, UAI'21, IPEC'21Parameterized Approximation: Algorithms and Hardness
Rutgers/DIMACS Theory of Computing Seminar (Fall 2022 - Present)A Survey on Approximation in Parameterized Complexity: Hardness and AlgorithmsJoint work with Andreas Emil Feldmann, Euiwoong Lee, and Pasin Manurangsi. Algorithms, 13(6), 146, 2020. Talk given in Frontiers of Parameterized Complexity Series Lectures given in Talk given in The Recent Past and Near Future of Clustering
online workshop as part of STOC'21 Lectures given in karthik "dot" cs "at" rutgers "dot" edu ## Curriculum VitaeFor all Technical/Official purposes, |