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

1 |
Finding Connected Secluded Subgraphs |
Golovach, Petr A. et al. |
2018 |

2 |
On the Tractability of Optimization Problems on H-Graphs |
Fomin, Fedor V. et al. |
2018 |

3 |
Parameterized Aspects of Strong Subgraph Closure |
Golovach, Petr A. et al. |
2018 |

4 |
Parameterized Low-Rank Binary Matrix Approximation |
Fomin, Fedor V. et al. |
2018 |

5 |
Partial Complementation of Graphs |
Fomin, Fedor V. et al. |
2018 |

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

7 |
Structured Connectivity Augmentation |
Fomin, Fedor V. et al. |
2017 |

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

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

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