NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (35)

cs.CG2026

Holes in Convex and Simple Drawings

Helena Bergold, Joachim Orthaber, Manfred Scheucher +1

math.CO2023

An extension theorem for signotopes

Helena Bergold, Stefan Felsner, Manfred Scheucher

cs.CG2025

On Triangular Separation of Bichromatic Point Sets

Helena Bergold, Arun Kumar Das, Robert Lauff +3

cs.CG2021

Many Order Types on Integer Grids of Polynomial Size

Manfred Scheucher

math.CO2024

An Improved Lower Bound on the Number of Pseudoline Arrangements

Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner +1

cs.CG2022

A SAT attack on higher dimensional Erdős--Szekeres numbers

Manfred Scheucher

math.CO2024

Topological Drawings meet Classical Theorems from Convex Geometry

Helena Bergold, Stefan Felsner, Manfred Scheucher +2

cs.CG2023

Using SAT to study plane Hamiltonian substructures in simple drawings

Helena Bergold, Stefan Felsner, Meghana M. Reddy +1

math.CO2024

Subgraph-universal planar graphs for trees

Helena Bergold, Vesna Iršič, Robert Lauff +3

cs.CG2023

Bichromatic Perfect Matchings with Crossings

Oswin Aichholzer, Stefan Felsner, Rosna Paul +2

cs.CG2020

Arrangements of Pseudocircles: Triangles and Drawings

Stefan Felsner, Manfred Scheucher

math.CO2020

Two Disjoint 5-Holes in Point Sets

Manfred Scheucher

cs.CG2020

Arrangements of Pseudocircles: On Circularizability

Stefan Felsner, Manfred Scheucher

math.CO2020

A superlinear lower bound on the number of 5-holes

Oswin Aichholzer, Martin Balko, Thomas Hackl +5

math.CO2022

Coloring circle arrangements: New $4$-chromatic planar graphs

Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3

math.CO2022

Tight bounds on the expected number of holes in random point sets

Martin Balko, Manfred Scheucher, Pavel Valtr

math.CO2019

A Note On Universal Point Sets for Planar Graphs

Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner

math.CO2025

Saturation results around the Erdős--Szekeres problem

Gábor Damásdi, Zichao Dong, Manfred Scheucher +1

cs.CG2024

Happy Ending: An Empty Hexagon in Every Set of 30 Points

Marijn J. H. Heule, Manfred Scheucher

math.CO2019

On orthogonal symmetric chain decompositions

Karl Däubel, Sven Jäger, Torsten Mütze +1

cs.CG2022

Blocking Delaunay Triangulations from the Exterior

Oswin Aichholzer, Thomas Hackl, Maarten Löffler +4

cs.CG2026

Plane Hamiltonian Cycles in Convex Drawings

Helena Bergold, Stefan Felsner, Meghana M. Reddy +2

cs.CC2024

Finding hardness reductions automatically using SAT solvers

Helena Bergold, Manfred Scheucher, Felix Schröder

cs.CG2020

On the Average Complexity of the $k$-Level

Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3

math.CO2022

Holes and islands in random point sets

Martin Balko, Manfred Scheucher, Pavel Valtr

cs.CG2020

On L-shaped point set embeddings of trees: first non-embeddable examples

Torsten Mütze, Manfred Scheucher

math.CO2022

Erdős--Szekeres-type problems in the real projective plane

Martin Balko, Manfred Scheucher, Pavel Valtr

math.CO2020

Minimal Representations of Order Types by Geometric Graphs

Oswin Aichholzer, Martin Balko, Michael Hoffmann +8

cs.CG2025

Investigating Simple Drawings of $K_n$ using SAT

Helena Bergold, Manfred Scheucher

cs.CG2022

On Crossing-Families in Planar Point Sets

Oswin Aichholzer, Jan Kynčl, Manfred Scheucher +2

math.MG2020

Almost-equidistant sets

Martin Balko, Attila Pór, Manfred Scheucher +2

math.CO2023

Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles

Yan Alves Radtke, Stefan Felsner, Johannes Obenaus +3

math.CO2023

Roudneff's Conjecture in Dimension $4$

Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano +1

cs.CG2025

Arrangements of Pseudocircles: On Digons and Triangles

Stefan Felsner, Sandro Roch, Manfred Scheucher

cs.CG2016

Strongly Monotone Drawings of Planar Graphs

Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann +3