Manfred Scheucher

Orcid: 0000-0002-1657-9796

Affiliations:
  • Technical University of Berlin, Germany


According to our database1, Manfred Scheucher authored at least 36 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Erdős-Szekeres-Type Problems in the Real Projective Plane.
Discret. Comput. Geom., December, 2024

Coloring circle arrangements: New 4-chromatic planar graphs.
Eur. J. Comb., 2024

Finding hardness reductions automatically using SAT solvers.
CoRR, 2024

Happy Ending: An Empty Hexagon in Every Set of 30 Points.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

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

An Improved Lower Bound on the Number of Pseudoline Arrangements.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Saturation Results Around the Erdős-Szekeres Problem.
Proceedings of the 40th International Symposium on Computational Geometry, 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

Tight bounds on the expected number of holes in random point sets.
Random Struct. Algorithms, 2023

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

Roudneff's Conjecture in Dimension 4.
CoRR, 2023

Many order types on integer grids of polynomial size.
Comput. Geom., 2023

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

SAT-Based Generation of Planar Graphs.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Bichromatic Perfect Matchings with Crossings.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

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

2022
Holes and islands in random point sets.
Random Struct. Algorithms, 2022

Blocking Delaunay Triangulations from the Exterior.
CoRR, 2022

On crossing-families in planar point sets.
Comput. Geom., 2022

A SAT Attack on Rota's Basis Conjecture.
Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Arrangements of Pseudocircles: On Digons and Triangles.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021
Arrangements of Pseudocircles: Triangles and Drawings.
Discret. Comput. Geom., 2021

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

2020
On the Average Complexity of the k-Level.
J. Comput. Geom., 2020

A Note on Universal Point Sets for Planar Graphs.
J. Graph Algorithms Appl., 2020

On L-shaped point set embeddings of trees: first non-embeddable examples.
J. Graph Algorithms Appl., 2020

Minimal Representations of Order Types by Geometric Graphs.
J. Graph Algorithms Appl., 2020

A superlinear lower bound on the number of 5-holes.
J. Comb. Theory A, 2020

Almost-Equidistant Sets.
Graphs Comb., 2020

Arrangements of Pseudocircles: On Circularizability.
Discret. Comput. Geom., 2020

Two disjoint 5-holes in point sets.
Comput. Geom., 2020

2019
On Orthogonal Symmetric Chain Decompositions.
Electron. J. Comb., 2019

2018
On Disjoint Holes in Point Sets.
CoRR, 2018

2016
Strongly Monotone Drawings of Planar Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016


  Loading...