Manfred Scheucher

According to our database, Manfred Scheucher authored at least 34 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Plane Hamiltonian Cycles in Convex Drawings.

Helena Bergold, Stefan Felsner, Meghana M. Reddy, Joachim Orthaber, Manfred Scheucher

CoRR, 2024

An Improved Lower Bound on the Number of Pseudoline Arrangements.

Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher

CoRR, 2024

Finding hardness reductions automatically using SAT solvers.

Helena Bergold, Manfred Scheucher, Felix Schröder

CoRR, 2024

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

Marijn J. H. Heule, Manfred Scheucher

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles.

Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Topological Drawings Meet Classical Theorems from Convex Geometry.

Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner

Discret. Comput. Geom., October, 2023

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

Martin Balko, Manfred Scheucher, Pavel Valtr

Random Struct. Algorithms, 2023

Using SAT to study plane Hamiltonian substructures in simple drawings.

Helena Bergold, Stefan Felsner, Meghana M. Reddy, Manfred Scheucher

CoRR, 2023

Roudneff's Conjecture in Dimension 4.

Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano, Manfred Scheucher

CoRR, 2023

Many order types on integer grids of polynomial size.

Manfred Scheucher

Comput. Geom., 2023

A SAT Attack on Erdős-Szekeres Numbers in R^d and the Empty Hexagon Theorem.

Manfred Scheucher

Comput. Geom. Topol., 2023

SAT-Based Generation of Planar Graphs.

Markus Kirchweger, Manfred Scheucher, Stefan Szeider

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Bichromatic Perfect Matchings with Crossings.

Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, Birgit Vogtenhuber

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

An Extension Theorem for Signotopes.

Helena Bergold, Stefan Felsner, Manfred Scheucher

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Holes and islands in random point sets.

Martin Balko, Manfred Scheucher, Pavel Valtr

Random Struct. Algorithms, 2022

Blocking Delaunay Triangulations from the Exterior.

Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber

CoRR, 2022

Coloring circle arrangements: New 4-chromatic planar graphs.

Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber

CoRR, 2022

On crossing-families in planar point sets.

Oswin Aichholzer, Jan Kyncl, Manfred Scheucher, Birgit Vogtenhuber, Pavel Valtr

Comput. Geom., 2022

A SAT Attack on Rota's Basis Conjecture.

Markus Kirchweger, Manfred Scheucher, Stefan Szeider

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Arrangements of Pseudocircles: On Digons and Triangles.

Stefan Felsner, Sandro Roch, Manfred Scheucher

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Erdős-Szekeres-Type Problems in the Real Projective Plane.

Martin Balko, Manfred Scheucher, Pavel Valtr

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Arrangements of Pseudocircles: Triangles and Drawings.

Stefan Felsner, Manfred Scheucher

Discret. Comput. Geom., 2021

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

Manfred Scheucher

CoRR, 2021

2020

On the Average Complexity of the k-Level.

Raphael Steiner, Manfred Scheucher, Stefan Felsner, Pavel Valtr, Man-Kwun Chiu, Patrick Schnider

J. Comput. Geom., 2020

A Note on Universal Point Sets for Planar Graphs.

Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner

J. Graph Algorithms Appl., 2020

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

Torsten Mütze, Manfred Scheucher

J. Graph Algorithms Appl., 2020

Minimal Representations of Order Types by Geometric Graphs.

Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl

J. Graph Algorithms Appl., 2020

A superlinear lower bound on the number of 5-holes.

Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber

J. Comb. Theory, Ser. A, 2020

Almost-Equidistant Sets.

Martin Balko, Attila Pór, Manfred Scheucher, Konrad J. Swanepoel, Pavel Valtr

Graphs Comb., 2020

Arrangements of Pseudocircles: On Circularizability.

Stefan Felsner, Manfred Scheucher

Discret. Comput. Geom., 2020

Two disjoint 5-holes in point sets.

Manfred Scheucher

Comput. Geom., 2020

2019

On Orthogonal Symmetric Chain Decompositions.

Karl Däubel, Sven Jäger, Torsten Mütze, Manfred Scheucher

Electron. J. Comb., 2019

2018

On Disjoint Holes in Point Sets.

Manfred Scheucher

CoRR, 2018

2016

Strongly Monotone Drawings of Planar Graphs.

Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher

Proceedings of the 32nd International Symposium on Computational Geometry, 2016