Dipl.-Inform. Boris KlemzArbeitsgruppe Theoretische InformatikInstitut für Informatik Fachbereich Mathematik und Informatik Freie Universität Berlin Takustr. 9 14195 Berlin Germany Office: 116 E-mail: klemz [at] inf [dot] fu-berlin [dot] de Phone: +49 30 838 75158 |
|
Publications - Teaching
Publications
| [12] | Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs Boris Klemz, Günter Rote Preprint. Submitted for publication. [arXiv] |
| [11] | Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity Boris Klemz, Günter Rote Graph Drawing and Network Visualization (GD'17), vol. 10692 of LNCS, pages 440-453, 2018. * Best Paper Award (Track 1: Theory). [doi] [arXiv] |
| [10] | Obedient Plane Drawings for Disk Intersection Graphs Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow Algorithms and Data Structures (WADS'17) (Faith Ellen, Antonina Kolokolova, Jörg-Rüdiger Sack, eds.), volume 10389 of LNCS, Springer International Publishings, pages 73-84, 2017. [doi] |
| [9] | Ordered Level Planarity and Geodesic Planarity Boris Klemz, Günter Rote European Workshop on Computational Geometry (EuroCG'17), pages 269-272, 2017. [url] |
| [8] | Strongly Monotone Drawings of Planar Graphs Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher Symposium on Computational Geometry (SoCG'16) (Sándor Fekete, Anna Lubiw, eds.), LIPICS vol. 51, pages 37:1-37:15, 2016. [doi] [arXiv] |
| [7] | Strongly Monotone Drawings of Planar Graphs Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher European Workshop on Computational Geometry (EuroCG'16), pages 59-62, 2016. [url] [arXiv] |
| [6] | Recognizing Weighted Disk Contact Graphs Boris Klemz, Martin Nöllenburg, Roman Prutkin Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, Springer International Publishing, pages 433-446, 2015. [doi] [arXiv] |
| [5] | Recognizing Weighted and Seeded Disk Graphs Boris Klemz, Martin Nöllenburg, Roman Prutkin Computational Geometry Week: Young Researchers Forum (CG:YRF'15), pages 28-29, 2015. [url] [arXiv] |
| [4] | Recognizing Weighted Disk Contact Graphs Boris Klemz, Martin Nöllenburg, Roman Prutkin European Workshop on Computational Geometry (EuroCG'15), pages 113-116, 2015. [url] [arXiv] |
| [3] | Weighted Disk Contact Graphs Boris Klemz Diplomarbeit (Master's thesis), Karlsruhe Institute of Technology, 2014. [url] |
| [2] | Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, Springer International Publishing, pages 253-264, 2014. [url] |
| [1] | Minimum-weight tree supports and tree-shaped area-proportional Euler diagrams Boris Klemz Studienarbeit (Bachelor's thesis), Karlsruhe Institute of Technology, 2013. [url] |
Teaching
| Winter 2017 | Algorithmen zur Visualisierung von Graphen, Freie Universität Berlin |
| Summer 2017 | Seminar über Algorithmen, Freie Universität Berlin |
| Summer 2017 | Algorithmische Geometrie, Freie Universität Berlin |
| Winter 2016 | Höhere Algorithmik I, Freie Universität Berlin |
| Summer 2015 | Computergrafik, Freie Universität Berlin |
| Winter 2015 | Höhere Algorithmik I, Freie Universität Berlin |
last modified: 02/2018, Impressum