Vaishali Surianarayanan

21 papers A* 5A 2B 1Journal 11Unranked 2
YearRankTypeTitle / Venue / Authors
2026 — conf
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs.
SOSA
Ajaykrishnan E. S., Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan
2026 J jnl
Counting hypertriangles through hypergraph orientations.
CoRR
Daniel Paul-Pena, Vaishali Surianarayanan, Deeparnab Chakrabarty, C. Seshadhri
2025 J jnl
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs.
CoRR
Ajaykrishnan E. S., Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan
2025 J jnl
Clustering with Set Outliers and Applications in Relational Clustering.
CoRR
Vaishali Surianarayanan, Neeraj Kumar, Stavros Sintos
2025 J jnl
Clustering with Set Outliers and Applications in Relational Clustering.
Proc. ACM Manag. Data
Vaishali Surianarayanan, Neeraj Kumar, Stavros Sintos
2025 J jnl
Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized.
Proc. ACM Manag. Data
Vaishali Surianarayanan, Anikait Mundhra, Ajaykrishnan E. S., Daniel Lokshtanov
2025 A conf
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms.
ESA
Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan
2025 J jnl
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms.
CoRR
Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan
2025 A* conf
Parameterized Approximation for Capacitated
SODA
Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024 J jnl
A Parameterized Approximation Scheme for Min $k$-Cut.
SIAM J. Comput.
Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2024 A* conf
Efficient Approximation of Fractional Hypertree Width.
FOCS
Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024 J jnl
Efficient Approximation of Fractional Hypertree Width.
CoRR
Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024 J jnl
Parameterized Approximation for Capacitated
CoRR
Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue
2024 A* conf
Parameterized Complexity of Kidney Exchange Revisited.
IJCAI
Úrsula Hébert-Johnson, Daniel Lokshtanov, Chinmay Sonar, Vaishali Surianarayanan
2023 A* conf
Breaking the All Subsets Barrier for Min k-Cut.
ICALP
Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023 A conf
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability).
ESA
Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2023 J jnl
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability.
CoRR
Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2021 B conf
Anonymity-Preserving Space Partitions.
ISAAC
Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan
2021 — conf
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable.
FSTTCS
Daniel Lokshtanov, Vaishali Surianarayanan
2020 A* conf
A Parameterized Approximation Scheme for Min $k$-Cut.
FOCS
Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
2020 J jnl
A Parameterized Approximation Scheme for Min k-Cut.
CoRR
Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan