No. |
Title |
Author |
Year |
---|

1 |
On the Complexity of Two Dots for Narrow Boards and Few Colors |
Bilò, Davide et al. |
2018 |

2 |
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard |
Dey, Palash et al. |
2017 |

3 |
Saving Critical Nodes with Firefighters is FPT |
Choudhari, Jayesh et al. |
2017 |

4 |
Two Dots is NP-complete |
Misra, Neeldhara |
2016 |

5 |
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets |
Goyal, Prachi et al. |
2013 |

6 |
Hitting forbidden minors: Approximation and Kernelization |
Fomin, Fedor V. et al. |
2011 |

7 |
The effect of girth on the kernelization complexity of Connected Dominating Set |
Misra, Neeldhara et al. |
2010 |