default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnannya Upasana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j4]Shubhada Aute, Fahad Panolan
, Souvik Saha, Saket Saurabh, Anannya Upasana:
Parameterized Complexity of Generalizations of Edge Dominating Set. Theory Comput. Syst. 70(3): 43 (2026)- [j3]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Parameterized Approximation Schemes for Biclique-Free Max k-Weight SAT and Max Coverage. ACM Trans. Algorithms 22(1): 3:1-3:30 (2026) - [j2]Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana:
Nonpartisan feedback vertex set. Theor. Comput. Sci. 1084: 116191 (2026) - [c10]Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh, Sanjay Seetharaman, Anannya Upasana:
Dominating Set with Quotas: Balancing Coverage and Constraints. IWOCA 2026: 175-189 - [c9]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana:
Line Cover and Related Problems. STACS 2026: 13:1-13:18 - [i5]Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh, Sanjay Seetharaman, Anannya Upasana:
Dominating Set with Quotas: Balancing Coverage and Constraints. CoRR abs/2604.04912 (2026) - 2025
- [j1]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Max-SAT with cardinality constraint parameterized by the number of clauses. Theor. Comput. Sci. 1056: 115540 (2025) - [c8]Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana:
Nonpartisan Feedback Vertex Set. CIAC (2) 2025: 216-232 - [c7]Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana:
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. IJCAI 2025: 3891-3899 - [c6]Satyabrata Jana, Souvik Saha, Saket Saurabh, Anannya Upasana:
Parameterized Reunion with Achromatic Number. ISAAC 2025: 42:1-42:20 - [c5]Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana:
Parameterized Complexity of Generalizations of Edge Dominating Set. SOFSEM (1) 2025: 65-79 - [i4]Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana:
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. CoRR abs/2505.12699 (2025) - [i3]Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Souvik Saha, Sanjay Seetharaman, Anannya Upasana:
Line Cover and Related Problems. CoRR abs/2512.17268 (2025) - 2024
- [c4]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024: 88:1-88:18 - [c3]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) 2024: 223-237 - [i2]Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. CoRR abs/2403.07328 (2024) - 2023
- [c2]Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. SODA 2023: 3713-3733 - 2021
- [c1]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! ITCS 2021: 15:1-15:19 - 2020
- [i1]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming! CoRR abs/2010.13143 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-08-28 02:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
