Anannya Upasana

According to our database, Anannya Upasana authored at least 11 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Parameterized Approximation Schemes for Biclique-Free Max <i>k</i>-Weight SAT and Max Coverage.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

ACM Trans. Algorithms, January, 2026

Line Cover and Related Problems.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

Dominating Set with Quotas: Balancing Coverage and Constraints.

Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh, Sanjay Seetharaman, Anannya Upasana

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

2025

Parameterized Complexity of Generalizations of Edge Dominating Set.

Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Parameterized Reunion with Achromatic Number.

Satyabrata Jana, Souvik Saha, Saket Saurabh, Anannya Upasana

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules.

Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Nonpartisan Feedback Vertex Set.

Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.

Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2021

Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!

Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021