Sanjukta Roy

Lecturer (Assistant Professor) 

University of Leeds

 Hi, I am a lecturer at the Algorithms and Complexity group in the School of Computing in University of Leeds.


Before, I was a postdoctoral scholar in the College of Information Science and Technology at Penn State University, hosted by Asst. Prof. Hadi Hosseini. Previously, I was a postdoctoral researcher at CTU in Prague, hosted by Assoc. Prof. Dušan Knop and at  TU Wien, Vienna, hosted by Asst. Prof. Jiehua Chen. I received my Ph.D. at the Institute of Mathematical Sciences, Chennai, where my advisor was Prof. Saket Saurabh.


My research interests include Algorithms, Parameterized Algorithms, Computational Social Choice Theory, and Algorithmic Game Theory. 

CV              DBLP             Google Scholar

Selected Publications: (see all)

Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning

with Hadi Hosseini and Duohan Zhang


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

with Jiehua Chen and Esra Ceylan


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

with Jiehua Chen, Gergely Csáji, and Sofia Simola,


Degreewidth: a New Parameter for Solving Problems on Tournaments 

with Tom Davot, Lucas Isenmann, and Jocelyn Thiebaut, 


Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space 

with Jiehua Chen 


Fractional Matchings under Preferences: Stability and Optimality 

with Jiehua Chen and Manuel Sorge 


Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms 

with S. Gupta, P. Jain, S. Saurabh, and M. Zehavi


 When Rigging a Tournament, Let Greediness Blind You  

 Winning a Tournament by Any Means Necessary

with S. Gupta, S. Saurabh, and M. Zehavi


Survey:

Awards: