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