Items where authors include "Ramanujan, M.S."

Article

Ganian, R., Narayanaswamy, N.S., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2019) On the complexity landscape of connected f-factor problems. Algorithmica, 81 (6). pp. 2606-2632. ISSN 0178-4617

Meier, A., Ordyniak, S. orcid.org/0000-0003-1935-651X, Ramanujan, M.S. et al. (1 more author) (2019) Backdoors for Linear Temporal Logic. Algorithmica, 81 (2). pp. 476-496. ISSN 0178-4617

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

Lokshtanov, D., Misra, P., Panolan, F. et al. (3 more authors) (2024) Meta-theorems for Parameterized Streaming Algorithms. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA24). ACM-SIAM Symposium on Discrete Algorithms (SODA24), 07-10 Jan 2024, Alexandria, Virginia, USA. Society for Industrial and Applied Mathematics (SIAM) , Philadelphia, PA , pp. 712-739. ISBN 978-1-61197-791-2