2021
- The Parameterized Complexity of Walk-and-Hit Problems
CIAC 2021.
- Partition Aggregation for Participatory Budgeting
AAMAS 2021.
- Preserving Consistency for Knapsack Voting (Extended Abstract)
AAMAS 2021.
- Parameterized complexity of d-hitting set with Quotas
SOFSEM 2021.
2020
- On the (Parameterized) Complexity of Almost Stable Marriage
FSTTCS 2020.
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
APPROX 2020.
- Participatory Budgeting with Project Interactions
IJCAI 2020.
- Well-Structured Committees
IJCAI 2020.
- Committee Selection with Multimodal Preferences
ECAI 2020.
- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set
Theoretical Computer Science (TCS)
- A preliminary version of the paper appeared in CIAC 2019.
- Quadratic Vertex Kernel for Split Vertex Deletion
Theoretical Computer Science (TCS)
- A preliminary version of the paper appeared in CIAC 2019.
with A. Agrawal, L. Kanesh, and S. Saurabh
Algorithmica.
- A preliminary version of the paper appeared in MFCS 2019.
with S. Gupta, S. Roy, S. Saurabh, and M. Zehavi
Autonomous Agents and Multiagent Systems.
- A preliminary version of the paper appeared in AAMAS 2019.
- Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Theory of Computing Systems (TOCS).
- A preliminary version of the paper appeared in CSR 2018.
2019
with L. Kanesh, W. Lochet, S. Saurabh, and R. Sharma
FSTTCS 2019.
FSTTCS 2019.
2018
with A. Agrawal, L. Kanesh, P. Misra, and S. Saurabh
IPEC 2018.
with A. Agrawal, L. Kanesh, D. Lokshtanov, and S. Saurabh
MFCS 2018.
GECCO 2018 (Companion).
COCOON 2018.
IPEC 2018.
with A. Agrawal, L. Kanesh, D. Lokshtanov, and S. Saurabh
MFCS 2018.
- A Parameterized Runtime Analysis of Randomized Local Search an Algorithm for Max l-Uncut
GECCO 2018 (Companion).
- Hitting and Covering Partially
COCOON 2018.
2017
- Mixed Dominating Set: A Parameterized Perspective
WG 2017.
- List Colouring of Graphs using Genetic Algorithms
SCI 2017.
- Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem
Electronic Notes in Discrete Mathematics.
2016
- On Minimizing Vertex Bisection Using a Memetic Algorithm
Information Sciences
- Minimizing Cyclic Cutwidth of Graphs using a Memetic Algorithm
Journal of Heuristics
- A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem
Journal of Automation, Mobile Robotics & Intelligent Systems
2015
- Branch and Bound Algorithm for Vertex Bisection Minimization Problem
ICACCT 2015.
2014
- Slope number minimization for some classes of graphs
ICMS 2014.