![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Sushmita Gupta
Institute of Mathematical Sciences, Chennai, India
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 67 matches
- 2024
- Sushmita Gupta, Ramanujan Sridharan, Peter Strulo:
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. AAAI 2024: 9749-9756 - Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. AAMAS 2024: 2659-2667 - Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman:
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. LATIN (1) 2024: 225-240 - Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. CoRR abs/2402.02719 (2024) - Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman:
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. CoRR abs/2402.06407 (2024) - Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. CoRR abs/2402.06538 (2024) - Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Conflict and Fairness in Resource Allocation. CoRR abs/2403.04265 (2024) - Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR abs/2405.15372 (2024) - 2023
- Sushmita Gupta, Pallavi Jain
, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85(12): 3717-3740 (2023) - Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman:
More Effort Towards Multiagent Knapsack. SOFSEM 2023: 47-62 - Sushmita Gupta, Pallavi Jain, Saket Saurabh:
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR abs/2309.04995 (2023) - 2022
- Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. 36(1): 596-681 (2022) - Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915: 74-89 (2022) - Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM 2022 - Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy
, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman:
More Effort Towards Multiagent Knapsack. CoRR abs/2208.02766 (2022) - 2021
- Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883: 19-43 (2021) - Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13(2): 9:1-9:20 (2021) - Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI 2021: 217-223 - Sushmita Gupta, Pallavi Jain, Fahad Panolan
, Sanjukta Roy
, Saket Saurabh:
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh:
Parameterized Complexity of d-Hitting Set with Quotas. SOFSEM 2021: 293-307 - Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR abs/2102.09889 (2021) - 2020
- Sushmita Gupta, Pallavi Jain, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. 34(1): 27 (2020) - Sushmita Gupta, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82(4): 881-897 (2020) - Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. Bull. EATCS 130 (2020) - Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833: 164-172 (2020) - Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy:
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS 2020: 366-374 - Sushmita Gupta, Pallavi Jain, Sanjukta Roy
, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS 2020: 24:1-24:17 - Sushmita Gupta, Pallavi Jain, Saket Saurabh:
Well-Structured Committees. IJCAI 2020: 189-195 - Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR abs/2005.08150 (2020)
skipping 37 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 15:14 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint