## Karthik C. S.## Biography
Karthik C. S. is an Assistant Professor in the Department of Computer Science at Rutgers University supported by a Simons Foundation Junior Faculty Fellowship and a grant from the National Science Foundation. He received his Ph.D. in 2019 from Weizmann Institute of Science where he was advised by Irit Dinur and his M.S. in 2014 from École Normale Supérieure de Lyon. He has held postdoctoral appointments at Tel Aviv University (hosted by Amir Shpilka) and New York University (hosted by Subhash Khot). He is broadly interested in complexity theory and discrete geometry with an emphasis on hardness of approximation, fine-grained complexity, and parameterized complexity.
## Community ServiceSTOC'24, ICDM'24, SODA'24, FSTTCS'23, UAI'23 , ICALP'23, WAOA'22, UAI'22 (Top Reviewer!), ITCS'22, UAI'21, IPEC'21Fine-Grained Complexity (2024 - 2027)Generously supported by a grant from the National Science Foundation Old Questions and New Directions in Theory of Clustering (March 2024)
Parameterized Approximation: Algorithms and Hardness (July 2023)
Rutgers/DIMACS Theory of Computing Seminar (2022 - 2024)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, |