| No. |
Title |
Author |
Year |
| 1 |
Spartan Bipartite Graphs Are Essentially Elementary |
Misra, Neeldhara et al. |
2023 |
| 2 |
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481) |
Chudnovsky, Maria et al. |
2023 |
| 3 |
Chess Is Hard Even for a Single Player |
Aravind, N.R. et al. |
2022 |
| 4 |
Romeo and Juliet Meeting in Forest like Regions |
Misra, Neeldhara et al. |
2022 |
| 5 |
On the Complexity of Two Dots for Narrow Boards and Few Colors |
Bilò, Davide et al. |
2018 |
| 6 |
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard |
Dey, Palash et al. |
2017 |
| 7 |
Saving Critical Nodes with Firefighters is FPT |
Choudhari, Jayesh et al. |
2017 |
| 8 |
Two Dots is NP-complete |
Misra, Neeldhara |
2016 |
| 9 |
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets |
Goyal, Prachi et al. |
2013 |
| 10 |
Hitting forbidden minors: Approximation and Kernelization |
Fomin, Fedor V. et al. |
2011 |
| 11 |
The effect of girth on the kernelization complexity of Connected Dominating Set |
Misra, Neeldhara et al. |
2010 |
