Dr. Manfred Scheucher

Contact

Email:
lastname[at]domain, math.tu-berlin.de = domain

Address:
Technische Universität Berlin
Institut für Mathematik
Sekretariat MA 5-1
Strasse des 17. Juni 136
D-10623 Berlin, Germany

About Me

I'm a postdoctoral researcher in the group of Stefan Felsner at TU Berlin (Arbeitsgruppe Diskrete Mathematik) and principal investigator of the DFG project SCHE 2214/1-1 "Approaching Problems from Combinatorics and Geometry using Computer Assistance". Formerly I was part of the D-A-CH collaborative project "Arrangements and Drawings" supported by the DFG Grant FE 340/12-1. Before I finished my PhD at TU Berlin, I did my Bachelor and Master studies at TU Graz. Detailed CV

Publications and Preprints

  1. A SAT attack on higher dimensional Erdős--Szekeres numbers
    Manfred Scheucher.
    In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2021), pages 103--110, TM 14, Springer, 2021. [doi]
    Preprint available at [arXiv:2105.08406]
    [supplemental data]
  2. Tight bounds on the expected number of holes in random point sets
    with Martin Balko and Pavel Valtr.
    In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2021), pages 411--416, TM 14, Springer, 2021. [doi]
    To appear in Random Structures & Algorithms, 2021+. [arXiv:2111.12533]
  3. Coloring Circle Arrangements: New 4-Vertex-Critical Planar Graphs
    with Man-Kwun Chiu, Stefan Felsner, Felix Schröder, Raphael Steiner, and Birgit Vogtenhuber.
    In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2021), pages 84--91, TM 14, Springer, 2021. [doi]
  4. On Crossing-Families in Planar Point Sets
    with Oswin Aichholzer, Jan Kynčl, and Birgit Vogtenhuber.
    In Proceedings of the 37th European Workshop on Computational Geometry (EuroCG), 2021. [url] [pdf]
    Full version submitted. [arXiv:2109.10705]
  5. Many Order Types on Integer Grids of Polynomial Size
    Manfred Scheucher.
    In Proceedings of the 37th European Workshop on Computational Geometry (EuroCG), 2021. [url] [pdf]
    Full version submitted. [arXiv:2007.15334]
  6. Topological Drawings meet Classical Theorems from Convex Geometry
    with Helena Bergold, Stefan Felsner, Felix Schröder, and Raphael Steiner.
    In Proceedings of 28th International Symposium on Graph Drawing and Network Visualization (GD 2020), pages 281--294, LNCS 12590, Springer, 2020. [doi]
    Full version submitted. [arXiv:2005.12568]
  7. Holes and islands in random point sets
    with Martin Balko and Pavel Valtr.
    In Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020), pages 14:1--14:16, LIPIcs 164, Dagstuhl, 2020. [doi]
    In Random Structures & Algorithms, 2021. [doi] [arXiv:2003.00909]
  8. On the Average Complexity of the $k$-Level
    with Man-Kwun Chiu, Stefan Felsner, Patrick Schnider, Raphael Steiner, and Pavel Valtr.
    In Journal of Computational Geometry 11(1), pages 493--506, 2020. [doi]
  9. Shooting Stars in Simple Drawings of $K_{m,n}$
    with Oswin Aichholzer, Irene Parada, Birgit Vogtenhuber, and Alexandra Weinberger.
    In Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), pages 59:1--59:6, 2019. [url] [pdf]
  10. A Note On Universal Point Sets for Planar Graphs
    with Hendrik Schrezenmaier and Raphael Steiner.
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019). [doi]
    In Journal of Graph Algorithms and Applications 24(3), pages 171--190, 2020. [doi]
    [supplemental data]
  11. On orthogonal symmetric chain decompositions
    with Karl Däubel, Sven Jäger and Torsten Mütze.
    In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2019), Acta Mathematica Universitatis Comenianae 88(3), pages 611--618, 2019. [url] [pdf]
    In Electronic Journal of Combinatorics 26(3), Research paper P3.64, 32 pages, 2019. [doi]
    [supplemental data]
  12. Two Disjoint 5-Holes in Point Sets
    Manfred Scheucher.
    In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2019), Acta Mathematica Universitatis Comenianae 88(3), pages 1049--1056, 2019. [url] [pdf]
    In Computational Geometry: Theory and Applications 91:101670, 2020. [doi] [arXiv:1807.10848]
    [supplemental data]
  13. On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples
    with Torsten Mütze.
    In Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), pages 354--360, LNCS 11282, Springer, 2018. [doi]
    In Journal of Graph Algorithms and Applications 24(3), pages 343--369, 2020. [doi]
    [supplemental data]
  14. Arrangements of Pseudocircles: On Circularizability
    with Stefan Felsner.
    In Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), pages 555--568, LNCS 11282, Springer, 2018. [doi]
    In Discrete & Computational Geometry 64(3), pages 776--813, 2020. Ricky Pollack Memorial Issue. [doi] [arXiv:1712.02149]
    [supplemental data]
  15. Minimal Geometric Graph Representations of Order Types
    with Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Pavel Valtr, Birgit Vogtenhuber, and Emo Welzl.
    In Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019). [doi]
    In Journal of Graph Algorithms and Applications 24(4), pages 551--572, 2020. Special issue on selected papers from GD 2019. [doi]
  16. Almost-equidistant sets
    with Martin Balko, Attila Pór, Konrad Swanepoel, and Pavel Valtr.
    In Graphs and Combinatorics 36, pages 729--754, 2020. [doi]
    [supplemental data]
  17. Arrangements of Pseudocircles: Triangles and Drawings
    with Stefan Felsner.
    In Proceedings of 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), pages 127--139, LNCS 10692, Springer, 2017. [pdf] [doi]
    In Discrete & Computational Geometry 65, pages 261--278, 2021. [doi] [arXiv:1708.06449]
    [supplemental data]
  18. A superlinear lower bound on the number of 5-holes
    with Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kynčl, Irene Parada, Pavel Valtr, and Birgit Vogtenhuber.
    In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), pages 8:1--8:16, LIPIcs 77, Dagstuhl, 2017. [pdf] [doi]
    In Journal of Combinatorial Theory, Series A, 173:105236, 2020. [doi] [arXiv:1703.05253]
    [supplemental data]
  19. Strongly Monotone Drawings of Planar Graphs
    with Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, and Tamara Mchedlidze.
    In Proceedings of the 32nd International Symposium on Computational Geometry (SoCG 2016), pages 37:1--37:15, LIPIcs 51, Dagstuhl, 2016. [pdf] [doi] [arXiv:1601.01598]
  20. Planar L-Shaped Point Set Embeddings of Trees (this work is based on my Master's thesis)
    with Oswin Aichholzer and Thomas Hackl.
    In Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG), 2016. [url] [pdf]

Theses

  • Points, Lines, and Circles: Some Contributions to Combinatorial Geometry
    PhD thesis, Institut für Mathematik, Technische Universität Berlin, Germany, 2020.
    Supervisor: Stefan Felsner.
    [pdf] [doi]
  • Orthogeodesic Point Set Embeddings of Outerplanar Graphs
    Master's thesis, Institute for Software Technology, Graz University of Technology, Austria, 2015.
    Supervisors: Oswin Aichholzer and Thomas Hackl.
    [pdf] [url]
  • On Order Types, Projective Classes, and Realizations
    Bachelor's thesis, Institute for Software Technology, Graz University of Technology, Austria, 2014.
    Supervisors: Oswin Aichholzer and Thomas Hackl.
    [pdf]
  • Counting Convex 5-Holes
    Bachelor's thesis, Institute for Software Technology, Graz University of Technology, Austria, 2013.
    Supervisors: Oswin Aichholzer and Thomas Hackl.
    [pdf]

Last update: November 25 2021 12:10:54.