A Few Equivalences of Wall-Sun-Sun Prime Conjecture - Arpan Saha; Karthik C. S. 001 (CoRR, 2011)

On the Sensitivity Conjecture for Disjunctive Normal Forms. - Karthik C. S. 001; Sébastien Tavenas (FSTTCS, 2016)

The Curse of Medium Dimension for Geometric Problems in Almost Every Norm. - Roee David; Karthik C. S. 001; Bundit Laekhanukit (CoRR, 2016)

Ham Sandwich is Equivalent to Borsuk-Ulam. - Karthik C. S. 001; Arpan Saha (SoCG, 2017)

Building Efficient and Compact Data Structures for Simplicial Complexes. - Jean-Daniel Boissonnat; Karthik C. S. 001; Sébastien Tavenas (Algorithmica, 2017)

Communication Complexity of Correlated Equilibrium in Two-Player Games. - Anat Ganor; Karthik C. S. 001 (Electron. Colloquium Comput. Complex., 2017)

On the Parameterized Complexity of Approximating Dominating Set. - Karthik C. S. 001; Bundit Laekhanukit; Pasin Manurangsi (Electron. Colloquium Comput. Complex., 2017)

Did the train reach its destination: The complexity of finding a witness. - Karthik C. S. 001 (Inf. Process. Lett., 2017)

Communication Complexity of Correlated Equilibrium with Small Support. - Anat Ganor; Karthik C. S. 001 (APPROX-RANDOM, 2018)

Towards a General Direct Product Testing Theorem. - Elazar Goldenberg; Karthik C. S. 001 (FSTTCS, 2018)

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. - Arnab Bhattacharyya 001; Suprovat Ghoshal; Karthik C. S. 001; Pasin Manurangsi (Electron. Colloquium Comput. Complex., 2018)

On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. - Karthik C. S. 001; Pasin Manurangsi (Electron. Colloquium Comput. Complex., 2018)

An Efficient Representation for Filtrations of Simplicial Complexes. - Jean-Daniel Boissonnat; Karthik C. S. 001 (ACM Trans. Algorithms, 2018)

Inapproximability of Clustering in Lp Metrics. - Vincent Cohen-Addad; Karthik C. S. 001 (FOCS, 2019)

Parameterized Intractability of Even Set and Shortest Vector Problem. - Arnab Bhattacharyya 001; Édouard Bonnet; László Egri; Suprovat Ghoshal; Karthik C. S. 001; Bingkai Lin; Pasin Manurangsi; Dániel Marx (Electron. Colloquium Comput. Complex., 2019)

Hardness Amplification of Optimization Problems. - Elazar Goldenberg; Karthik C. S. 001 (Electron. Colloquium Comput. Complex., 2019)

On the Complexity of Closest Pair via Polar-Pair of Point-Sets. - Roee David; Karthik C. S. 001; Bundit Laekhanukit (SIAM J. Discret. Math., 2019)

On Efficient Low Distortion Ultrametric Embedding. - Vincent Cohen-Addad; Karthik C. S. 001; Guillaume Lagarde (ICML, 2020)

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms. - Andreas Emil Feldmann; Karthik C. S. 001; Euiwoong Lee; Pasin Manurangsi (Algorithms, 2020)

Toward a General Direct Product Testing Theorem. - Elazar Goldenberg; Karthik C. S. 001 (ACM Trans. Comput. Theory, 2020)

On Approximability of Clustering Problems Without Candidate Centers. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (SODA, 2021)

On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. - Karthik C. S. 001; Inbal Livni Navon (SOSA, 2021)

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (CoRR, 2021)

Applications of Random Algebraic Constructions to Hardness of Approximation. - Boris Bukh; Karthik C. S. 001; Bhargav Narayanan (Electron. Colloquium Comput. Complex., 2021)

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in $ ell_p$-metrics. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (Electron. Colloquium Comput. Complex., 2021)

On Communication Complexity of Fixed Point Computation. - Anat Ganor; Karthik C. S. 001; Dömötör Pálvölgyi (ACM Trans. Economics and Comput., 2021)

Almost Polynomial Factor Inapproximability for Parameterized k-Clique. - Karthik C. S. 001; Subhash Khot (CCC, 2022)

Obtaining Approximately Optimal and Diverse Solutions via Dispersion. - Jie Gao 001; Mayank Goswami 001; Karthik C. S. 001; Meng-Tsung Tsai; Shih-Yu Tsai; Hao-Tsung Yang (LATIN, 2022)

Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metrics. - Vincent Cohen-Addad; Karthik C. S. 001; Euiwoong Lee (SODA, 2022)

Clustering Categorical Data: Soft Rounding k-modes. - Surya Teja Gavva; Karthik C. S. 001; Sharath Punna (CoRR, 2022)

On Complexity of 1-Center in Various Metrics. - Amir Abboud; MohammadHossein Bateni; Vincent Cohen-Addad; Karthik C. S. 001; Saeed Seddighin (APPROX/RANDOM, 2023)

Can You Solve Closest String Faster Than Exhaustive Search? - Amir Abboud; Nick Fischer; Elazar Goldenberg; Karthik C. S. 001; Ron Safier (ESA, 2023)

Impossibility of Depth Reduction in Explainable Clustering. - Chengyuan Deng; Surya Teja Gavva; Karthik C. S. 001; Parth Patel; Adarsh Srinivasan (CoRR, 2023)

On Steiner Trees of the Regular Simplex. - Henry L. Fleischmann; Guillermo A. Gamboa Q.; Karthik C. S. 001; Josef Matejka; Jakub Petr (CoRR, 2023)

Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). - Karthik C. S. 001; Parinya Chalermsook; Joachim Spoerhase; Meirav Zehavi; Martin G. Herold (Dagstuhl Reports, 2023)

On Connections Between k-Coloring and Euclidean k-Means. - Enver Aman; Karthik C. S. 001; Sharath Punna (ESA, 2024)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP. - Karthik C. S. 001; Euiwoong Lee; Pasin Manurangsi (IPEC, 2024)

On Approximability of Steiner Tree in ℓp-metrics. - Henry L. Fleischmann; Surya Teja Gavva; Karthik C. S. 001 (SODA, 2024)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof. - Karthik C. S. 001; Dániel Marx; Marcin Pilipczuk; Uéverton S. Souza (SOSA, 2024)

Range Longest Increasing Subsequence and its Relatives: Beating Quadratic Barrier and Approaching Optimality. - Karthik C. S. 001; Saladi Rahul (CoRR, 2024)

On Approximability of ℓ22 Min-Sum Clustering. - Karthik C. S. 001; Euiwoong Lee; Yuval Rabani; Chris Schwiegelshohn; Samson Zhou (CoRR, 2024)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results. - Karthik C. S. 001; Pasin Manurangsi (Electron. Colloquium Comput. Complex., 2024)

Clustering categorical data: Soft rounding k-modes. - Surya Teja Gavva; Karthik C. S. 001; Sharath Punna (Inf. Comput., 2024)

Fairness of linear regression in decision making. - Vincent Cohen-Addad; Surya Teja Gavva; Karthik C. S. 001; Claire Mathieu; Namrata (Int. J. Data Sci. Anal., 2024)

Deterministic Replacement Path Covering. - Karthik C. S. 001; Merav Parter (ACM Trans. Algorithms, 2024)

On Approximability of ℓ₂² Min-Sum Clustering. - Karthik C. S. 001; Euiwoong Lee; Yuval Rabani; Chris Schwiegelshohn; Samson Zhou (SoCG, 2025)

Maximum Span Hypothesis: A Potentially Weaker Assumption than Gap-ETH for Parameterized Complexity. - Karthik C. S. 001; Subhash Khot (SODA, 2025)

Inapproximability of Maximum Diameter Clustering for Few Clusters. - Henry L. Fleischmann; Kyrylo Karlov; Karthik C. S. 001; Ashwin Padaki; Stepan Zharkov (SODA, 2025)

Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. - Mitali Bafna; Karthik C. S. 001; Dor Minzer (STOC, 2025)

On Approximability of Steiner Tree in ℓp-metrics. - Henry L. Fleischmann; Surya Teja Gavva; Karthik C. S. 001 (TheoretiCS, 2025)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. - Sudatta Bhattacharya; Sanjana Dey; Elazar Goldenberg; Mursalin Habib; Bernhard Haeupler; Karthik C. S. 001; Michal Koucký 001 (CoRR, 2025)

Hardness of Median and Center in the Ulam Metric. - Nick Fischer; Elazar Goldenberg; Mursalin Habib; Karthik C. S. 001 (CoRR, 2025)

Explicit Good Codes Approaching Distance 1 in Ulam Metric. - Elazar Goldenberg; Mursalin Habib; Karthik C. S. 001 (IEEE Trans. Inf. Theory, 2025)