default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjukta Roy
Person information
- affiliation: Pennsylvania State University, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta:
Gerrymandering Planar Graphs. AAMAS 2024: 463-471- [c21]Hadi Hosseini, Medha Kumar, Sanjukta Roy:
The Degree of Fairness in Efficient House Allocation. ECAI 2024: 3636-3643 - [i14]Hadi Hosseini, Medha Kumar, Sanjukta Roy:
The Degree of Fairness in Efficient House Allocation. CoRR abs/2407.04664 (2024) - [i13]Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta:
Eliminating Majority Illusion is Easy. CoRR abs/2407.20187 (2024) - [i12]Hadi Hosseini, Sanjukta Roy, Duohan Zhang:
Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning. CoRR abs/2410.04376 (2024) - 2023
- [j8]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
, Abhishek Sahu, Saket Saurabh:
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37(4): 2626-2669 (2023) - [c20]Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola:
Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. AAMAS 2023: 251-259 - [c19]Esra Ceylan, Jiehua Chen, Sanjukta Roy:
Optimal Seat Arrangement: What Are the Hard and Easy Cases? IJCAI 2023: 2563-2571 - [c18]Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut:
Degreewidth: A New Parameter for Solving Problems on Tournaments. WG 2023: 246-260 - [c17]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. TARK 2023: 272-286 - [i11]Esra Ceylan, Jiehua Chen, Sanjukta Roy:
Optimal Seat Arrangement: What Are the Hard and Easy Cases? CoRR abs/2305.10381 (2023) - [i10]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. CoRR abs/2312.07632 (2023) - [i9]Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta:
Gerrymandering Planar Graphs. CoRR abs/2312.14721 (2023) - 2022
- [j7]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) - [c16]Jiehua Chen, Sanjukta Roy:
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. ESA 2022: 36:1-36:16 - [c15]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM 2022 - [c14]Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - [c13]Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh:
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS 2022: 39:1-39:20 - [i8]Jiehua Chen, Sanjukta Roy:
Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule. CoRR abs/2202.12006 (2022) - [i7]Jiehua Chen, Gergely Csáj, Sanjukta Roy, Sofia Simola:
Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching. CoRR abs/2203.09655 (2022) - [i6]Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut:
Degreewidth: a New Parameter for Solving Problems on Tournaments. CoRR abs/2212.06007 (2022) - 2021
- [j6]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883: 19-43 (2021) - [c12]Jiehua Chen, Sanjukta Roy, Manuel Sorge:
Fractional Matchings under Preferences: Stability and Optimality. IJCAI 2021: 89-95 - [c11]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155 - [i5]Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR abs/2102.09889 (2021) - [i4]Jiehua Chen, Sanjukta Roy:
Euclidean 3D Stable Roommates is NP-hard. CoRR abs/2108.03868 (2021) - 2020
- [j5]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) - [j4]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82(4): 881-897 (2020) - [c10]Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy:
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS 2020: 366-374 - [c9]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS 2020: 24:1-24:17 - [i3]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR abs/2005.08150 (2020) - [i2]Jiehua Chen, Sanjukta Roy, Manuel Sorge:
Fractional Matchings under Preferences: Stability and Optimality. CoRR abs/2011.12259 (2020)
2010 – 2019
- 2019
- [j3]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica 81(4): 1684-1698 (2019) - [c8]Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS 2019: 511-519 - [c7]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close Is Close Enough? WADS 2019: 423-437 - 2018
- [j2]Sushmita Gupta, Sanjukta Roy:
Stable Matching Games: Manipulation via Subgraph Isomorphism. Algorithmica 80(9): 2551-2573 (2018) - [j1]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) - [c6]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
When Rigging a Tournament, Let Greediness Blind You. IJCAI 2018: 275-281 - [c5]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Winning a Tournament by Any Means Necessary. IJCAI 2018: 282-288 - 2017
- [c4]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms and Kernels for Rainbow Matching. MFCS 2017: 71:1-71:13 - [c3]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Group Activity Selection on Graphs: Parameterized Analysis. SAGT 2017: 106-118 - [i1]Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Balanced Stable Marriage: How Close is Close Enough? CoRR abs/1707.09545 (2017) - 2016
- [c2]Sushmita Gupta, Sanjukta Roy:
Stable Matching Games: Manipulation via Subgraph Isomorphism. FSTTCS 2016: 29:1-29:14 - 2015
- [c1]Sanjukta Roy, Balaraman Ravindran:
Measuring network centrality using hypergraphs. CODS 2015: 59-68
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-13 23:48 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:
