Sanjukta Roy - RankMe

56 papers A* 8A 8B 7Misc 1Journal 28Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Fair Societies: Algorithms for House Allocations. AAAI Hadi Hosseini, Sanjukta Roy, Aditi Sethia
2026	J	`jnl`	Optimal seat arrangement: What are the hard and easy cases? J. Comput. Syst. Sci. Esra Ceylan, Jiehua Chen, Sanjukta Roy
2025	A	`conf`	Algorithms for Stable Roommate with Externalities. ECAI Jing Leng, Sanjukta Roy
2025	J	`jnl`	Algorithms for Stable Roommate with Externalities. CoRR Jing Leng, Sanjukta Roy
2025	A*	`conf`	Eliminating Majority Illusion Is Easy. AAAI Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2025	—	`conf`	Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement. CIAC (2) Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh, Sanjukta Roy
2025	J	`jnl`	FPT-Approximability of Stable Matching Problems. CoRR Jiehua Chen, Sanjukta Roy, Sofia Simola
2025	J	`jnl`	Fair Societies: Algorithms for House Allocations. CoRR Hadi Hosseini, Sanjukta Roy, Aditi Sethia
2025	J	`jnl`	Quantile agent utility and implications to randomized social choice. CoRR Ioannis Caragiannis, Sanjukta Roy
2025	A*	`conf`	Strategyproof Matching of Roommates and Rooms. AAAI Hadi Hosseini, Shivika Narang, Sanjukta Roy
2024	J	`jnl`	Eliminating Majority Illusion is Easy. CoRR Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2024	A	`conf`	Gerrymandering Planar Graphs. AAMAS Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2024	A*	`conf`	Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning. NeurIPS Hadi Hosseini, Sanjukta Roy, Duohan Zhang
2024	J	`jnl`	Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning. CoRR Hadi Hosseini, Sanjukta Roy, Duohan Zhang
2024	J	`jnl`	Strategyproof Matching of Roommates and Rooms. CoRR Hadi Hosseini, Shivika Narang, Sanjukta Roy
2024	A	`conf`	The Degree of Fairness in Efficient House Allocation. ECAI Hadi Hosseini, Medha Kumar, Sanjukta Roy
2024	J	`jnl`	The Degree of Fairness in Efficient House Allocation. CoRR Hadi Hosseini, Medha Kumar, Sanjukta Roy
2023	B	`conf`	Degreewidth: A New Parameter for Solving Problems on Tournaments. WG Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut
2023	J	`jnl`	Further Exploiting SIAM J. Discret. Math. Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
2023	J	`jnl`	Gerrymandering Planar Graphs. CoRR Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2023	A	`conf`	Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. AAMAS Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola
2023	B	`conf`	Maximizing Social Welfare in Score-Based Social Distance Games. TARK Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023	J	`jnl`	Maximizing Social Welfare in Score-Based Social Distance Games. CoRR Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
2023	A*	`conf`	Optimal Seat Arrangement: What Are the Hard and Easy Cases? IJCAI Esra Ceylan, Jiehua Chen, Sanjukta Roy
2023	J	`jnl`	Optimal Seat Arrangement: What Are the Hard and Easy Cases? CoRR Esra Ceylan, Jiehua Chen, Sanjukta Roy
2022	J	`jnl`	Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching. CoRR Jiehua Chen, Gergely Csáji, Sanjukta Roy, Sofia Simola
2022	J	`jnl`	Degreewidth: a New Parameter for Solving Problems on Tournaments. CoRR Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut
2022	A	`conf`	Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. STACS Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
2022	B	`conf`	Gehrlein Stable Committee with Multi-modal Preferences. SAGT Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
2022	A	`conf`	Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. ESA Jiehua Chen, Sanjukta Roy
2022	Misc	`conf`	Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule. CoRR Jiehua Chen, Sanjukta Roy
2022	J	`jnl`	Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Balanced stable marriage: How close is close enough? Theor. Comput. Sci. Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Euclidean 3D Stable Roommates is NP-hard. CoRR Jiehua Chen, Sanjukta Roy
2021	A*	`conf`	Fractional Matchings under Preferences: Stability and Optimality. IJCAI Jiehua Chen, Sanjukta Roy, Manuel Sorge
2021	B	`conf`	Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021	J	`jnl`	Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2020	A	`conf`	Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy
2020	J	`jnl`	Fractional Matchings under Preferences: Stability and Optimality. CoRR Jiehua Chen, Sanjukta Roy, Manuel Sorge
2020	J	`jnl`	Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	On the (Parameterized) Complexity of Almost Stable Marriage. CoRR Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Quadratic Vertex Kernel for Rainbow Matching. Algorithmica Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	B	`conf`	Balanced Stable Marriage: How Close Is Close Enough? WADS Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	A	`conf`	Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Stable Matching Games: Manipulation via Subgraph Isomorphism. Algorithmica Sushmita Gupta, Sanjukta Roy
2018	A*	`conf`	When Rigging a Tournament, Let Greediness Blind You. IJCAI Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018	A*	`conf`	Winning a Tournament by Any Means Necessary. IJCAI Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Balanced Stable Marriage: How Close is Close Enough? CoRR Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Group Activity Selection on Graphs: Parameterized Analysis. SAGT Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017	B	`conf`	Parameterized Algorithms and Kernels for Rainbow Matching. MFCS Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2016	—	`conf`	Stable Matching Games: Manipulation via Subgraph Isomorphism. FSTTCS Sushmita Gupta, Sanjukta Roy
2015	—	`conf`	Measuring network centrality using hypergraphs. CODS Sanjukta Roy, Balaraman Ravindran