Helena Bergold

Arbeitsgruppe Theoretische Informatik
Institut für Informatik
Fachbereich Mathematik und Informatik
Freie Universität Berlin
Takustraße 9
14195 Berlin

Email: firstname.lastname@fu-berlin.de

About Me

I am a PhD student in the theoretical computer science group at Freie Universität Berlin supervised by Günter Rote. I am part of the Graduate School Facets of Complexity funded by DFG. Before I did my Bachelor and Master degree in mathematics at the University of Konstanz.

My research interests are combinatorial structures and drawings of graphs. I am particularly interested in signotopes. Besides pseudohyperplane arrangements there are several possibilities to visualize signotopes. A comparison of some examples can be found here.

Publications

  1. Plane Hamiltonian cycles in convex drawings
    with Stefan Felsner, Meghana M. Reddy, Joachim Orthaber and Manfred Scheucher
    To appear in Proceedings of 40th International Symposium on Computational Geometry (SoCG 2024)
  2. An Extension Theorem for Signotopes
    with Stefan Felsner and Manfred Scheucher
    In Proceedings of 39th International Symposium on Computational Geometry (SoCG 2023), LIPIcs 258, 17:1-17:14, DOI: 10.4230/LIPIcs.SoCG.2023.17
    Extended abstract in Proceedings of the 38th European Workshop on Computational (EuroCG 2022).
    arXiv:2303.04079; supplemental code
  3. Topological Drawings meet Classical Theorems from Convex Geometry
    with Stefan Felsner, Manfred Scheucher, Felix Schröder and Raphael Steiner
    Discrete & Computational Geometry, 2022, DOI: 10.1007/s00454-022-00408-6
    In Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020), LNCS 12590, pages 281–294, DOI: 10.1007/978-3-030-68766-3_22
    Extended abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG 2020).
    Open access: arXiv:2005.12568
  4. Well-Separation and Hyperplane Transversals in High Dimensions
    with Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer and Patrick Schnider
    In Proceedings of 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), LIPIcs 227, 16:1-16:14, DOI: 10.4230/LIPIcs.SWAT.2022.16
    Extended abstract in Proceedings of the 38th European Workshop on Computational (EuroCG 2022).
    arXiv:2209.02319
  5. The Neighborhood Polynomial of Chordal Graphs
    with Winfried Hochstättler and Uwe Mayer
    Discrete Mathematics & Theoretical Computer Science, volume 24(1), dmtcs:8388, 2022. DOI:10.46298/dmtcs.8388
    In Proceedings of the 17th Algorithms and Data Structures Symposium (WADS 2021), LNCS 12808, Springer. DOI:10.1007/978-3-030-83508-8_12
    arXiv:2008.08349
  6. Colorings of oriented planar graphs avoiding a monochromatic subgraph
    with Winfried Hochstättler and Raphael Steiner
    Discrete Applied Mathematics, Volume 320, pages 81-94, 2022. DOI:10.1016/j.dam.2022.05.015
    Open access: arXiv:2102.07705
  7. A Semi-strong Perfect Digraph Theorem
    with Stephan Dominique Andres, Winfried Hochstättler and Johanna Wiehe
    AKCE International Journal of Graphs and Combinatorics, 17:3, pages 992-994, 2020.
    DOI:10.1016/j.akcej.2019.12.018
    arXiv:1906.05650

Preprints

Theses