Aditya Anand

Yunfan Wang

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Min-CSPs on Complete Instances.

[BibT_eX]

[DOI]

Amatya Sharma

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Unbreakable Decomposition in Close-to-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs.

[BibT_eX]

[DOI]

Jason Li

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2025

2024

Separating k-Median from the Supplier Version.

[BibT_eX]

[DOI]

CoRR, 2024

Approximating Small Sparse Cuts.

[BibT_eX]

[DOI]

Jason Li

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Separating k -sc Median from the Supplier Version.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2021

Distance restricted manipulation in voting.

[BibT_eX]

[DOI]

Palash Dey

Theor. Comput. Sci., 2021

A Polynomial Kernel for Deletion to Ptolemaic Graphs.

[BibT_eX]

[DOI]

Akanksha Agrawal

Saket Saurabh

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Split: Inferring Unobserved Event Probabilities for Disentangling Brand-Customer Interactions.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Stable Manipulation in Voting.

[BibT_eX]

[DOI]