A Parameterized Approximation Scheme for Min -Cut D Lokshtanov, S Saurabh, V Surianarayanan SIAM Journal on Computing, FOCS20-205-FOCS20-238, 2022 | 28 | 2022 |
Dominating set in weakly closed graphs is fixed parameter tractable D Lokshtanov, V Surianarayanan 41st IARCS Annual Conference on Foundations of Software Technology and …, 2021 | 7 | 2021 |
Efficient algorithms for a graph partitioning problem S Vaishali, MS Atulya, N Purohit International Workshop on Frontiers in Algorithmics, 29-42, 2018 | 6 | 2018 |
Tractability of König edge deletion problems D Majumdar, R Neogi, V Raman, S Vaishali Theoretical Computer Science 796, 207-215, 2019 | 2 | 2019 |
Breaking the all subsets barrier for min k-cut D Lokshtanov, S Saurabh, V Surianarayanan 50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023 | 1 | 2023 |
Anonymity-preserving space partitions Ú Hébert-Johnson, C Sonar, S Suri, V Surianarayanan 32nd International Symposium on Algorithms and Computation (ISAAC 2021), 2021 | 1 | 2021 |
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability T Inamdar, D Lokshtanov, S Saurabh, V Surianarayanan arXiv preprint arXiv:2308.10657, 2023 | | 2023 |