Sanjukta Roy

According to our database, Sanjukta Roy authored at least 31 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning.

Hadi Hosseini, Sanjukta Roy, Duohan Zhang

CoRR, 2024

Eliminating Majority Illusion is Easy.

Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta

CoRR, 2024

The Degree of Fairness in Efficient House Allocation.

Hadi Hosseini, Medha Kumar, Sanjukta Roy

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Gerrymandering Planar Graphs.

Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems.

Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh

SIAM J. Discret. Math., December, 2023

Maximizing Social Welfare in Score-Based Social Distance Games.

Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý

Proceedings of the Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, 2023

Degreewidth: A New Parameter for Solving Problems on Tournaments.

Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Optimal Seat Arrangement: What Are the Hard and Easy Cases?

Esra Ceylan, Jiehua Chen, Sanjukta Roy

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity.

Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Resolute control: Forbidding candidates from winning an election is hard.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Theor. Comput. Sci., 2022

Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching.

Jiehua Chen, Gergely Csáj, Sanjukta Roy, Sofia Simola

CoRR, 2022

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule.

Jiehua Chen, Sanjukta Roy

CoRR, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.

Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Gehrlein Stable Committee with Multi-modal Preferences.

Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Parameterized Analysis for the Group Activity Selection Problem on Graphs.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space.

Jiehua Chen, Sanjukta Roy

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Balanced stable marriage: How close is close enough?

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Theor. Comput. Sci., 2021

Euclidean 3D Stable Roommates is NP-hard.

Jiehua Chen, Sanjukta Roy

CoRR, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.

Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Fractional Matchings under Preferences: Stability and Optimality.

Jiehua Chen, Sanjukta Roy, Manuel Sorge

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020

Quadratic Vertex Kernel for Rainbow Matching.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.

Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Auton. Agents Multi Agent Syst., 2020

On the (Parameterized) Complexity of Almost Stable Marriage.

Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Algorithms for Swap and Shift Bribery in Structured Elections.

Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Parameterized Algorithms and Kernels for Rainbow Matching.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Algorithmica, 2019

2018

Parameterized algorithms for stable matching with ties and incomplete lists.

Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Theor. Comput. Sci., 2018

Stable Matching Games: Manipulation via Subgraph Isomorphism.

Sushmita Gupta, Sanjukta Roy

Algorithmica, 2018

Winning a Tournament by Any Means Necessary.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

When Rigging a Tournament, Let Greediness Blind You.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Group Activity Selection on Graphs: Parameterized Analysis.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2015

Measuring network centrality using hypergraphs.

Sanjukta Roy, Balaraman Ravindran

Proceedings of the Second ACM IKDD Conference on Data Sciences, 2015