Manfred Scheucher

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Flip graph connectivity for arrangements of pseudolines and pseudocircles2024-11-28Paper
SAT-based generation of panar graphs2024-11-26Paper
Erdős-Szekeres-type problems in the real projective plane
Discrete & Computational Geometry
2024-11-22Paper
On orthogonal symmetric chain decompositions
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
On disjoint holes in point sets
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
An extension theorem for signotopes2024-10-16Paper
Coloring circle arrangements: new 4-chromatic planar graphs
European Journal of Combinatorics
2024-09-30Paper
Coloring circle arrangements: new 4-chromatic planar graphs2024-09-13Paper
A SAT attack on higher dimensional Erdős-Szekeres numbers2024-09-13Paper
A SAT attack on Rota's basis conjecture2024-07-12Paper
A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem2023-12-16Paper
Saturation results around the Erd\H{o}s--Szekeres problem2023-12-02Paper
Holes and Islands in Random Point Sets2023-11-02Paper
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles2023-10-30Paper
Tight bounds on the expected number of holes in random point sets
Random Structures & Algorithms
2023-10-17Paper
Topological drawings meet classical theorems from convex geometry
Discrete & Computational Geometry
2023-10-12Paper
Holes and islands in random point sets
Random Structures & Algorithms
2023-10-12Paper
Holes and islands in random point sets
Random Structures & Algorithms
2023-10-12Paper
Bichromatic Perfect Matchings with Crossings2023-09-01Paper
Arrangements of pseudocircles: on digons and triangles
Lecture Notes in Computer Science
2023-08-16Paper
Using SAT to study plane Hamiltonian substructures in simple drawings2023-05-16Paper
Roudneff's Conjecture in Dimension $4$2023-03-24Paper
An extension theorem for signotopes2023-03-07Paper
Many order types on integer grids of polynomial size
Computational Geometry
2022-11-16Paper
On crossing-families in planar point sets
Computational Geometry
2022-06-13Paper
Coloring circle arrangements: New $4$-chromatic planar graphs2022-05-17Paper
Erd\H{o}s--Szekeres-type problems in the real projective plane2022-03-14Paper
Topological Drawings Meet Classical Theorems from Convex Geometry
Lecture Notes in Computer Science
2021-12-01Paper
A SAT attack on higher dimensional Erd\H{o}s--Szekeres numbers2021-05-18Paper
Arrangements of pseudocircles: triangles and drawings
Discrete & Computational Geometry
2021-01-29Paper
Two disjoint 5-holes in point sets
Computational Geometry
2021-01-07Paper
On the average complexity of the $k$-level
(available as arXiv preprint)
2020-11-12Paper
A note on universal point sets for planar graphs
(available as arXiv preprint)
2020-10-26Paper
Arrangements of pseudocircles: on circularizability
Discrete & Computational Geometry
2020-10-23Paper
On L-shaped point set embeddings of trees: first non-embeddable examples
Journal of Graph Algorithms and Applications
2020-09-04Paper
A Note on Universal Point Sets for Planar Graphs
Journal of Graph Algorithms and Applications
2020-09-04Paper
Many Order Types on Integer Grids of Polynomial Size
(available as arXiv preprint)
2020-07-30Paper
Almost-equidistant sets
Graphs and Combinatorics
2020-04-30Paper
A superlinear lower bound on the number of 5-holes
Journal of Combinatorial Theory. Series A
2020-03-20Paper
On orthogonal symmetric chain decompositions
The Electronic Journal of Combinatorics
2019-09-30Paper
On orthogonal symmetric chain decompositions
The Electronic Journal of Combinatorics
2019-09-30Paper
Arrangements of pseudocircles: triangles and drawings
Lecture Notes in Computer Science
2019-02-20Paper
Arrangements of pseudocircles: triangles and drawings
Lecture Notes in Computer Science
2019-02-20Paper
On L-shaped point set embeddings of trees: first non-embeddable examples2019-02-15Paper
On L-shaped point set embeddings of trees: first non-embeddable examples
(available as arXiv preprint)
2019-02-15Paper
Arrangements of pseudocircles: on circularizability
Lecture Notes in Computer Science
2019-02-15Paper
On orthogonal symmetric chain decompositions
(available as arXiv preprint)
2018-10-23Paper
A superlinear lower bound on the number of 5-holes
(available as arXiv preprint)
2018-08-13Paper
On L-shaped point set embeddings of trees: first non-embeddable examples
(available as arXiv preprint)
2018-07-29Paper
Strongly monotone drawings of planar graphs
(available as arXiv preprint)
2018-01-30Paper
Finding hardness reductions automatically using SAT solvers
(available as arXiv preprint)
N/APaper
An Improved Lower Bound on the Number of Pseudoline Arrangements
(available as arXiv preprint)
N/APaper
Happy Ending: An Empty Hexagon in Every Set of 30 Points
(available as arXiv preprint)
N/APaper
Plane Hamiltonian Cycles in Convex Drawings
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Manfred Scheucher