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

1 |
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs |
Johnson, Matthew et al. |
2023 |

2 |
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth |
Bergougnoux, Benjamin et al. |
2023 |

3 |
Parameterized Complexity of Streaming Diameter and Connectivity Problems |
Oostveen, Jelle J. et al. |
2022 |

4 |
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes |
Lima, Paloma T. et al. |
2020 |

5 |
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs |
Jansen, Bart M. P. et al. |
2019 |

6 |
On Geometric Set Cover for Orthants |
Bringmann, Karl et al. |
2019 |

7 |
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs |
NovotnÃ¡, Jana et al. |
2019 |

8 |
Disconnected Cuts in Claw-free Graphs |
Martin, Barnaby et al. |
2018 |

9 |
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs |
Pilipczuk, Michal et al. |
2018 |

10 |
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs |
Heggernes, Pinar et al. |
2018 |

11 |
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around |
Kanj, Iyad et al. |
2018 |

12 |
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking |
Pilipczuk, Michal et al. |
2017 |

13 |
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs |
Mnich, Matthias et al. |
2016 |

14 |
Parameterized Complexity Dichotomy for Steiner Multicut |
Bringmann, Karl et al. |
2015 |

15 |
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs |
Pilipczuk, Marcin et al. |
2013 |