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 Service![]() Joint 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 Parameterized Complexity 301: A Workshop on Parameterized Complexity ![]() Talk given in The Recent Past and Near Future of Clustering online workshop as part of STOC'21 Lectures given in Recent Trends in Algorithms 2022 forum karthik "dot" cs "at" rutgers "dot" edu Curriculum VitaeFor all Technical/Official purposes, here is an abridged version of my Curriculum Vitae (CV). |