Artykuły udostępnione publicznie: - Karthik C. S.Więcej informacji
Dostępne w jakimś miejscu: 17
On the parameterized complexity of approximating dominating set
Karthik C. S., B Laekhanukit, P Manurangsi
Journal of the ACM, 2019
Upoważnienia: US National Science Foundation
Inapproximability of clustering in lp metrics
V Cohen-Addad, Karthik C. S.
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
Upoważnienia: Agence Nationale de la Recherche
On closest pair in euclidean metric: Monochromatic is as hard as bichromatic
Karthik C. S., P Manurangsi
Combinatorica 40 (4), 539-573, 2020
Upoważnienia: US National Science Foundation
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
Upoważnienia: Agence Nationale de la Recherche
Building efficient and compact data structures for simplicial complexes
JD Boissonnat, Karthik C. S., S Tavenas
Algorithmica 79 (2), 530-567, 2017
Upoważnienia: European Commission
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
Upoważnienia: Natural Sciences and Engineering Research Council of Canada, Department of …
An efficient representation for filtrations of simplicial complexes
JD Boissonnat, K CS
ACM Transactions on Algorithms (TALG) 14 (4), 1-21, 2018
Upoważnienia: European Commission
Almost polynomial factor inapproximability for parameterized k-clique
CS Karthik, S Khot
37th Computational Complexity Conference (CCC 2022), 6: 1-6: 21, 2022
Upoważnienia: US National Science Foundation
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
Upoważnienia: US National Science Foundation, European Commission
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
Upoważnienia: Magyar Tudományos Akadémia, European Commission
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
Upoważnienia: US National Science Foundation
On efficient low distortion ultrametric embedding
V Cohen-Addad, CS Karthik, G Lagarde
International Conference on Machine Learning, 2078-2088, 2020
Upoważnienia: Agence Nationale de la Recherche
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
K CS, D Marx, M Pilipczuk, U Souza
2024 Symposium on Simplicity in Algorithms (SOSA), 383-395, 2024
Upoważnienia: US National Science Foundation, Villum Foundation, European Commission
Toward a general direct product testing theorem
E Goldenberg, K CS
ACM Transactions on Computation Theory (TOCT) 12 (1), 1-18, 2019
Upoważnienia: European Commission
On Approximability of Steiner Tree in ℓp-metrics
H Fleischmann, ST Gavva, K CS
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
Upoważnienia: US National Science Foundation
Inapproximability of maximum diameter clustering for few clusters
H Fleischmann, K Karlov, K CS, A Padaki, S Zharkov
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
Upoważnienia: European Commission
Fairness of linear regression in decision making
V Cohen-Addad, ST Gavva, CS Karthik, C Mathieu, Namrata
International journal of data science and analytics 18 (3), 337-347, 2024
Upoważnienia: Agence Nationale de la Recherche
Informacje na temat publikacji i finansowania automatycznie określa program komputerowy