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

1 |
Explicit Linear Kernels via Dynamic Programming |
Garnero, Valentin et al. |
2014 |

2 |
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) |
Demaine, Erik D. et al. |
2013 |

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

4 |
Contraction checking in graphs on surfaces |
Kaminski, Marcin et al. |
2012 |

5 |
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) |
Fomin, Fedor V. et al. |
2011 |

6 |
Contraction Bidimensionality: the Accurate Picture |
Fomin, Fedor V. et al. |
2010 |

7 |
Approximating Acyclicity Parameters of Sparse Hypergraphs |
Fomin, Fedor V. et al. |
2009 |