Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! - Anup Bhattacharya; Arijit Bishnu; Gopinath Mishra; Anannya Upasana (ITCS, 2021)

Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. - Pallavi Jain 001; Lawqueen Kanesh; Fahad Panolan; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (SODA, 2023)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. - Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (ICALP, 2024)

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. - Pallavi Jain 001; Lawqueen Kanesh; Fahad Panolan; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (LATIN (2), 2024)

Nonpartisan Feedback Vertex Set. - Nidhi Purohit; Souvik Saha 002; Saket Saurabh 001; Anannya Upasana (CIAC (2), 2025)

Parameterized Complexity of Generalizations of Edge Dominating Set. - Shubhada Aute; Fahad Panolan; Souvik Saha 002; Saket Saurabh 001; Anannya Upasana (SOFSEM (1), 2025)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. - Sushmita Gupta; Pallavi Jain 001; Souvik Saha 002; Saket Saurabh 001; Anannya Upasana (CoRR, 2025)