Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Vaishali Surianarayanan
Observed names:
S. Vaishali,
Surianarayanan, Vaishali
Institutions:
University of California, Santa Cruz,
University of California System,
Yale University
Observed institutions:
University of California, Santa Barbara,
National Institute of Science Education and Research,
University of California, Santa Cruz,
Homi Bhabha National Institute,
University of California System,
Yale University,
PSG College of Technology
show all 7
ORCID:
0000-0003-3091-3823
Observed ORCID:
0000-0003-3091-3823
OpenAlex ID:
A5072972143
A Parameterized Approximation Scheme for Min $k$-Cut
2020
·
Daniel Lokshtanov
, Saket Saurabh
, et al.
·
Annual Symposium on Foundations of Computer Science
·
36
A Parameterized Approximation Scheme for Min $k$-Cut
2022
·
Daniel Lokshtanov
, Saket Saurabh
, et al.
·
SIAM Journal on Computing
·
17
PDF
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)
2023
·
Inamdar, Tanmay
, Lokshtanov, Daniel
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
14
PDF
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable
2021
·
Lokshtanov, Daniel
, Surianarayanan, Vaishali
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
10
PDF
Efficient Approximation of Fractional Hypertree Width
2024
·
Viktoriia Korchemna
, Daniel Lokshtanov
, et al.
·
Annual Symposium on Foundations of Computer Science
·
7
PDF
Parameterized Complexity of Kidney Exchange Revisited
2024
·
Úrsula Hébert-Johnson
, Daniel Lokshtanov
, et al.
·
International Joint Conference on Artificial Intelligence
·
7
PDF
Parameterized Approximation for Capacitated d -Hitting Set with Hard Capacities
2025
·
Daniel Lokshtanov
, Abhishek Sahu
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
6
PDF
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
2026
·
Ajaykrishnan E S
, Robert Ganian
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
5
PDF
Clustering with Set Outliers and Applications in Relational Clustering
2025
·
Vaishali Surianarayanan
, Neeraj Kumar
, et al.
·
Proceedings of the ACM on Management of Data
·
3
PDF
Breaking the All Subsets Barrier for Min k-Cut
2023
·
Lokshtanov, Daniel
, Saurabh, Saket
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
Circle Graph 3-Coloring: Experimental Code
2026
·
Robert Ganian
, Philipp Mauve
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
Counting Hypertriangles through Hypergraph Orientations
2026
·
Paul-Pena, Daniel
, Surianarayanan, Vaishali
, et al.
·
arXiv (Cornell University)
·
2
PDF
Tractability of König edge deletion problems
2019
·
Diptapriyo Majumdar
, Rian Neogi
, et al.
·
Theoretical Computer Science
·
2
How to Fix a Broken Metric: A Linear Kernel, Tight Bounds, and Tree Metrics
2026
·
Bandyapadhyay, Sayan
, Lochet, William
, et al.
·
arXiv (Cornell University)
·
1
PDF
Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized
2025
·
Vaishali Surianarayanan
, Anikait Mundhra
, et al.
·
Proceedings of the ACM on Management of Data
·
1
PDF
Circle Graph 3-Coloring: Can Simplicity Beat SAT?
2026
·
Ganian, Robert
, Mauve, Philipp
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Anonymity-Preserving Space Partitions
2021
·
Hébert-Johnson, Úrsula
, Sonar, Chinmay
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Show more works
View as search
Works count:
19
Citation count:
122
H-index:
6
I10-index:
4
Year
Topic
Type