| No. | Title | Author | Year |
|---|---|---|---|
| 1 | A Unifying Framework for Characterizing and Computing Width Measures | Eiben, Eduard et al. | 2022 |
| 2 | Parameterised Partially-Predrawn Crossing Number | Hamm, Thekla et al. | 2022 |
| 3 | The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width | Ganian, Robert et al. | 2022 |
| 4 | Crossing-Optimal Extension of Simple Drawings | Ganian, Robert et al. | 2021 |
| 5 | Extending Nearly Complete 1-Planar Drawings in Polynomial Time | Eiben, Eduard et al. | 2020 |
| 6 | Extending Partial 1-Planar Drawings | Eiben, Eduard et al. | 2020 |
| 7 | Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time | Hamm, Thekla | 2019 |
| 8 | Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth | Eiben, Eduard et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |