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

1 |
Backdoors to q-Horn |
Gaspers, Serge et al. |
2013 |

2 |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
Fomin, Fedor V. et al. |
2013 |

3 |
Partially Polynomial Kernels for Set Cover and Test Cover |
Basavaraju, Manu et al. |
2013 |

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 |
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241) |
Fellows, Michael R. et al. |
2012 |

7 |
LP can be a cure for Parameterized Problems |
Narayanaswamy, N.S. et al. |
2012 |

8 |
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs |
Lokshtanov, Daniel et al. |
2012 |

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

10 |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
Dorn, Frederic et al. |
2010 |