Obserwuj
Karthik C. S.
Karthik C. S.
Rutgers University
Zweryfikowany adres z rutgers.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
On the parameterized complexity of approximating dominating set
Karthik C. S., B Laekhanukit, P Manurangsi
Journal of the ACM, 2019
1112019
A survey on approximation in parameterized complexity: Hardness and algorithms
AE Feldmann, Karthik C. S., E Lee, P Manurangsi
Algorithms 13 (6), 146, 2020
832020
Inapproximability of clustering in lp metrics
V Cohen-Addad, Karthik C. S.
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
542019
On closest pair in euclidean metric: Monochromatic is as hard as bichromatic
Karthik C. S., P Manurangsi
Combinatorica 40 (4), 539-573, 2020
442020
On approximability of clustering problems without candidate centers
V Cohen-Addad, CS Karthik, E Lee
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
392021
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in ℓp-metrics
V Cohen-Addad, KC S, E Lee
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
362022
Parameterized intractability of even set and shortest vector problem from gap-eth
A Bhattacharyya, S Ghoshal, K C. S., P Manurangsi
ICALP, 2018
352018
Building efficient and compact data structures for simplicial complexes
JD Boissonnat, Karthik C. S., S Tavenas
Algorithmica 79 (2), 530-567, 2017
342017
Parameterized Intractability of Even Set and Shortest<? brk?> Vector Problem
A Bhattacharyya, É Bonnet, L Egri, S Ghoshal, Karthik C. S., B Lin, ...
Journal of the ACM (JACM) 68 (3), 1-40, 2021
332021
Deterministic replacement path covering
CS Karthik, M Parter
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
212021
An efficient representation for filtrations of simplicial complexes
JD Boissonnat, K CS
ACM Transactions on Algorithms (TALG) 14 (4), 1-21, 2018
202018
Almost polynomial factor inapproximability for parameterized k-clique
CS Karthik, S Khot
37th Computational Complexity Conference (CCC 2022), 6: 1-6: 21, 2022
182022
On the complexity of closest pair via polar-pair of point-sets
R David, KC S, B Laekhanukit
SIAM Journal on Discrete Mathematics 33 (1), 509-527, 2019
18*2019
Communication complexity of correlated equilibrium in two-player games
A Ganor
arXiv preprint arXiv:1704.01104, 2017
18*2017
Did the train reach its destination: The complexity of finding a witness
CS Karthik
Information Processing Letters 121, 17-21, 2017
172017
On hardness of approximation of parameterized set cover and label cover: Threshold graphs from error correcting codes
CS Karthik, LN Inbal
Symposium on Simplicity in Algorithms (SOSA), 210-223, 2021
132021
On communication complexity of fixed point computation
A Ganor, K C. S., D Pálvölgyi
ACM transactions on economics and computation 9 (4), 1-27, 2021
122021
On the sensitivity conjecture for disjunctive normal forms
S Tavenas
arXiv preprint arXiv:1607.05189, 2016
122016
Obtaining approximately optimal and diverse solutions via dispersion
J Gao, M Goswami, CS Karthik, MT Tsai, SY Tsai, HT Yang
Latin American Symposium on Theoretical Informatics, 222-239, 2022
112022
On inapproximability of reconfiguration problems: PSPACE-hardness and some tight NP-hardness results
S Karthik C, P Manurangsi
arXiv e-prints, arXiv: 2312.17140, 2023
82023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20