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

1 |
Covering Vectors by Spaces: Regular Matroids |
Fomin, Fedor V. et al. |
2017 |

2 |
A Linear Kernel for Finding Square Roots of Almost Planar Graphs |
Golovach, Petr A. et al. |
2016 |

3 |
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality |
Golovach, Petr A. et al. |
2015 |

4 |
Parameterized Complexity of Secluded Connectivity Problems |
Fomin, Fedor V. et al. |
2015 |

5 |
Variants of Plane Diameter Completion |
Golovach, Petr A. et al. |
2015 |

6 |
Connecting Vertices by Independent Trees |
Basavaraju, Manu et al. |
2014 |

7 |
Editing to Eulerian Graphs |
Dabrowski, Konrad K. et al. |
2014 |

8 |
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs |
Chitnis, Rajesh et al. |
2013 |

9 |
Parameterized Complexity of Connected Even/Odd Subgraph Problems |
Fomin, Fedor V. et al. |
2012 |

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