Journal Publications
Parameterized Approximation Schemes for Biclique-Free Max k-Weight SAT and Max Coverage
with Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
at ACM Transactions on Algorithms
2026
Participatory budgeting with project groups.
with Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
at Journal of Computer and System Sciences
2026
Max-SAT with cardinality constraint parameterized by the number of clauses
with Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
at Theoretical Computer Science
2025
Exact and Approximate Digraph Bandwidth
with Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
at Theoretical Computer Science
2025
Budget-feasible egalitarian allocation of conflicting jobs
with Sushmita Gupta, A. Mohanapriya, Vikash Tripathi
at Autonomous Agents and Multi-Agent Systems
2025
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
with Sushmita Gupta, Saket Saurabh, Nimrod Talmon
at Algorithmica
2023
Scatter search for the minimum leaf spanning tree problem
with Y.S. Kardam, K. Srivastava, R. Marti
at Computers & Operations Research
2022
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
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
Quadratic vertex kernel for split vertex deletion
with Akanksha Agrawal, Sushmita Gupta, R. Krithika
at Theoretical Computer Science, Volume 833
2020
Vertex deletion on split graphs: Beyond 4-hitting set
with Pratibha Choudhary, R. Krithika, Vibha Sahlot
at Theoretical Computer Science, Volume 845
2020
Participatory Budgeting with Project Groups
with Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi
at CoRR
2020
Parameterized Complexity of Conflict-Free Matchings and Paths
with Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh
at MFCS 2019
2019
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
with Gur Saran, Kamal Srivastava
at CoRR
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