Publications

Optimal Seat Arrangement: What Are the Hard and Easy Cases? with E. Ceylan and J. Chen

1. •  JCSS 2026 ( a preliminary version appeared in IJCAI 2023)

 Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems with L. Kanesh, J. Madathil, A. Sahu, and S. Saurabh

Resolute control: Forbidding candidates from winning an election is hard with S. Gupta, S, Saurabh, and M. Zehavi

Balanced Stable Marriage: How Close Is Close Enough? with S. Gupta, S. Saurabh, and M. Zehavi

 Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms with S. Gupta, P. Jain, S. Saurabh, and M. Zehavi

 Quadratic Vertex Kernel for Rainbow Matching  with S. Gupta, S. Saurabh, and M. Zehavi

 Parameterized Algorithms and Kernels for Rainbow Matching with S. Gupta, S. Saurabh, and M. Zehavi

 Parameterized algorithms for stable matching with ties and incomplete lists with D. Adil, S. Gupta, S. Saurabh, and M. Zehavi

 Stable Matching Games: Manipulation via Subgraph Isomorphism with S. Gupta

Fair Societies: Algorithms for House Allocations with H. Hosseini and A. Sethia

1. •  AAAI 2026

 Algorithms for Stable Roommate with Externalities with J. Leng

1. •  ECAI 2025

  Exact and Parameterized Algorithms for Window Minimization in Bipartite Arrangement with T. Inamdar, and L. Kanesh

1. •  CIAC 2025

 Strategyproof Matching of Roommates and Rooms with H. Hosseini and S. Narang

1. •  AAAI 2025

Eliminating Majority Illusion is Easy with J. Dippel, M. D. la Tour, A. Niu, and A. Vetta

1. •  AAAI 2025

Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning with H. Hosseini and D. Zhang

1. •  NeurIPS 2024

 The Degree of Fairness in Efficient House Allocation with H. Hosseini and M. Kumar

1. •  ECAI 2024

Gerrymandering Planar Graphs with J. Dippel, M. D. la Tour, A. Niu, and A. Vetta

1. • AAMAS 2024

Maximizing Social Welfare in Score-Based Social Distance Games with R. Ganian, T. Hamm, D. Knop, Š. Schierreich and O. Suchý

1. •  TARK 2023

Degreewidth: a New Parameter for Solving Problems on Tournaments with T. Davot, L. Isenmann, and J. Thiebaut

1. • WG 2023

Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity with J. Chen, G. Csáji, and S. Simola

1. •  AAMAS 2023

Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space with  J. Chen 

1. • ESA 2022

Gehrlein Stable Committee with Multi-Modal Preferences with S. Gupta, P. Jain, D. Lokshtanov, and S. Saurabh

1. • SAGT 2022

Fractional Matchings under Preferences: Stability and Optimality with J. Chen and M. Sorge

1. • IJCAI 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms with S. Gupta, P. Jain, F. Panolan and S. Saurabh

1. • SAGT 2021

 On (Parameterized) Complexity of Almost Stable Marriage with S. Gupta, P. Jain, S. Saurabh, and M. Zehavi

1. • FSTTCS 2020

Algorithms for Swap and Shift Bribery in Structured Elections with E. Elkind, P. Faliszewski, and S. Gupta

1. •  AAMAS 2020

 When Rigging a Tournament, Let Greediness Blind You with S. Gupta, S. Saurabh, and M. Zehavi

1. • IJCAI 2018

Winning a Tournament by Any Means Necessary with S. Gupta, S. Saurabh, and M. Zehavi

1. • IJCAI 2018

Group Activity Selection on Graphs: Parameterized Analysis with S. Gupta, S. Saurabh, and M. Zehavi

1. • SAGT 2017

Measuring network centrality using hypergraphs (Best Student Papaer Award) with Balaraman Ravindran

1. • IKDD, CoDS 2015