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

1 |
B-Chromatic Number: Beyond NP-Hardness |
Panolan, Fahad et al. |
2015 |

2 |
Finding Even Subgraphs Even Faster |
Goyal, Prachi et al. |
2015 |

3 |
Vertex Exponential Algorithms for Connected f-Factors |
Philip, Geevarghese et al. |
2014 |

4 |
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound |
Crowston, Robert et al. |
2013 |

5 |
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound |
Mnich, Matthias et al. |
2012 |

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

7 |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation |
Fomin, Fedor V. et al. |
2011 |

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