Personal information

Countries

United States

Activities

Collapse all

Education and qualifications (2)

University of California Santa Barbara: Santa Barbara, CA, US

2019-09 to present | PhD (Computer Science)
Education
Source: Self-asserted source
Vaishali Surianarayanan

PSG College of Technology: Coimbatore, Tamil Nadu, IN

2014-06-02 to 2019-05-01 | MSc Theoretical Computer Science (Applied Mathematics and Computational Sciences)
Education
Source: Self-asserted source
Vaishali Surianarayanan

Works (7)

A Parameterized Approximation Scheme for Min $k$-Cut

SIAM Journal on Computing
2024-12 | Journal article
DOI: 10.1137/20M1383197
Contributors: Daniel Lokshtanov; Saket Saurabh; Vaishali Surianarayanan
Source: check_circle
Crossref

Anonymity-Preserving Space Partitions

Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2021 | Journal article
DOI: 10.4230/LIPICS.ISAAC.2021.32
Contributors: Úrsula Hébert-Johnson; Chinmay Sonar; Subhash Suri; Vaishali Surianarayanan
Source: Self-asserted source
Vaishali Surianarayanan

Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable

Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2021 | Journal article
DOI: 10.4230/LIPICS.FSTTCS.2021.29
Contributors: Daniel Lokshtanov; Vaishali Surianarayanan
Source: Self-asserted source
Vaishali Surianarayanan

A Parameterized Approximation Scheme for Min $k$-Cut

2020 | Preprint
DOI: 10.48550/ARXIV.2005.00134
Contributors: Daniel Lokshtanov; Saket Saurabh; Vaishali Surianarayanan
Source: Self-asserted source
Vaishali Surianarayanan

Tractability of König edge deletion problems

Theoretical Computer Science
2019-12 | Journal article
DOI: 10.1016/j.tcs.2019.09.011
Part of ISSN: 0304-3975
Contributors: DIPTAPRIYO MAJUMDAR; Rian Neogi; Venkatesh Raman; S. Vaishali
Source: Self-asserted source
Vaishali Surianarayanan

Efficient Algorithms for a Graph Partitioning Problem

2018 | Book chapter
DOI: 10.1007/978-3-319-78455-7_3
Contributors: S. Vaishali; M. S. Atulya; Nidhi Purohit
Source: check_circle
Crossref

Tractability of Konig Edge Deletion Problems

2018 | Preprint
DOI: 10.48550/ARXIV.1811.04560
Contributors: Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman; S. Vaishali
Source: Self-asserted source
Vaishali Surianarayanan

Peer review (3 reviews for 2 publications/grants)

Review activity for Algorithmica. (2)
Review activity for Mathematical programming. (1)
How many people are using ORCID?