C. S. Karthik

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
On complexity of 1-center in various metrics	2025-01-14	Paper
Can you solve closest string faster than exhaustive search?	2025-01-06	Paper
On approximability of Steiner tree in \(\ell_p\)-metrics	2024-11-28	Paper
Johnson coverage hypothesis: inapproximability of \(k\)-means and \(k\)-median in \(\ell_p\)-metrics	2024-07-19	Paper
Almost polynomial factor inapproximability for parameterized \(k\)-clique	2024-07-05	Paper
Conditional lower bounds for sparse parameterized 2-CSP: a streamlined proof	2024-05-29	Paper
On hardness of approximation of parameterized set cover and label cover: threshold graphs from error correcting codes	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6147293	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147414	2024-01-15	Paper
Obtaining approximately optimal and diverse solutions via dispersion	2023-07-26	Paper
Hardness Amplification of Optimization Problems	2023-02-03	Paper
Toward a General Direct Product Testing Theorem	2022-12-05	Paper
\(H_\infty\) performance analysis for uncertain systems with actuator fault control via relaxed integral inequalities	2022-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q5009504	2021-08-04	Paper
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH	2021-07-28	Paper
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic	2021-01-25	Paper
On the Complexity of Closest Pair via Polar-Pair of Point-Sets	2020-08-18	Paper
On the Parameterized Complexity of Approximating Dominating Set	2020-02-11	Paper
Observer-based exponential stabilization for time-delay systems via augmented weighted integral inequality	2019-11-07	Paper
On the parameterized complexity of approximating dominating set	2019-08-22	Paper
An Efficient Representation for Filtrations of Simplicial Complexes	2019-03-28	Paper
On the Complexity of Closest Pair via Polar-Pair of Point-Sets	2019-03-20	Paper
Ham Sandwich is Equivalent to Borsuk-Ulam	2018-08-13	Paper
An Efficient Representation for Filtrations of Simplicial Complexes	2018-07-16	Paper
On the Sensitivity Conjecture for Disjunctive Normal Forms	2018-04-19	Paper
Building efficient and compact data structures for simplicial complexes	2017-10-10	Paper
Building Efficient and Compact Data Structures for Simplicial Complexes	2017-10-10	Paper
Did the train reach its destination: the complexity of finding a witness	2017-02-21	Paper

Research outcomes over time

This page was built for person: C. S. Karthik