Sanjukta Roy

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 41

Top Topics

Euclidean Space

Computational Complexity

Subgraph Isomorphism

Top Venues

Theor. Comput. Sci.

Publications

Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
Gerrymandering Planar Graphs. AAMAS (2024)
Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
Eliminating Majority Illusion is Easy. CoRR (2024)
Hadi Hosseini, Medha Kumar, Sanjukta Roy
The Degree of Fairness in Efficient House Allocation. CoRR (2024)
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
Maximizing Social Welfare in Score-Based Social Distance Games. TARK (2023)
Esra Ceylan, Jiehua Chen, Sanjukta Roy
Optimal Seat Arrangement: What Are the Hard and Easy Cases? CoRR (2023)
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
-Closure for FPT Algorithms and Kernels for Domination Problems. SIAM J. Discret. Math. 37 (4) (2023)
Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut
Degreewidth: A New Parameter for Solving Problems on Tournaments. WG (2023)
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)
Esra Ceylan, Jiehua Chen, Sanjukta Roy
Optimal Seat Arrangement: What Are the Hard and Easy Cases? IJCAI (2023)
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
Maximizing Social Welfare in Score-Based Social Distance Games. CoRR (2023)
Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
Gerrymandering Planar Graphs. CoRR (2023)
Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
Gehrlein Stable Committee with Multi-modal Preferences. SAGT (2022)
Jiehua Chen, Sanjukta Roy
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. ESA (2022)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915 (2022)
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS (2022)
Jiehua Chen, Sanjukta Roy
Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule. CoRR (2022)
Jiehua Chen, Gergely Csáj, Sanjukta Roy, Sofia Simola
Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching. CoRR (2022)
Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut
Degreewidth: a New Parameter for Solving Problems on Tournaments. CoRR (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, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR (2021)
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT (2021)
Jiehua Chen, Sanjukta Roy
Euclidean 3D Stable Roommates is NP-hard. CoRR (2021)
Jiehua Chen, Sanjukta Roy, Manuel Sorge
Fractional Matchings under Preferences: Stability and Optimality. IJCAI (2021)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883 (2021)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82 (4) (2020)
Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS (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) (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR (2020)
Jiehua Chen, Sanjukta Roy, Manuel Sorge
Fractional Matchings under Preferences: Stability and Optimality. CoRR (2020)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica 81 (4) (2019)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS (2019)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Balanced Stable Marriage: How Close Is Close Enough? WADS (2019)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Winning a Tournament by Any Means Necessary. IJCAI (2018)
Sushmita Gupta, Sanjukta Roy
Stable Matching Games: Manipulation via Subgraph Isomorphism. Algorithmica 80 (9) (2018)
Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. 723 (2018)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
When Rigging a Tournament, Let Greediness Blind You. IJCAI (2018)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Balanced Stable Marriage: How Close is Close Enough? CoRR (2017)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Group Activity Selection on Graphs: Parameterized Analysis. SAGT (2017)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms and Kernels for Rainbow Matching. MFCS (2017)
Sushmita Gupta, Sanjukta Roy
Stable Matching Games: Manipulation via Subgraph Isomorphism. FSTTCS (2016)
Sanjukta Roy, Balaraman Ravindran
Measuring network centrality using hypergraphs. CODS (2015)