Measuring network centrality using hypergraphs. - Sanjukta Roy 001; Balaraman Ravindran (CODS, 2015)

Group Activity Selection on Graphs: Parameterized Analysis. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (SAGT, 2017)

When Rigging a Tournament, Let Greediness Blind You. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (IJCAI, 2018)

Winning a Tournament by Any Means Necessary. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (IJCAI, 2018)

Stable Matching Games: Manipulation via Subgraph Isomorphism. - Sushmita Gupta; Sanjukta Roy 001 (Algorithmica, 2018)

Parameterized algorithms for stable matching with ties and incomplete lists. - Deeksha Adil; Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2018)

Parameterized Algorithms and Kernels for Rainbow Matching. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2019)

Algorithms for Swap and Shift Bribery in Structured Elections. - Edith Elkind; Piotr Faliszewski; Sushmita Gupta; Sanjukta Roy 001 (AAMAS, 2020)

On the (Parameterized) Complexity of Almost Stable Marriage. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (FSTTCS, 2020)

Gehrlein stability in committee selection: parameterized hardness and algorithms. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Auton. Agents Multi Agent Syst., 2020)

Quadratic Vertex Kernel for Rainbow Matching. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2020)

Fractional Matchings under Preferences: Stability and Optimality. - Jiehua Chen 001; Sanjukta Roy 001; Manuel Sorge (IJCAI, 2021)

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. - Sushmita Gupta; Pallavi Jain 001; Fahad Panolan; Sanjukta Roy 001; Saket Saurabh 001 (SAGT, 2021)

Euclidean 3D Stable Roommates is NP-hard. - Jiehua Chen 001; Sanjukta Roy 001 (CoRR, 2021)

Balanced stable marriage: How close is close enough? - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2021)

Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. - Jiehua Chen 001; Sanjukta Roy 001 (ESA, 2022)

Parameterized Analysis for the Group Activity Selection Problem on Graphs. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (ISAIM, 2022)

Gehrlein Stable Committee with Multi-modal Preferences. - Sushmita Gupta; Pallavi Jain 001; Daniel Lokshtanov; Sanjukta Roy 001; Saket Saurabh 001 (SAGT, 2022)

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. - Lawqueen Kanesh; Jayakrishnan Madathil; Sanjukta Roy 001; Abhishek Sahu; Saket Saurabh 001 (STACS, 2022)

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule. - Jiehua Chen 001; Sanjukta Roy 001 (CoRR, 2022)

Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching. - Jiehua Chen 001; Gergely Csáji; Sanjukta Roy 001; Sofia Simola (CoRR, 2022)

Resolute control: Forbidding candidates from winning an election is hard. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2022)

Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. - Jiehua Chen 001; Gergely Csáji; Sanjukta Roy 001; Sofia Simola (AAMAS, 2023)

Optimal Seat Arrangement: What Are the Hard and Easy Cases? - Esra Ceylan; Jiehua Chen 001; Sanjukta Roy 001 (IJCAI, 2023)

Degreewidth: A New Parameter for Solving Problems on Tournaments. - Tom Davot; Lucas Isenmann; Sanjukta Roy 001; Jocelyn Thiebaut (WG, 2023)

Maximizing Social Welfare in Score-Based Social Distance Games. - Robert Ganian; Thekla Hamm; Dusan Knop; Sanjukta Roy 001; Simon Schierreich; Ondrej Suchý 001 (TARK, 2023)

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. - Lawqueen Kanesh; Jayakrishnan Madathil; Sanjukta Roy 001; Abhishek Sahu; Saket Saurabh 001 (SIAM J. Discret. Math., 2023)

Gerrymandering Planar Graphs. - Jack Dippel; Max Dupré la Tour; April Niu; Sanjukta Roy 001; Adrian Vetta (AAMAS, 2024)

The Degree of Fairness in Efficient House Allocation. - Hadi Hosseini; Medha Kumar; Sanjukta Roy 001 (ECAI, 2024)

Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning. - Hadi Hosseini; Sanjukta Roy 001; Duohan Zhang (NeurIPS, 2024)

Eliminating Majority Illusion Is Easy. - Jack Dippel; Max Dupré la Tour; April Niu; Sanjukta Roy 001; Adrian Vetta (AAAI, 2025)

Strategyproof Matching of Roommates and Rooms. - Hadi Hosseini; Shivika Narang; Sanjukta Roy 001 (AAAI, 2025)

Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement. - Shashank Chauhan; Tanmay Inamdar 002; Lawqueen Kanesh; Sanjukta Roy 001 (CIAC (2), 2025)

Quantile agent utility and implications to randomized social choice. - Ioannis Caragiannis; Sanjukta Roy 001 (CoRR, 2025)

FPT-Approximability of Stable Matching Problems. - Jiehua Chen 001; Sanjukta Roy 001; Sofia Simola (CoRR, 2025)