Manfred Scheucher

Contact

Check out my new website at FernUniversität in Hagen for up-to-date information.

CV

  • Since July 2020:
    Postdoctoral Researcher of Prof. Winfried Hochstättler at
    Lehrgebiet: Diskrete Mathematik und Optimierung,
    Fakultät für Mathematik und Informatik,
    FernUniversität in Hagen, Germany.
  • March 2018 -- June 2020:
    (Post)doctoral Researcher of Prof. Stefan Felsner at
    Arbeitsgruppe Diskrete Mathematik,
    Institut für Mathematik,
    Technische Universität Berlin, Germany.
  • November 2016 -- March 2017:
    Research Assistant of Prof. Imre Bárány at
    Alfréd Rényi Institute of Mathematics,
    Hungarian Academy of Sciences, Budapest, Hungary.
  • August 2015 -- July 2016:
    Research Assistant of Prof. Oswin Aichholzer at
    Arbeitsgruppe Discrete and Computational Geometry,
    Institute of Software Technology,
    Graz University of Technology, Austria.
Detailed CV

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]

Publications

  1. Many Order Types on Integer Grids of Polynomial Size
    Preprint available at [arXiv:2007.15334]
  2. Topological Drawings meet Classical Theorems from Convex Geometry
    with Helena Bergold, Stefan Felsner, Felix Schröder, and Raphael Steiner.
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [pdf] [url]
    [arXiv:2005.12568]
  3. Holes and islands in random point sets
    with Martin Balko and Pavel Valtr.
    In the Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020), pages 14:1--14:16, LIPIcs 164, Dagstuhl, 2020. [doi]
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [pdf] [url]
    [arXiv:2003.00909]
  4. On the Average Complexity of the $k$-Level
    with Man-Kwun Chiu, Stefan Felsner, Patrick Schnider, Raphael Steiner, and Pavel Valtr.
    Extended Abstract in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG), 2020. [pdf] [url]
    [arXiv:1911.02408]
  5. Shooting Stars in Simple Drawings of $K_{m,n}$
    with Oswin Aichholzer, Irene Parada, Birgit Vogtenhuber, and Alexandra Weinberger.
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), pages 59:1--59:6, 2019. [url] [pdf]
  6. A Note On Universal Point Sets for Planar Graphs
    with Hendrik Schrezenmaier and Raphael Steiner.
    Full version in the Journal of Graph Algorithms and Applications 24(3), pages 171--190, 2020. [doi]
    In the Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019). [doi]
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), pages 21:1--21:9, 2019. [url] [pdf]
    [arXiv:1811.06482] [supplemental data]
  7. On orthogonal symmetric chain decompositions
    with Karl Däubel, Sven Jäger and Torsten Mütze.
    Full version in the Electronic Journal of Combinatorics 26(3), Research paper P3.64, 32 pages, 2019. [doi]
    Short version 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]
    [arXiv:1810.09847] [supplemental data]
  8. Two Disjoint 5-Holes in Point Sets
    Manfred Scheucher.
    Full version in Computational Geometry: Theory and Applications, 2020. [doi]
    Short version 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]
    Extended Abstract in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), pages 22:1--22:9, 2019. [url] [pdf]
    [arXiv:1807.10848] [supplemental data]
  9. On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples
    with Torsten Mütze.
    Full version in the Journal of Graph Algorithms and Applications 24(3), pages 343--369, 2020. [doi]
    Short version in the Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), pages 354--360, LNCS 11282, Springer, 2018. [doi]
    [arXiv:1807.11043] [supplemental data]
  10. Arrangements of Pseudocircles: On Circularizability
    with Stefan Felsner.
    Full version in Discrete & Computational Geometry, Ricky Pollack Memorial Issue. [doi]
    In the Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), pages 555--568, LNCS 11282, Springer, 2018. [doi]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), pages 15:1--15:6, 2018. [url] [pdf]
    [arXiv:1712.02149] [supplemental data]
  11. 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 the Proceedings of 27th International Symposium on Graph Drawing and Network Visualization (GD 2019). [doi]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), pages 21:1--21:6, 2018. [url] [pdf]
    [arXiv:1908.05124]
  12. Almost-equidistant sets
    with Martin Balko, Attila Pór, Konrad Swanepoel, and Pavel Valtr.
    Full version in Graphs and Combinatorics, 2020. [doi]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [url] [pdf]
    [arXiv:1706.06375] [supplemental data]
  13. Arrangements of Pseudocircles: Triangles and Drawings
    with Stefan Felsner.
    Full version in Discrete & Computational Geometry, 2020. [doi]
    In Proceedings of 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), pages 127--139, LNCS 10692, Springer, 2017. [pdf] [doi]
    Extended Abstract in Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 2017. [url] [pdf]
    [arXiv:1708.06449] [supplemental data]
  14. 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.
    Full version in Journal of Combinatorial Theory, Series A, 173:105236, 2020. [doi]
    In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), pages 8:1--8:16, LIPIcs 77, Dagstuhl, 2017. [pdf] [doi]
    Extended Abstract in Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 2017. [url] [pdf]
    [arXiv:1703.05253] [supplemental data]
  15. 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]
    Extended Abstract in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG), 2016. [url] [pdf]
    [arXiv:1601.01598]
  16. Planar L-Shaped Point Set Embeddings of Trees
    with Oswin Aichholzer and Thomas Hackl.
    Extended Abstract in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG), 2016. [url] [pdf]

Last update: July 31 2020 10:33:08.