piwik-script

Deutsch Intern
Chair of Computer Science I - Algorithms and Complexity

Felix Klesen, M.Sc.

Felix Klesen

Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
97074 Würzburg
Deutschland
Building: M4
Room: 1.002

Awards

  • 2021: 1st place in the manual category of the Graph Drawing Live Challenge at the 29th International Symposium on Graph Drawing and Network Visualization (GD'21) in Tübingen, with Jonathan Klawitter
  • 2018: 2nd place in the ACM SIGSPATIAL Cup at the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPACIAL 2018) in Seattle, with Thomas van Dijk

Teaching

Supervised Theses and Practical Projects

  • León Lang: Regular Outer Obstacle Representations of Small Planar Graphs (Bachelor Thesis, in German), 2022
    [pdf]

  • Christian Goldschmied: 1-Obstacle Visibility Representation of Cubic Graphs (Bachelor Thesis, in German), 2021
    [pdf]

Publications

2022[ to top ]
  • Algorithms for Floor Planning with Proximity Requirements Klawitter, Jonathan; Klesen, Felix; Wolff, Alexander in Proc. CAAD Future 2021, CCIS, D. J. Gerber, A. Nahmad, B. Bogosian, E. Pantazis, C. Miltiadis (eds.) (2022). (Vol. 1465) 151–171.
  • Outside-Obstacle Representations with All Vertices on the Outer Face Firman, Oksana; Kindermann, Philipp; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Wolff, Alexander in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22), E. {Di Giacomo}, F. Montecchiani (eds.) (2022). 54:1–8.
  • Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Kobourov, Stephen; Kryven, Myroslav; Wolff, Alexander; Zink, Johannes in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22), E. {Di Giacomo}, F. Montecchiani (eds.) (2022). 53:1–7.
  • Outside-Obstacle Representations with All Vertices on the Outer Face Firman, Oksana; Kindermann, Philipp; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Wolff, Alexander in Proc. 30th Int. Symp. Graph Drawing \& Network Vis. (GD’22), Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (eds.) (2022).
  • The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs Goe{\ss}mann, Ina; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Kobourov, Stephen G.; Kryven, Myroslav; Wolff, Alexander; Zink, Johannes in Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG’22), Lecture Notes in Computer Science, M. Bekos, M. Kaufmann (eds.) (2022).
2020[ to top ]
  • Algorithms for Automated Floor Planning Klesen, Felix (2020).
2018[ to top ]
  • Wüpstream: efficient enumeration of upstream features (GIS cup) van Dijk, Thomas C.; Greiner, Tobias; den Heijer, Bas; Henning, Nadja; Klesen, Felix; L{\"{o}}ffler, Andre in Proceedings of the 26th {ACM} {SIGSPATIAL} International Conference on Advances in Geographic Information Systems, {SIGSPATIAL} 2018, Seattle, WA, USA, November 06-09, 2018, F. B. Kashani, E. G. Hoel, R. H. G{\"{u}}ting, R. Tamassia, L. Xiong (eds.) (2018). 626–629.
2017[ to top ]
  • Flusserkennung in Luftbildaufnahmen Klesen, Felix (2017).