The parameterized complexity of guarding almost convex polygons A Agrawal, KVK Knudsen, D Lokshtanov, S Saurabh, M Zehavi Discrete & Computational Geometry 71 (2), 358-398, 2024 | 13 | 2024 |
Parameterized algorithms for survivable network design with uniform demands J Bang-Jensen, M Basavaraju, KV Klinkby, P Misra, MS Ramanujan, ... Proceedings of the twenty-ninth annual ACM-SIAM symposium on discrete …, 2018 | 10 | 2018 |
Strong connectivity augmentation is FPT KV Klinkby, P Misra, S Saurabh Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 5 | 2021 |
K-distinct branchings admits a polynomial kernel J Bang-Jensen, KV Klinkby, S Saurabh 29th Annual European Symposium on Algorithms, ESA 2021, 11, 2021 | 1 | 2021 |
The parameterized complexity landscape of finding 2-partitions of digraphs J Bang-Jensen, KVK Knudsen, S Saurabh, M Zehavi Theoretical Computer Science 795, 108-114, 2019 | 1 | 2019 |
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands J Bang-Jensen, KV Klinkby, P Misra, S Saurabh 31st Annual European Symposium on Algorithms, ESA 2023, 13, 2023 | | 2023 |
LIPIcs, Volume 164, SoCG 2020, Complete Volume}} S Cabello, DZ Chen, PK Agarwal, HC Chang, S Suri, A Xiao, J Xue, ... 36th International Symposium on Computational Geometry (SoCG 2020) 164, 0, 2020 | | 2020 |