Items where authors include "Saurabh, S."

Article

Gowda, K.N., Lonkar, A., Panolan, F. orcid.org/0000-0001-6213-8687 et al. (2 more authors) (2024) Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica, 86. pp. 1657-1699. ISSN 0178-4617

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

Gurjar, R., Lokshtanov, D., Misra, P. et al. (3 more authors) (2025) Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. In: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), 25-29 Aug 2025, Warsaw, Poland. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , Wadern, Germany , 54:1-54:17. ISBN 978-3-95977-388-1

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2025) Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. In: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. The 57th ACM Symposium on Theory of Computing (STOC 2025), 23-27 Jun 2025, Prague, Czech Republic. ACM , New York, NY, United States , pp. 1965-1974. ISBN 979-8-4007-1510-5

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2025) Subexponential Parameterized Algorithms for Hitting Subgraphs. In: STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. The 57th ACM Symposium on Theory of Computing (STOC 2025), 23-27 Jun 2025, Prague, Czech Republic. ACM , New York, NY, United States , pp. 1975-1984. ISBN 979-8-4007-1510-5

Agrawal, A., Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687 et al. (2 more authors) (2025) Parameterized Saga of First-Fit and Last-Fit Coloring. In: Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). The 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 04-07 Mar 2025, Jena, Germany. Leibniz International Proceedings in Informatics (LIPIcs), 327 (5). Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 5:1-5:21.

Aute, S., Panolan, F. orcid.org/0000-0001-6213-8687, Saha, S. et al. (2 more authors) (2025) Parameterized Complexity of Generalizations of Edge Dominating Set. In: 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025). 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025), 20-23 Jan 2025, Bratislava, Slovakia. Lecture Notes in Computer Science, 15538 . Springer , Cham, Switzerland , pp. 65-79. ISBN 978-3-031-82669-6

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (3 more authors) (2025) Crossing Number in Slightly Superexponential Time (Extended Abstract). In: Azar, Y. and Panigrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1412-1424. ISBN 978-1-61197-832-2

Bentert, M., Fomin, F.V., Golovach, P.A. et al. (6 more authors) (2025) Packing Short Cycles. In: Azar, Y. and Pangrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1425-1463. ISBN 978-1-61197-832-2

Gupta, S., Inamdar, T., Jain, P. et al. (3 more authors) (2024) When far is better: The Chamberlin-Courant approach to obnoxious committee selection. In: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024), 16-18 Dec 2024, Gandhinagar, India. Leibniz International Proceedings in Informatics (LIPIcs), 323 . LIPIcs , Wadern, Germany , 24:1-24:21. ISBN 978-3-95977-355-3

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2024) Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. In: In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). APPROX/RANDOM 2024, 28-30 Aug 2024, London. Leibniz International Proceedings in Informatics (LIPIcs), 317 . LIPIcs , Wadern, Germany , 6:1-6:14. ISBN 978-3-95977-348-5

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

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