Technische Universität Berlin
Institut für Mathematik
Algorithmische und Diskrete Mathematik
Diskrete Mathematik

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

Office:
MA 506

Phone:
+49-30-314 27447

Publications

  • M. Scheucher, H. Schrezenmaier, and R. Steiner. A Note On Universal Point Sets for Planar Graphs. 2018. [arXiv:1811.06482] [supplemental data]
  • K. Däubel, S. Jäger, T. Mütze, and M. Scheucher. On orthogonal symmetric chain decompositions. 2018. [arXiv:1810.09847] [supplemental data]
  • M. Scheucher. On Disjoint Holes in Point Sets. 2018. [arXiv:1807.10848] [supplemental data]
  • T. Mütze and M. Scheucher. On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples To appear in the Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), LNCS, Springer, 2018. [arXiv:1807.11043] [supplemental data]
  • S. Felsner and M. Scheucher. Arrangements of Pseudocircles: On Circularizability. To appear in the Proceedings of 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), LNCS, Springer, 2018. [arXiv:1712.02149] [supplemental data]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [pdf]
  • O. Aichholzer, M. Balko, M. Hoffmann, J. Kynčl, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber, and E. Welzl. Minimal Geometric Graph Representations of Order Types. Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [pdf]
  • M. Balko, A. Pór, M. Scheucher, K. Swanepoel, and P. Valtr. Almost-equidistant sets. [arXiv:1706.06375] [supplemental data]
    Extended Abstract in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 2018. [pdf]
  • S. Felsner and M. Scheucher. Arrangements of Pseudocircles: Triangles and Drawings. In Proceedings of 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), pages 127--139, LNCS 10692, Springer, 2017. [pdf] [doi] [arXiv:1708.06449] [supplemental data]
    Extended Abstract in Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 2017. [url] [pdf]
  • O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber. A superlinear lower bound on the number of 5-holes. In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), pages 8:1--8:16, LIPIcs 77, Dagstuhl, 2017. [pdf] [doi] [arXiv:1703.05253] [supplemental data]
    Extended Abstract in Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 2017. [url] [pdf]
  • S. Felsner, A. Igamberdiev, P. Kindermann, B. Klemz, T. Mchedlidze, and M. Scheucher. Strongly Monotone Drawings of Planar Graphs. 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]
    Extended Abstract in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG), 2016. [url] [pdf]
  • O. Aichholzer, T. Hackl, and M. Scheucher. Planar L-Shaped Point Set Embeddings of Trees. Extended Abstract in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG), 2016. [url] [pdf]
  • M. Scheucher. Orthogeodesic Point Set Embeddings of Outerplanar Graphs. Master's thesis, Institute for Software Technology, Graz University of Technology, Austria, 2015. [pdf]
  • M. Scheucher. On Order Types, Projective Classes, and Realizations. Bachelor's thesis, Institute for Software Technology, Graz University of Technology, Austria, 2014. [pdf]
  • M. Scheucher. Counting Convex 5-Holes. Bachelor's thesis, Institute for Software Technology, Graz University of Technology, Austria, 2013. [pdf]

Last update: November 16 2018 11:51:00.