| 2026 | ICALP | Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. | Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. S., Michal Kouck |
| 2026 | STOC | Fine-Grained Complexity of Continuous Euclidean k-Center. | Lotte Blank, Karl Bringmann, Parinya Chalermsook, Karthik C. S., Benedikt Kolbe, Hung Le, Geert van Wordragen |
| 2025 | ESA | Hardness of Median and Center in the Ulam Metric. | Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S. |
| 2025 | SODA | Maximum Span Hypothesis: A Potentially Weaker Assumption than Gap-ETH for Parameterized Complexity. | Karthik C. S., Subhash Khot |
| 2025 | SODA | Inapproximability of Maximum Diameter Clustering for Few Clusters. | Henry L. Fleischmann, Kyrylo Karlov, Karthik C. S., Ashwin Padaki, Stepan Zharkov |
| 2025 | STOC | Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. | Mitali Bafna, Karthik C. S., Dor Minzer |
| 2024 | ESA | On Connections Between k-Coloring and Euclidean k-Means. | Enver Aman, Karthik C. S., Sharath Punna |
| 2024 | ISIT | Explicit Good Codes Approaching Distance 1 in Ulam Metric. | Elazar Goldenberg, Mursalin Habib, Karthik C. S. |
| 2024 | SODA | On Approximability of Steiner Tree in | Henry L. Fleischmann, Surya Teja Gavva, Karthik C. S. |
| 2023 | ESA | Can You Solve Closest String Faster Than Exhaustive Search? | Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier |
| 2022 | LATIN | Obtaining Approximately Optimal and Diverse Solutions via Dispersion. | Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang |
| 2022 | SODA | Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓ | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2021 | FOCS | Applications of Random Algebraic Constructions to Hardness of Approximation. | Boris Bukh, Karthik C. S., Bhargav Narayanan |
| 2021 | SODA | On Approximability of Clustering Problems Without Candidate Centers. | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
| 2021 | SODA | Deterministic Replacement Path Covering. | Karthik C. S., Merav Parter |
| 2020 | ICML | On Efficient Low Distortion Ultrametric Embedding. | Vincent Cohen-Addad, Karthik C. S., Guillaume Lagarde |
| 2019 | FOCS | Inapproximability of Clustering in Lp Metrics. | Vincent Cohen-Addad, Karthik C. S. |
| 2018 | ICALP | Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. | Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi |
| 2018 | STOC | On the parameterized complexity of approximating dominating set. | Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi |
| 2017 | SODA | An Efficient Representation for Filtrations of Simplicial Complexes. | Jean-Daniel Boissonnat, Karthik C. S. |