Efficient Algorithms for a Graph Partitioning Problem. - S. Vaishali 001; M. S. Atulya; Nidhi Purohit (FAW, 2018)

Tractability of König edge deletion problems. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; S. Vaishali 001 (Theor. Comput. Sci., 2019)

Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable. - Daniel Lokshtanov; Vaishali Surianarayanan (FSTTCS, 2021)

Anonymity-Preserving Space Partitions. - Úrsula Hébert-Johnson; Chinmay Sonar; Subhash Suri; Vaishali Surianarayanan (ISAAC, 2021)

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). - Tanmay Inamdar 002; Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan (ESA, 2023)

Breaking the All Subsets Barrier for Min k-Cut. - Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan (ICALP, 2023)

Efficient Approximation of Fractional Hypertree Width. - Viktoriia Korchemna; Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan; Jie Xue 003 (FOCS, 2024)

Parameterized Complexity of Kidney Exchange Revisited. - Úrsula Hébert-Johnson; Daniel Lokshtanov; Chinmay Sonar; Vaishali Surianarayanan (IJCAI, 2024)

A Parameterized Approximation Scheme for Min $k$-Cut. - Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan (SIAM J. Comput., 2024)

Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities. - Daniel Lokshtanov; Abhishek Sahu; Saket Saurabh 001; Vaishali Surianarayanan; Jie Xue 003 (SODA, 2025)

Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized. - Vaishali Surianarayanan; Anikait Mundhra; Ajaykrishnan E. S; Daniel Lokshtanov (Proc. ACM Manag. Data, 2025)