Two disjoint 5-holes in point sets M Scheucher
Computational Geometry 91, 101670, 2020
21 2020 Arrangements of pseudocircles: On circularizability S Felsner, M Scheucher
Discrete & Computational Geometry 64 (3), 776-813, 2020
19 2020 A note on universal point sets for planar graphs M Scheucher, H Schrezenmaier, R Steiner
International Symposium on Graph Drawing and Network Visualization, 350-362, 2019
17 2019 A superlinear lower bound on the number of 5-holes O Aichholzer, M Balko, T Hackl, J Kynčl, I Parada, M Scheucher, P Valtr, ...
Journal of Combinatorial Theory, Series A 173, 105236, 2020
16 2020 Strongly monotone drawings of planar graphs S Felsner, A Igamberdiev, P Kindermann, B Klemz, T Mchedlidze, ...
arXiv preprint arXiv:1601.01598, 2016
16 2016 A SAT attack on Rota’s basis conjecture M Kirchweger, M Scheucher, S Szeider
25th International Conference on Theory and Applications of Satisfiability …, 2022
12 2022 Topological drawings meet classical theorems from convex geometry H Bergold, S Felsner, M Scheucher, F Schröder, R Steiner
Discrete & Computational Geometry 70 (3), 1121-1143, 2023
11 2023 Arrangements of pseudocircles: triangles and drawings S Felsner, M Scheucher
Discrete & Computational Geometry 65, 261-278, 2021
11 * 2021 Almost-equidistant sets M Balko, A Pór, M Scheucher, K Swanepoel, P Valtr
Graphs and Combinatorics 36 (3), 729-754, 2020
11 2020 Holes and islands in random point sets M Balko, M Scheucher, P Valtr
Random Structures & Algorithms 60 (3), 308-326, 2022
9 2022 SAT-based generation of planar graphs M Kirchweger, M Scheucher, S Szeider
26th International Conference on Theory and Applications of Satisfiability …, 2023
8 2023 On orthogonal symmetric chain decompositions K Däubel, S Jäger, T Mütze, M Scheucher
arXiv preprint arXiv:1810.09847, 2018
8 2018 Using SAT to study plane Hamiltonian substructures in simple drawings H Bergold, S Felsner, MM Reddy, M Scheucher
arXiv preprint arXiv:2305.09432, 2023
7 2023 A SAT attack on Erdős-Szekeres numbers in R^ d and the empty hexagon theorem M Scheucher
Computing in Geometry and Topology 2 (1), 2: 1-2: 13, 2023
7 2023 Happy Ending: An Empty Hexagon in Every Set of 30 Points MJH Heule, M Scheucher
International Conference on Tools and Algorithms for the Construction and …, 2024
6 2024 Points, lines, and circles:: some contributions to combinatorial geometry M Scheucher
Dissertation, Berlin, Technische Universität Berlin, 2019, 2020
6 2020 On the Average Complexity of the MK Chiu, S Felsner, M Scheucher, P Schnider, R Steiner, P Valtr
arXiv preprint arXiv:1911.02408, 2019
6 2019 Minimal representations of order types by geometric graphs O Aichholzer, M Balko, M Hoffmann, J Kynčl, W Mulzer, I Parada, A Pilz, ...
International Symposium on Graph Drawing and Network Visualization, 101-113, 2019
6 2019 Orthogeodesic point set embeddings of outerplanar graphs M Scheucher
Master's thesis, Graz University of Technology, Graz, Austria, 2015
6 2015 On order types, projective classes, and realizations M Scheucher
Bachelor's thesis Institute for Software Technology, Graz University of …, 2014
6 2014 
Stefan FelsnerProfessor für Diskrete Mathematik, TU BerlinПотвърден имейл адрес: math.tu-berlin.de
