Sanjukta Roy

Cited by

	All	Since 2019
Citations	181	165
h-index	9	9
i10-index	8	7

20152016201720182019202020212022202320241 1 1 11 15 15 18 47 55 14

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Sushmita GuptaThe Institute of Mathematical Sciences (IMSc)Verified email at imsc.res.in
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Meirav ZehaviBen-Gurion University of the NegevVerified email at bgu.ac.il
Jiehua ChenTU ViennaVerified email at tuwien.ac.at
Pallavi JainIndian Institute of Technology Jodhpur, IndiaVerified email at iitj.ac.in
Deeksha AdilJunior Fellow, Institute for Theoretical Studies, ETH ZurichVerified email at eth-its.ethz.ch
Balaraman RavindranProfessor of Computer Science, Indian Institute of Technology MadrasVerified email at cse.iitm.ac.in
Gergely CsájiEötvös Loránd UniversityVerified email at student.elte.hu
Piotr FaliszewskiAGH University of Science and TechnologyVerified email at agh.edu.pl
Edith ElkindUniversity of OxfordVerified email at cs.ox.ac.uk
Fahad PanolanSchool of Computing, University of LeedsVerified email at leeds.ac.uk
Manuel SorgeTU WienVerified email at ac.tuwien.ac.at
Jayakrishnan MadathilResearch Associate, University of GlasgowVerified email at glasgow.ac.uk
Lawqueen KaneshIndian Institute of Technology Jodhpur, IndiaVerified email at iitj.ac.in
Robert GanianTU WienVerified email at ac.tuwien.ac.at
Dusan KnopCzech Technical University in PragueVerified email at fit.cvut.cz
Šimon SchierreichDepartment of Theoretical Computer Science, Faculty of Information Technology, CTU in PragueVerified email at fit.cvut.cz
Ondra SuchýAssistant Professor of Theoretical Computer Science, Czech Technical UniversityVerified email at fit.cvut.cz
Thekla HammTU WienVerified email at ac.tuwien.ac.at
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu

Sanjukta Roy

School of Computing, University of Leeds

Verified email at leeds.ac.uk - Homepage

Algorithms Computational Social Choice Parameterized Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Measuring network centrality using hypergraphs S Roy, B Ravindran Proceedings of the 2nd ACM IKDD Conference on Data Sciences, 59-68, 2015	22	2015
Parameterized algorithms for stable matching with ties and incomplete lists D Adil, S Gupta, S Roy, S Saurabh, M Zehavi Theoretical Computer Science 723, 1-10, 2018	19	2018
Balanced stable marriage: How close is close enough? S Gupta, S Roy, S Saurabh, M Zehavi Theoretical Computer Science 883, 19-43, 2021	16	2021
When Rigging a Tournament, Let Greediness Blind You. S Gupta, S Roy, S Saurabh, M Zehavi IJCAI, 275-281, 2018	14	2018
On the (parameterized) complexity of almost stable marriage S Gupta, P Jain, S Roy, S Saurabh, M Zehavi arXiv preprint arXiv:2005.08150, 2020	13	2020
Multi-dimensional stable roommates in 2-dimensional Euclidean space J Chen, S Roy arXiv preprint arXiv:2108.03868, 2021	12*	2021
Winning a Tournament by Any Means Necessary. S Gupta, S Roy, S Saurabh, M Zehavi IJCAI, 282-288, 2018	12	2018
Group activity selection on graphs: parameterized analysis S Gupta, S Roy, S Saurabh, M Zehavi International Symposium on Algorithmic Game Theory, 106-118, 2017	10	2017
Gerrymandering on graphs: computational complexity and parameterized algorithms S Gupta, P Jain, F Panolan, S Roy, S Saurabh Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus …, 2021	9	2021
Algorithms for swap and shift bribery in structured elections E Elkind, P Faliszewski, S Gupta, S Roy International Foundation for Autonomous Agents and Multiagent Systems, 2020	9	2020
Parameterized algorithms and kernels for rainbow matching S Gupta, S Roy, S Saurabh, M Zehavi Algorithmica 81, 1684-1698, 2019	7	2019
Resolute control: Forbidding candidates from winning an election is hard S Gupta, S Roy, S Saurabh, M Zehavi Theoretical Computer Science 915, 74-89, 2022	5	2022
Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity J Chen, G Csáji, S Roy, S Simola arXiv preprint arXiv:2203.09655, 2022	5*	2022
Further exploiting c-closure for FPT algorithms and kernels for domination problems L Kanesh, J Madathil, S Roy, A Sahu, S Saurabh 39th International Symposium on Theoretical Aspects of Computer Science …, 2022	5	2022
Fractional matchings under preferences: Stability and optimality J Chen, S Roy, M Sorge arXiv preprint arXiv:2011.12259, 2020	5	2020
Gehrlein stability in committee selection: parameterized hardness and algorithms S Gupta, P Jain, S Roy, S Saurabh, M Zehavi Autonomous Agents and Multi-Agent Systems 34 (1), 27, 2020	5	2020
Stable matching games: manipulation via subgraph isomorphism S Gupta, S Roy Algorithmica 80, 2551-2573, 2018	4	2018
Optimal seat arrangement: what are the hard and easy cases? E Ceylan, J Chen, S Roy arXiv preprint arXiv:2305.10381, 2023	3	2023
Quadratic vertex kernel for rainbow matching S Gupta, S Roy, S Saurabh, M Zehavi Algorithmica 82, 881-897, 2020	3	2020
Maximizing Social Welfare in Score-Based Social Distance Games R Ganian, T Hamm, D Knop, S Roy, Š Schierreich, O Suchý arXiv preprint arXiv:2312.07632, 2023	1	2023

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors