Portrait of Dr. Helena Bergold Dr. Helena Bergold
Portrait of Dr. Helena Bergold

Dr. Helena Bergold

About Me

In 2024, I completed my PhD in the Theoretical Computer Science group at Freie Universität Berlin, supervised by Günter Rote. During my doctoral studies, I was a member of the DFG-funded graduate school Facets of Complexity, through which I also received funding. Additionally, I was a Phase II student at the Berlin Mathematical School (BMS). Before my PhD, I earned my Bachelor's and Master's degrees in Mathematics from the University of Konstanz.

My research interests lie in combinatorial structures and graph drawings. I am particularly fascinated by signotopes - a combinatorial structure which can be visualized by special pseudohyperplane arrangements. Beyond pseudohyperplane arrangements, there are several ways to visualize signotopes. Nice 2- and 3-dimensional visualization can be found here.

Currently, I am working as a software developer at Tablescope, focusing on hybrid game development. Particularly, I develop apps for android and iOS using C# and the Unity game engine.

Publications

  1. Signotopes with few plus signs
    with Lukas Egeling, Hung. P. Hoang
    arXiv:2411.19208 DOI: 10.4230/LIPIcs.SoCG.2025.16
    In Proceedings of 41st International Symposium on Computational Geometry (SoCG 2025), LIPIcs 332, pp. 16:1--16:14, DOI: 10.4230/LIPIcs.SoCG.2025.16
  2. Holes in Convex and Simple Drawings
    with Joachim Orthaber, Manfred Scheucher and Felix Schröder
    arXiv:2409.01723 DOI: 10.7155/jgaa.v29i3.2999 DOI: 10.4230/10.4230/LIPIcs.GD.2024.5
    Journal of Graph Algorithms and Applications, Special issue on Selected papers from the 32nd International Symposium on Graph Drawing and Network Visualization, Vol. 29 No. 3, DOI: 10.7155/jgaa.v29i3.2999 In Proceedings of 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), LIPIcs 320, pp. 5:1-5:9, DOI: 10.4230/LIPIcs.GD.2024.5
  3. Plane Hamiltonian cycles in convex drawings
    with Stefan Felsner, Meghana M. Reddy, Joachim Orthaber and Manfred Scheucher
    arXiv:2403.12898 DOI: 10.1007/s00454-025-00752-3 DOI: 10.4230/LIPIcs.SoCG.2024.18
    Discrete & Computational Geometry, 2025, DOI: 10.1007/s00454-025-00752-3 In Proceedings of 40th International Symposium on Computational Geometry (SoCG 2024), LIPIcs 293, pp. 18:1--18:16, DOI: 10.4230/LIPIcs.SoCG.2024.18
  4. Subgraph-universal planar graphs for trees
    with Vesna Iršič, Robert Lauff, Joachim Orthaber, Manfred Scheucher and Alexandra Wesolek
    arXiv:2409.01678
    In Proceedings of 51st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2025)
  5. An Extension Theorem for Signotopes
    with Stefan Felsner and Manfred Scheucher
    arXiv:2303.04079 supplemental code at github DOI: 10.4230/LIPIcs.2023.17
    To appear in Combinatorial Theory In Proceedings of 39th International Symposium on Computational Geometry (SoCG 2023), LIPIcs 258, pp. 17:1-17:14, DOI: 10.4230/LIPIcs.SoCG.2023.17
  6. Topological Drawings meet Classical Theorems from Convex Geometry
    with Stefan Felsner, Manfred Scheucher, Felix Schröder and Raphael Steiner
    arXiv:2005.12568 DOI: 10.1007/s00454-022-00408-6 DOI: 10.1007/978-3-030-68766-3_22
    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, pp. 281–294, DOI: 10.1007/978-3-030-68766-3_22
  7. Well-Separation and Hyperplane Transversals in High Dimensions
    with Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer and Patrick Schnider
    arXiv:2209.02319 DOI: 10.4230/LIPIcs.SWAT.2022.16
    In Proceedings of 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), LIPIcs 227, pp. 16:1-16:14, DOI: 10.4230/LIPIcs.SWAT.2022.16
    Extended abstract in Proceedings of the 38th European Workshop on Computational (EuroCG 2022).
  8. The Neighborhood Polynomial of Chordal Graphs
    with Winfried Hochstättler and Uwe Mayer
    arXiv:2008.08349 DOI:10.46298/dmtcs.8388 DOI:10.1007/978-3-030-83508-8_12
    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
  9. Colorings of oriented planar graphs avoiding a monochromatic subgraph
    with Winfried Hochstättler and Raphael Steiner
    arXiv:2102.07705 DOI: 10.1016/j.dam.2022.05.015
    Discrete Applied Mathematics, Volume 320, pp. 81-94, 2022. DOI: 10.1016/j.dam.2022.05.015
  10. A Semi-strong Perfect Digraph Theorem
    with Stephan Dominique Andres, Winfried Hochstättler and Johanna Wiehe
    arXiv:1906.05650 DOI: 10.1016/j.akcej.2019.12.018
    AKCE International Journal of Graphs and Combinatorics, 17:3, pp. 992-994, 2020.

Preprints

  • Investigating Simple Drawings of K_n using SAT
    with Manfred Scheucher
    arXiv:2504.02650
  • On Triangular Separation of Bichromatic Point Sets
    with Arun Kumar Das, Robert Lauff, Manfred Scheucher, Felix Schröder and Marie Diana Sieper
    arXiv:2503.05178
  • Finding hardness reductions automatically using SAT solvers
    with Manfred Scheucher and Felix Schröder
    arXiv:2402.06397
  • On the Geometry of Holmsen's Combinatorial Version of the Colorful Carathéodory
    with Winfried Hochstättler
    arXiv:1904.11698

Theses

  • Signotopes and Convex Drawings
    PhD thesis at Freie Universität Berlin, 2023. PDF
  • Hyperbolicity Cones of Elementary Symmetric Polynomials
    Master thesis at University of Konstanz, 2018. PDF
  • Kubisches und Biquadratische Reziprozitätsgesetz (in German)
    Bachelor thesis at University of Konstanz, 2015. PDF