Papers
Polynomial Ramsey Bounds and \chi-boundedness for Weakly Closed Graphs
Vaishali Surianarayanan
(under preparation)
Poster presented at Workshop on Modern Techniques in Graph Algorithms 2023 [ Poster ]
Parameterized Complexity for Kidney Exchange Revisited
with Daniel Lokshtanov, Chinmay Sonar, and Úrsula Hébert-Johnson
(under submission)
Parameterized Complexity of Fair Bisection
(FPT-Approximation meets Unbreakability)
with Daniel Lokshtanov, Saket Saurabh, and Tanmay Inamdar
32nd International Symposium on Algorithms and Computation (ESA 2023)
Breaking the All Subsets Barrier for Min-k-Cut
with Daniel Lokshtanov, and Saket Saurabh
50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023) [ Paper ]
Anonymity-Preserving Space Partitions
with Úrsula Hébert-Johnson, Chinmay Sonar, and Subhash Suri
32nd International Symposium on Algorithms and Computation (ISAAC 2021) [ Paper ]
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable
with Daniel Lokshtanov
41st IARCS Annual Conference on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) [ Paper ]
A Parameterized Approximation for Min-k-Cut
with Daniel Lokshtanov, and Saket Saurabh
60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2020) [ Paper ]
Tractability of Konig Edge Deletion Problems
with Diptapriyo Majumdar, Rian Neogi, and Venkatesh Raman
Theoretical Computer Science 2019 - Journal [ Paper ]
Efficient Algorithms for a Graph Partitioning Problem
with Atulya M.S., and Purohit N
12th International Frontiers of Algorithmics Workshop (FAW 2018) [ Paper ]
Vaishali Surianarayanan
(under preparation)
Poster presented at Workshop on Modern Techniques in Graph Algorithms 2023 [ Poster ]
Parameterized Complexity for Kidney Exchange Revisited
with Daniel Lokshtanov, Chinmay Sonar, and Úrsula Hébert-Johnson
(under submission)
Parameterized Complexity of Fair Bisection
(FPT-Approximation meets Unbreakability)
with Daniel Lokshtanov, Saket Saurabh, and Tanmay Inamdar
32nd International Symposium on Algorithms and Computation (ESA 2023)
Breaking the All Subsets Barrier for Min-k-Cut
with Daniel Lokshtanov, and Saket Saurabh
50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023) [ Paper ]
Anonymity-Preserving Space Partitions
with Úrsula Hébert-Johnson, Chinmay Sonar, and Subhash Suri
32nd International Symposium on Algorithms and Computation (ISAAC 2021) [ Paper ]
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable
with Daniel Lokshtanov
41st IARCS Annual Conference on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) [ Paper ]
A Parameterized Approximation for Min-k-Cut
with Daniel Lokshtanov, and Saket Saurabh
60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2020) [ Paper ]
Tractability of Konig Edge Deletion Problems
with Diptapriyo Majumdar, Rian Neogi, and Venkatesh Raman
Theoretical Computer Science 2019 - Journal [ Paper ]
Efficient Algorithms for a Graph Partitioning Problem
with Atulya M.S., and Purohit N
12th International Frontiers of Algorithmics Workshop (FAW 2018) [ Paper ]