Vaishali Surianarayanan

According to our database, Vaishali Surianarayanan authored at least 10 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Parameterized Approximation for Capacitated <i>d</i>-Hitting Set with Hard Capacities.

Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

A Parameterized Approximation Scheme for Min $k$-Cut.

Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan

SIAM J. Comput., 2024

Parameterized Complexity of Kidney Exchange Revisited.

Úrsula Hébert-Johnson, Daniel Lokshtanov, Chinmay Sonar, Vaishali Surianarayanan

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Efficient Approximation of Fractional Hypertree Width.

Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Breaking the All Subsets Barrier for Min k-Cut.

Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability).

Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2021

Anonymity-Preserving Space Partitions.

Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable.

Daniel Lokshtanov, Vaishali Surianarayanan

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2019

Tractability of König edge deletion problems.

Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali

Theor. Comput. Sci., 2019

2018

Efficient Algorithms for a Graph Partitioning Problem.

S. Vaishali, M. S. Atulya, Nidhi Purohit

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018