Helena Bergold

Orcid: 0000-0002-9622-8936

According to our database1, Helena Bergold authored at least 12 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding hardness reductions automatically using SAT solvers.
CoRR, 2024

Holes in Convex and Simple Drawings.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Plane Hamiltonian Cycles in Convex Drawings.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Topological Drawings Meet Classical Theorems from Convex Geometry.
Discret. Comput. Geom., October, 2023

Signotopes and Convex Drawings (Signotope und konvexe Zeichnungen)
PhD thesis, 2023

Using SAT to study plane Hamiltonian substructures in simple drawings.
CoRR, 2023

An Extension Theorem for Signotopes.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
The Neighborhood Polynomial of Chordal Graphs.
Discret. Math. Theor. Comput. Sci., 2022

Colorings of oriented planar graphs avoiding a monochromatic subgraph.
Discret. Appl. Math., 2022

Well-Separation and Hyperplane Transversals in High Dimensions.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2020
A semi-strong perfect digraph theorem.
AKCE Int. J. Graphs Comb., 2020

2018
Autoparatopism stabilized colouring games on rook's graphs.
Electron. Notes Discret. Math., 2018


  Loading...