Publications
(Also available at DBLP and Google Scholar.)
by year, by topics, by category
2024
[c20]. Gerrymandering Planar Graphs with J. Dippel, M. D. la Tour, A. Niu, and A. Vetta
AAMAS 2024
2023
[c19]. Maximizing Social Welfare in Score-Based Social Distance Games with R. Ganian, T. Hamm, D. Knop, Š. Schierreich and O. Suchý
TARK 2023
[c18]. Degreewidth: a New Parameter for Solving Problems on Tournaments with T. Davot, L. Isenmann, and J. Thiebaut
WG 2023
[c17]. Optimal Seat Arrangement: What Are the Hard and Easy Cases? with J. Chen and E. Ceylan
IJCAI 2023
[c16]. 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
2022
[c15]. Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space with J. Chen
ESA 2022
[c14]. Gehrlein Stable Committee with Multi-Modal Preferences with S. Gupta, P. Jain, D. Lokshtanov, and S. Saurabh
SAGT 2022
[c13], [j8]. 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
STACS 2022
[j7]. Resolute control: Forbidding candidates from winning an election is hard with S. Gupta, S, Saurabh, and M. Zehavi
Theoretical Computer Science 2022
2021
[c12]. Fractional Matchings under Preferences: Stability and Optimality with J. Chen and M. Sorge
IJCAI 2021
[c11]. Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms with S. Gupta, P. Jain, F. Panolan and S. Saurabh
SAGT 2021
2020
[c10]. On (Parameterized) Complexity of Almost Stable Marriage with S. Gupta, P. Jain, S. Saurabh, and M. Zehavi
FSTTCS 2020
[c9]. Algorithms for Swap and Shift Bribery in Structured Elections with E. Elkind, P. Faliszewski, and S. Gupta
AAMAS 2020
2019
[c8], [j6]. Balanced Stable Marriage: How Close Is Close Enough? with S. Gupta, S. Saurabh, and M. Zehavi
Theoretical Computer Science 2021
WADS 2019
[c7], [j5]. Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms with S. Gupta, P. Jain, S. Saurabh, and M. Zehavi
JAAMAS 2020
AAMAS 2019
[j4]. Quadratic Vertex Kernel for Rainbow Matching with S. Gupta, S. Saurabh, and M. Zehavi
Algorithmica 2019
2018
[c6]. When Rigging a Tournament, Let Greediness Blind You with S. Gupta, S. Saurabh, and M. Zehavi
IJCAI 2018
[c5]. Winning a Tournament by Any Means Necessary with S. Gupta, S. Saurabh, and M. Zehavi
IJCAI 2018
[j2]. Parameterized algorithms for stable matching with ties and incomplete lists with D. Adil, S. Gupta, S. Saurabh, and M. Zehavi
Theoretical Computer Science 2018
2017
[c4], [j3]. Parameterized Algorithms and Kernels for Rainbow Matching with S. Gupta, S. Saurabh, and M. Zehavi
Algorithmica 2019
MFCS 2017
[c3]. Group Activity Selection on Graphs: Parameterized Analysis with S. Gupta, S. Saurabh, and M. Zehavi
SAGT 2017
2016
[c2], [j1]. Stable Matching Games: Manipulation via Subgraph Isomorphism with S. Gupta
Algorithmica 2018
FSTTCS 2016
2015
[c1]. Measuring network centrality using hypergraphs with Balaraman Ravindran
IKDD, CoDS 2015 (Best Student Papaer Award)
Big Data Forum, India, at KDD 2015