Publications

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

• SIAM Journal on Discrete Mathematics 2023  (a preliminary version appeared in STACS 2022)

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

• Theoretical Computer Science 2022

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

• Theoretical Computer Science 2021 (a preliminary version appeared in WADS 2019)

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

• JAAMAS 2020 (a preliminary version appeared in AAMAS 2019)

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

• Algorithmica 2019

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

• Algorithmica 2019 (a preliminary version appeared in MFCS 2017)

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

• Theoretical Computer Science 2018

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

• Algorithmica 2018 (a preliminary version appeared in  FSTTCS 2016)

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

•  AAAI 2026

10.  Algorithms for Stable Roommate with Externalities with J. Leng

•  ECAI 2025

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

•  CIAC 2025

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

•  AAAI 2025

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

•  AAAI 2025

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

•  NeurIPS 2024

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

•  ECAI 2024

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

• AAMAS 2024

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

• •  TARK 2023

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

• • WG 2023

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

•  IJCAI 2023

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

• •  AAMAS 2023

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

• • ESA 2022

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

• • SAGT 2022

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

• IJCAI 2021

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

• SAGT 2021

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

• FSTTCS 2020

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

•  AAMAS 2020

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

• IJCAI 2018

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

• IJCAI 2018

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

• SAGT 2017

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

• IKDD, CoDS 2015