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

1 |
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth |
Chalermsook, Parinya et al. |
2023 |

2 |
A Unifying Framework for Characterizing and Computing Width Measures |
Eiben, Eduard et al. |
2022 |

3 |
Parameterised Partially-Predrawn Crossing Number |
Hamm, Thekla et al. |
2022 |

4 |
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width |
Ganian, Robert et al. |
2022 |

5 |
Crossing-Optimal Extension of Simple Drawings |
Ganian, Robert et al. |
2021 |

6 |
Extending Nearly Complete 1-Planar Drawings in Polynomial Time |
Eiben, Eduard et al. |
2020 |

7 |
Extending Partial 1-Planar Drawings |
Eiben, Eduard et al. |
2020 |

8 |
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time |
Hamm, Thekla |
2019 |

9 |
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth |
Eiben, Eduard et al. |
2019 |