Items where authors include "Kanesh, L."
Article
Kanesh, L., Madathil, J., Roy, S. orcid.org/0000-0003-3633-542X et al. (2 more authors) (2023) Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM Journal on Discrete Mathematics, 37 (4). pp. 2626-2669. ISSN 0895-4801
Proceedings Paper
Kanesh, L., Panolan, F. orcid.org/0000-0001-6213-8687, Ramanujan, M.S. et al. (1 more author) (2024) Decremental Sensitivity Oracles for Covering and Packing Minors. In: Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), 12-14 Mar 2024, Clermont-Ferrand, France. Leibniz International Proceedings in Informatics (LIPIcs), 289 . Schloss Dagstuhl – Leibniz-Zentrum für Informatik . ISBN 978-3-95977-311-9
Jain, P., Kanesh, L., Panolan, F. orcid.org/0000-0001-6213-8687 et al. (4 more authors) (2024) Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. In: Soto, J.A. and Wiese, A., (eds.) Proceedings of Latin American Theoretical Informatics (LATIN 2024). Latin American Theoretical Informatics (LATIN 2024), 18-22 Mar 2024, Puerto Varas, Chile. Lecture Notes in Computer Science . Springer Nature , pp. 223-237. ISBN 978-3-031-55601-2
Up a level