Publications
Sparsity in Covering Solutions
with M.S. Rathore
at LATIN 2024
2024
Maximizing Nash Social Welfare under Two-Sided Preferences
with R. Vaish
at AAAI 2024
2024
Controlling Delegations in Liquid Democracy
with S. Heffetz, T. Inamdar, Y. H. More, N. Talmon
at AAMAS 2024
2024
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses
with F. Panolan, L. Kanesh, S. Saha, A. Sahu, S. Saurabh, A. Upasana
at LATIN 2024
2024
Budget-feasible Egalitarian Allocation of Conflicting Jobs
with S. Gupta, A Mohanapriya, V. Tripathi
at AAMAS 2024
2024
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
with T. Inamdar, D. Lokshtanov, A. Sahu, S. Saurabh, A. Upasana
at
2024
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
with T. Inamdar, D. Lokshtanov, A. Sahu, S. Saurabh, A. Upasana
at ICALP 2024
2024
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
with Sushmita Gupta, Saket Saurabh, Nimrod Talmon
at Algorithmica
2023
More Effort Towards Multiagent Knapsack
with S. Gupta, S. Seetharaman
at SOFSEM 2023
2023
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach
with S. Gupta, S. Saurabh
at arxiv
2023
Parameterized Approximation Algorithms for MAX-SAT with Cardinality Constraint and Maximum Coverage
with L. Kanesh, F. Panolan, S. Saha, A. Sahu, S. Saurabh, A. Upasana
at SODA 2023
2023
Preserving Consistency for Liquid Knapsack Voting
with K. Sornat, N. Talmon
at EUMAS 2022
2022
Gehrlein Stable Committee with Multimodal Preferences
with S. Gupta, D. Lokshtanov, S. Roy, and S. Saurabh
at SAGT 2022
2022
Scatter search for the minimum leaf spanning tree problem
with Y.S. Kardam, K. Srivastava, R. Marti
at Computers & Operations Research
2022
Participatory Budgeting with Project Groups
with Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
at IJCAI 2021
2021
Partition Aggregation for Participatory Budgeting
with Nimrod Talmon, Laurent Bulteau
at AAMAS 2021
2021
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
with Spoorthy Gunda, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
at ACM Transactions on Computation Theory, Volume 13
2021
Preserving Consistency for Liquid Knapsack Voting
with Krzysztof Sornat, Nimrod Talmon
at AAMAS 2021
2021
Circumventing Connectivity for Kernelization
with Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma
at CIAC 2021
2021
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms
with Sushmita Gupta, Fahad Panolan, Sanjukta Roy, Saket Saurabh
at SAGT 2021
2021
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
with Sushmita Gupta, Saket Saurabh, Nimrod Talmon
at IJCAI 2021
2021
Parameterized Complexity of d-Hitting Set with Quotas
with Sushmita Gupta, Aditya Petety, Sagar Singh
at SOFSEM 2021
2021
Participatory Budgeting with Project Groups
with Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
at CoRR
2020
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
with Spoorthy Gunda, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
at 24th RANDOM \/ 23rd APPROX 2020
2020
Committee Selection with Multimodal Preferences
with Nimrod Talmon
at ECAI 2020
2020
On the (Parameterized) Complexity of Almost Stable Marriage
with Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
at FSTTCS 2020
2020
Vertex deletion on split graphs: Beyond 4-hitting set
with Pratibha Choudhary, R. Krithika, Vibha Sahlot
at Theoretical Computer Science, Volume 845
2020
Quadratic vertex kernel for split vertex deletion
with Akanksha Agrawal, Sushmita Gupta, R. Krithika
at Theoretical Computer Science, Volume 833
2020
Gehrlein stability in committee selection: parameterized hardness and algorithms
with Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
at Autonomous Agents and Multi-Agent Systems, Volume 34
2020
Parameterized Complexity of Conflict-Free Matchings and Paths
with Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh
at Algorithmica 82
2020
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
with Lawqueen Kanesh, Pranabendu Misra
at Theory of Computing Systems, Volume 64
2020
Participatory Budgeting with Project Interactions
with Krzysztof Sornat, Nimrod Talmon
at IJCAI 2020
2020
Well-Structured Committees
with Sushmita Gupta, Saket Saurabh
at IJCAI 2020
2020
Parameterized Complexity of Conflict-Free Matchings and Paths
with Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh
at MFCS 2019
2019
Exact and Approximate Digraph Bandwidth
with Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
at FSTTCS 2019
2019
Parameterized Complexity of Conflict-Free Matchings and Paths
with Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh
at MFCS 2019
2019
Hitting and Covering Partially
with Akanksha Agrawal, Pratibha Choudhary, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh
at COCOON 2018
2018
A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut
with Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
at GECCO (Companion) 2018
2018
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
with Lawqueen Kanesh, Pranabendu Misra
at CSR 2018
2018
Exploring the Kernelization Borders for Hitting Cycles
with Akanksha Agrawal, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
at IPEC 2018
2018
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy
with Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh
at MFCS 2018
2018
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
with Gur Saran, Kamal Srivastava
at CoRR
2017
Mixed Dominating Set: A Parameterized Perspective
with M. Jayakrishnan, Fahad Panolan, Abhishek Sahu
at WG
2017
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem
with G. Saran, K. Srivastava
at Journal of Automation, Mobile Robotics & Intelligent Systems
2016
Minimizing Cyclic Cutwidth of Graphs using a Memetic Algorithm
with G. Saran, K. Srivastava
at Journal of Heuristics
2016
On Minimizing Vertex Bisection Using a Memetic Algorithm
with G. Saran, K. Srivastava
at Information Sciences
2016
Branch and Bound Algorithm for Vertex Bisection Minimization Problem
with G. Saran, K. Srivastava
at ICACCT 2015
2015
Slope number minimization for some classes of graphs
with G. Saran, K. Srivastava
at ICMS 2014