| 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 |
Deterministic replacement path covering
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788494 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Obtaining approximately optimal and diverse solutions via dispersion
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Hardness Amplification of Optimization Problems
(available as arXiv preprint) | 2023-02-03 | Paper |
Toward a general direct product testing theorem
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
\(H_\infty\) performance analysis for uncertain systems with actuator fault control via relaxed integral inequalities
International Journal of Dynamical Systems and Differential Equations | 2022-03-14 | Paper |
| Communication complexity of correlated equilibrium with small support | 2021-08-04 | Paper |
Parameterized intractability of even set and shortest vector problem from Gap-ETH
(available as arXiv preprint) | 2021-07-28 | Paper |
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
Combinatorica | 2021-01-25 | Paper |
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
Combinatorica | 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
Journal of the ACM | 2020-02-11 | Paper |
Observer-based exponential stabilization for time-delay systems via augmented weighted integral inequality
Journal of the Franklin Institute | 2019-11-07 | Paper |
On the parameterized complexity of approximating dominating set
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
An efficient representation for filtrations of simplicial complexes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
On the complexity of closest pair via polar-pair of point-sets
SIAM Journal on Discrete Mathematics | 2019-03-20 | Paper |
| Ham Sandwich is equivalent to Borsuk-Ulam | 2018-08-13 | Paper |
An efficient representation for filtrations of simplicial complexes
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the sensitivity conjecture for disjunctive normal forms
(available as arXiv preprint) | 2018-04-19 | Paper |
Building efficient and compact data structures for simplicial complexes
Algorithmica | 2017-10-10 | Paper |
Building efficient and compact data structures for simplicial complexes
(available as arXiv preprint) | 2017-10-10 | Paper |
Did the train reach its destination: the complexity of finding a witness
Information Processing Letters | 2017-02-21 | Paper |
