default search action
Manfred Scheucher
Person information
- affiliation: Technical University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Martin Balko, Manfred Scheucher, Pavel Valtr:
Erdős-Szekeres-Type Problems in the Real Projective Plane. Discret. Comput. Geom. 72(4): 1545-1578 (2024) - [j17]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher
, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber:
Coloring circle arrangements: New 4-chromatic planar graphs. Eur. J. Comb. 121: 103839 (2024) - [c21]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher:
Plane Hamiltonian Cycles in Convex Drawings. SoCG 2024: 18:1-18:16 - [c20]Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher:
An Improved Lower Bound on the Number of Pseudoline Arrangements. SoCG 2024: 43:1-43:18 - [c19]Gábor Damásdi, Zichao Dong, Manfred Scheucher, Ji Zeng:
Saturation Results Around the Erdős-Szekeres Problem. SoCG 2024: 46:1-46:14 - [c18]Helena Bergold, Joachim Orthaber, Manfred Scheucher, Felix Schröder:
Holes in Convex and Simple Drawings. GD 2024: 5:1-5:9 - [c17]Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber:
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. SODA 2024: 4849-4871 - [c16]Marijn J. H. Heule
Happy Ending: An Empty Hexagon in Every Set of 30 Points. TACAS (1) 2024: 61-80 - [i29]Helena Bergold, Manfred Scheucher, Felix Schröder:
Finding hardness reductions automatically using SAT solvers. CoRR abs/2402.06397 (2024) - [i28]Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher:
An Improved Lower Bound on the Number of Pseudoline Arrangements. CoRR abs/2402.13107 (2024) - [i27]Marijn J. H. Heule, Manfred Scheucher:
Happy Ending: An Empty Hexagon in Every Set of 30 Points. CoRR abs/2403.00737 (2024) - [i26]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher:
Plane Hamiltonian Cycles in Convex Drawings. CoRR abs/2403.12898 (2024) - [i25]Helena Bergold, Joachim Orthaber, Manfred Scheucher, Felix Schröder:
Holes in Convex and Simple Drawings. CoRR abs/2409.01723 (2024) - 2023
- [j16]Manfred Scheucher:
A SAT Attack on Erdős-Szekeres Numbers in R^d and the Empty Hexagon Theorem. Comput. Geom. Topol. 2(1): 2:1-2:13 (2023) - [j15]Manfred Scheucher
Many order types on integer grids of polynomial size. Comput. Geom. 109: 101924 (2023) - [j14]Helena Bergold
Topological Drawings Meet Classical Theorems from Convex Geometry. Discret. Comput. Geom. 70(3): 1121-1143 (2023) - [j13]Martin Balko
Tight bounds on the expected number of holes in random point sets. Random Struct. Algorithms 62(1): 29-51 (2023) - [c15]Helena Bergold
An Extension Theorem for Signotopes. SoCG 2023: 17:1-17:14 - [c14]Oswin Aichholzer
Bichromatic Perfect Matchings with Crossings. GD (1) 2023: 124-132 - [c13]Markus Kirchweger, Manfred Scheucher
SAT-Based Generation of Planar Graphs. SAT 2023: 14:1-14:18 - [i24]Helena Bergold, Stefan Felsner, Manfred Scheucher:
An extension theorem for signotopes. CoRR abs/2303.04079 (2023) - [i23]Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano, Manfred Scheucher:
Roudneff's Conjecture in Dimension 4. CoRR abs/2303.14212 (2023) - [i22]Helena Bergold, Stefan Felsner, Meghana M. Reddy, Manfred Scheucher:
Using SAT to study plane Hamiltonian substructures in simple drawings. CoRR abs/2305.09432 (2023) - [i21]Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, Birgit Vogtenhuber:
Bichromatic Perfect Matchings with Crossings. CoRR abs/2309.00546 (2023) - [i20]Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber:
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. CoRR abs/2310.19711 (2023) - 2022
- [j12]Oswin Aichholzer
On crossing-families in planar point sets. Comput. Geom. 107: 101899 (2022) - [j11]Martin Balko
Holes and islands in random point sets. Random Struct. Algorithms 60(3): 308-326 (2022) - [c12]Martin Balko
Erdős-Szekeres-Type Problems in the Real Projective Plane. SoCG 2022: 10:1-10:15 - [c11]Stefan Felsner
Arrangements of Pseudocircles: On Digons and Triangles. GD 2022: 441-455 - [c10]Markus Kirchweger, Manfred Scheucher
A SAT Attack on Rota's Basis Conjecture. SAT 2022: 4:1-4:18 - [i19]Martin Balko
Erdős-Szekeres-type problems in the real projective plane. CoRR abs/2203.07518 (2022) - [i18]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner
Coloring circle arrangements: New 4-chromatic planar graphs. CoRR abs/2205.08181 (2022) - [i17]Stefan Felsner, Sandro Roch, Manfred Scheucher:
Arrangements of Pseudocircles: On Digons and Triangles. CoRR abs/2208.12110 (2022) - [i16]Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber:
Blocking Delaunay Triangulations from the Exterior. CoRR abs/2210.12015 (2022) - 2021
- [j10]Stefan Felsner
Arrangements of Pseudocircles: Triangles and Drawings. Discret. Comput. Geom. 65(1): 261-278 (2021) - [i15]Manfred Scheucher:
A SAT attack on higher dimensional Erdős-Szekeres numbers. CoRR abs/2105.08406 (2021) - [i14]Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr:
On Crossing-Families in Planar Point Sets. CoRR abs/2109.10705 (2021) - [i13]Martin Balko, Manfred Scheucher, Pavel Valtr:
Tight bounds on the expected number of holes in random point sets. CoRR abs/2111.12533 (2021) - 2020
- [j9]Manfred Scheucher
Two disjoint 5-holes in point sets. Comput. Geom. 91: 101670 (2020) - [j8]Stefan Felsner
Arrangements of Pseudocircles: On Circularizability. Discret. Comput. Geom. 64(3): 776-813 (2020) - [j7]Martin Balko
Almost-Equidistant Sets. Graphs Comb. 36(3): 729-754 (2020) - [j6]Oswin Aichholzer
A superlinear lower bound on the number of 5-holes. J. Comb. Theory A 173: 105236 (2020) - [j5]Manfred Scheucher
A Note on Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 24(3): 247-267 (2020) - [j4]Torsten Mütze, Manfred Scheucher
On L-shaped point set embeddings of trees: first non-embeddable examples. J. Graph Algorithms Appl. 24(3): 343-369 (2020) - [j3]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24(4): 551-572 (2020) - [j2]Raphael Steiner
On the Average Complexity of the k-Level. J. Comput. Geom. 11(1): 493-506 (2020) - [c9]Martin Balko
Holes and Islands in Random Point Sets. SoCG 2020: 14:1-14:16 - [c8]Helena Bergold
Topological Drawings Meet Classical Theorems from Convex Geometry. GD 2020: 281-294 - [i12]Martin Balko, Manfred Scheucher, Pavel Valtr:
Holes and islands in random point sets. CoRR abs/2003.00909 (2020) - [i11]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder
Topological Drawings meet Classical Theorems from Convex Geometry. CoRR abs/2005.12568 (2020) - [i10]Manfred Scheucher:
Many Order Types on Integer Grids of Polynomial Size. CoRR abs/2007.15334 (2020)
2010 – 2019
- 2019
- [j1]Karl Däubel, Sven Jäger
On Orthogonal Symmetric Chain Decompositions. Electron. J. Comb. 26(3): 3 (2019) - [c7]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - [c6]Manfred Scheucher
A Note on Universal Point Sets for Planar Graphs. GD 2019: 350-362 - [i9]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. CoRR abs/1908.05124 (2019) - [i8]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr:
On the Average Complexity of the k-Level. CoRR abs/1911.02408 (2019) - 2018
- [c5]Torsten Mütze
On L-Shaped Point Set Embeddings of Trees: First Non-embeddable Examples. GD 2018: 354-360 - [c4]Stefan Felsner
Arrangements of Pseudocircles: On Circularizability. GD 2018: 555-568 - [i7]Manfred Scheucher:
On Disjoint Holes in Point Sets. CoRR abs/1807.10848 (2018) - [i6]Torsten Mütze, Manfred Scheucher:
On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples. CoRR abs/1807.11043 (2018) - [i5]Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher:
On orthogonal symmetric chain decompositions. CoRR abs/1810.09847 (2018) - [i4]Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner:
A Note On Universal Point Sets for Planar Graphs. CoRR abs/1811.06482 (2018) - 2017
- [c3]Oswin Aichholzer
A Superlinear Lower Bound on the Number of 5-Holes. SoCG 2017: 8:1-8:16 - [c2]Stefan Felsner, Manfred Scheucher
Arrangements of Pseudocircles: Triangles and Drawings. GD 2017: 127-139 - [i3]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: Triangles and Drawings. CoRR abs/1708.06449 (2017) - [i2]Stefan Felsner, Manfred Scheucher:
Arrangements of Pseudocircles: On Circularizability. CoRR abs/1712.02149 (2017) - 2016
- [c1]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann
Strongly Monotone Drawings of Planar Graphs. SoCG 2016: 37:1-37:15 - [i1]Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. CoRR abs/1601.01598 (2016)
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-12-15 01:25 CET 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: