default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSushmita Gupta
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Sushmita Gupta, Ramanujan Sridharan, Peter Strulo:
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. AAAI 2024: 9749-9756- [c30]Sushmita Gupta, Pallavi Jain:
Manipulation With(out) Money in Matching Market. ADT 2024: 273-287 - [c29]Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. AAMAS 2024: 2659-2667 - [c28]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 - [i17]Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi:
Budget-feasible Egalitarian Allocation of Conflicting Jobs. CoRR abs/2402.02719 (2024) - [i16]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) - [i15]Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. CoRR abs/2402.06538 (2024) - [i14]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) - [i13]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) - [i12]Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo:
On Controlling Knockout Tournaments Without Perfect Information. CoRR abs/2408.15068 (2024) - 2023
- [j17]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) - [c27]Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman:
More Effort Towards Multiagent Knapsack. SOFSEM 2023: 47-62 - [i11]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
- [j16]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) - [j15]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) - [c26]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM 2022 - [c25]Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - [i10]Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman:
More Effort Towards Multiagent Knapsack. CoRR abs/2208.02766 (2022) - 2021
- [j14]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883: 19-43 (2021) - [j13]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) - [c24]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 - [c23]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - [c22]Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh:
Parameterized Complexity of d-Hitting Set with Quotas. SOFSEM 2021: 293-307 - [i9]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR abs/2102.09889 (2021) - 2020
- [j12]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) - [j11]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82(4): 881-897 (2020) - [j10]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. Bull. EATCS 130 (2020) - [j9]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833: 164-172 (2020) - [c21]Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy:
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS 2020: 366-374 - [c20]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS 2020: 24:1-24:17 - [c19]Sushmita Gupta, Pallavi Jain, Saket Saurabh:
Well-Structured Committees. IJCAI 2020: 189-195 - [i8]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR abs/2005.08150 (2020)
2010 – 2019
- 2019
- [j8]Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Stability in barter exchange markets. Auton. Agents Multi Agent Syst. 33(5): 518-539 (2019) - [j7]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica 81(4): 1684-1698 (2019) - [c18]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS 2019: 511-519 - [c17]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika:
Quadratic Vertex Kernel for Split Vertex Deletion. CIAC 2019: 1-12 - [c16]Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi:
On Succinct Encodings for the Tournament Fixing Problem. IJCAI 2019: 322-328 - [c15]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. SODA 2019: 2810-2822 - [c14]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close Is Close Enough? WADS 2019: 423-437 - 2018
- [j6]Sushmita Gupta, Sanjukta Roy:
Stable Matching Games: Manipulation via Subgraph Isomorphism. Algorithmica 80(9): 2551-2573 (2018) - [j5]Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. 723: 1-10 (2018) - [c13]Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Stability in Barter Exchange Markets. AAMAS 2018: 1371-1379 - [c12]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
When Rigging a Tournament, Let Greediness Blind You. IJCAI 2018: 275-281 - [c11]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Winning a Tournament by Any Means Necessary. IJCAI 2018: 282-288 - [i7]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. CoRR abs/1803.09370 (2018) - 2017
- [c10]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms and Kernels for Rainbow Matching. MFCS 2017: 71:1-71:13 - [c9]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Group Activity Selection on Graphs: Parameterized Analysis. SAGT 2017: 106-118 - [i6]Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage. CoRR abs/1707.05404 (2017) - [i5]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close is Close Enough? CoRR abs/1707.09545 (2017) - 2016
- [j4]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On the Advice Complexity of the k-server Problem Under Sparse Metrics. Theory Comput. Syst. 59(3): 476-499 (2016) - [c8]Sushmita Gupta, Sanjukta Roy:
Stable Matching Games: Manipulation via Subgraph Isomorphism. FSTTCS 2016: 29:1-29:14 - [c7]Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma:
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC 2016: 2:1-2:14 - [c6]Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki:
Total Stability in Stable Matching Games. SWAT 2016: 23:1-23:12 - 2015
- [j3]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative interval analysis of paging algorithms on access graphs. Theor. Comput. Sci. 568: 28-48 (2015) - [i4]Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki:
Stable Nash Equilibria in the Gale-Shapley Matching Game. CoRR abs/1509.04344 (2015) - 2013
- [c5]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On Advice Complexity of the k-server Problem under Sparse Metrics. SIROCCO 2013: 55-67 - [c4]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative Interval Analysis of Paging Algorithms on Access Graphs. WADS 2013: 195-206 - [i3]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Relative Interval Analysis of Paging Algorithms on Access Graphs. CoRR abs/1305.0669 (2013) - [i2]Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz:
On Advice Complexity of the k-server Problem under Sparse Metrics. CoRR abs/1305.2108 (2013) - 2012
- [j2]Sushmita Gupta, Venkatesh Raman, Saket Saurabh:
Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. SIAM J. Discret. Math. 26(4): 1758-1780 (2012) - [c3]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. SWAT 2012: 328-339 - [i1]Joan Boyar, Sushmita Gupta, Kim S. Larsen:
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. CoRR abs/1204.4047 (2012)
2000 – 2009
- 2008
- [j1]Sushmita Gupta:
Feedback arc set problem in bipartite tournaments. Inf. Process. Lett. 105(4): 150-154 (2008) - 2007
- [c2]Sushmita Gupta:
Feedback Arc Set Problem in Bipartite Tournaments. TAMC 2007: 354-361 - 2006
- [c1]Sushmita Gupta, Venkatesh Raman, Saket Saurabh:
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. FSTTCS 2006: 139-151
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 2024-11-04 21:42 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
