default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHelena Bergold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher:
Plane Hamiltonian Cycles in Convex Drawings. SoCG 2024: 18:1-18:16- [i7]Helena Bergold, Manfred Scheucher, Felix Schröder:
Finding hardness reductions automatically using SAT solvers. CoRR abs/2402.06397 (2024) - [i6]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher:
Plane Hamiltonian Cycles in Convex Drawings. CoRR abs/2403.12898 (2024) - 2023
- [j5]Helena Bergold
, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. Discret. Comput. Geom. 70(3): 1121-1143 (2023) - [c4]Helena Bergold, Stefan Felsner, Manfred Scheucher:
An Extension Theorem for Signotopes. SoCG 2023: 17:1-17:14 - [i5]Helena Bergold, Stefan Felsner, Manfred Scheucher:
An extension theorem for signotopes. CoRR abs/2303.04079 (2023) - [i4]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Manfred Scheucher:
Using SAT to study plane Hamiltonian substructures in simple drawings. CoRR abs/2305.09432 (2023) - 2022
- [j4]Helena Bergold, Winfried Hochstättler, Raphael Steiner:
Colorings of oriented planar graphs avoiding a monochromatic subgraph. Discret. Appl. Math. 320: 81-94 (2022) - [j3]Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [c3]Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider:
Well-Separation and Hyperplane Transversals in High Dimensions. SWAT 2022: 16:1-16:14 - [i3]Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider:
Well-Separation and Hyperplane Transversals in High Dimensions. CoRR abs/2209.02319 (2022) - 2021
- [c2]Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. WADS 2021: 158-171 - 2020
- [j2]Stephan Dominique Andres, Helena Bergold, Winfried Hochstättler, Johanna Wiehe:
A semi-strong perfect digraph theorem. AKCE Int. J. Graphs Comb. 17(3): 992-994 (2020) - [c1]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. GD 2020: 281-294 - [i2]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings meet Classical Theorems from Convex Geometry. CoRR abs/2005.12568 (2020) - [i1]Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. CoRR abs/2008.08349 (2020)
2010 – 2019
- 2018
- [j1]Stephan Dominique Andres, Helena Bergold, Raúl M. Falcón:
Autoparatopism stabilized colouring games on rook's graphs. Electron. Notes Discret. Math. 68: 233-238 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-07 19:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
