default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVaishali Surianarayanan
Person information
- affiliation: University of California Santa Barbara, CA, USA
Other persons with the same name
- S. Vaishali 0002 — Vaagdevi College of Engineering, Warangal, Telangana, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j1]Diptapriyo Majumdar
, Rian Neogi, Venkatesh Raman, S. Vaishali:
Tractability of König edge deletion problems. Theor. Comput. Sci. 796: 207-215 (2019)
Conference and Workshop Papers
- 2024
- [c7]Úrsula Hébert-Johnson, Daniel Lokshtanov, Chinmay Sonar, Vaishali Surianarayanan:
Parameterized Complexity of Kidney Exchange Revisited. IJCAI 2024: 76-84 - 2023
- [c6]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). ESA 2023: 63:1-63:17 - [c5]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Breaking the All Subsets Barrier for Min k-Cut. ICALP 2023: 90:1-90:19 - 2021
- [c4]Daniel Lokshtanov, Vaishali Surianarayanan:
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable. FSTTCS 2021: 29:1-29:17 - [c3]Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan:
Anonymity-Preserving Space Partitions. ISAAC 2021: 32:1-32:16 - 2020
- [c2]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
A Parameterized Approximation Scheme for Min $k$-Cut. FOCS 2020: 798-809 - 2018
- [c1]S. Vaishali, M. S. Atulya, Nidhi Purohit:
Efficient Algorithms for a Graph Partitioning Problem. FAW 2018: 29-42
Informal and Other Publications
- 2024
- [i4]Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue:
Efficient Approximation of Fractional Hypertree Width. CoRR abs/2409.20172 (2024) - 2023
- [i3]Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability. CoRR abs/2308.10657 (2023) - 2020
- [i2]Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
A Parameterized Approximation Scheme for Min k-Cut. CoRR abs/2005.00134 (2020) - 2018
- [i1]Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S. Vaishali:
Tractability of Konig Edge Deletion Problems. CoRR abs/1811.04560 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
