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

1 |
On Computing the Vertex Connectivity of 1-Plane Graphs |
Biedl, Therese et al. |
2023 |

2 |
Distant Representatives for Rectangles in the Plane |
Biedl, Therese et al. |
2021 |

3 |
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest |
Barr, Sam et al. |
2021 |

4 |
Layered Fan-Planar Graph Drawings |
Biedl, Therese et al. |
2020 |

5 |
Finding Tutte Paths in Linear Time |
Biedl, Therese et al. |
2019 |

6 |
On the Size of Outer-String Representations |
Biedl, Therese et al. |
2018 |

7 |
Rollercoasters and Caterpillars |
Biedl, Therese et al. |
2018 |

8 |
Crossing Number for Graphs with Bounded~Pathwidth |
Biedl, Therese et al. |
2017 |

9 |
On r-Guarding Thin Orthogonal Polygons |
Biedl, Therese et al. |
2016 |

10 |
On Visibility Representations of Non-Planar Graphs |
Biedl, Therese et al. |
2016 |

11 |
1-String B_2-VPG Representation of Planar Graphs |
Biedl, Therese et al. |
2015 |