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 ]
    • Klawitter, J., Klesen, F., Wolff, A.: Algorithms for Floor Planning with Proximity Requirements. In: Gerber, D.J., Nahmad, A., Bogosian, B., Pantazis, E., and Miltiadis, C. (eds.) Proc. CAAD Future 2021. pp. 151–171. Springer-Verlag (2022).
    • Firman, O., Kindermann, P., Klawitter, J., Klemz, B., Klesen, F., Wolff, A.: Outside-Obstacle Representations with All Vertices on the Outer Face. In: {Di Giacomo}, E. and Montecchiani, F. (eds.) Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22). pp. 54:1–8 (2022).
    • Klawitter, J., Klemz, B., Klesen, F., Kobourov, S., Kryven, M., Wolff, A., Zink, J.: Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs. In: {Di Giacomo}, E. and Montecchiani, F. (eds.) Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22). pp. 53:1–7 (2022).
    • Firman, O., Kindermann, P., Klawitter, J., Klemz, B., Klesen, F., Wolff, A.: Outside-Obstacle Representations with All Vertices on the Outer Face. In: Angelini, P. and von Hanxleden, R. (eds.) Proc. 30th Int. Symp. Graph Drawing \& Network Vis. (GD’22). Springer-Verlag (2022).
    • Goe{\ss}mann, I., Klawitter, J., Klemz, B., Klesen, F., Kobourov, S.G., Kryven, M., Wolff, A., Zink, J.: The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. In: Bekos, M. and Kaufmann, M. (eds.) Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG’22). Springer-Verlag (2022).
    2020[ to top ]
    • Klesen, F.: Algorithms for Automated Floor Planning, http://www1.pub.informatik.uni-wuerzburg.de/pub/theses/2020-klesen-master.pdf, (2020).
    2018[ to top ]
    • van Dijk, T.C., Greiner, T., den Heijer, B., Henning, N., Klesen, F., L{\"{o}}ffler, A.: Wüpstream: efficient enumeration of upstream features (GIS cup). In: Kashani, F.B., Hoel, E.G., G{\"{u}}ting, R.H., Tamassia, R., and Xiong, L. (eds.) Proceedings of the 26th {ACM} {SIGSPATIAL} International Conference on Advances in Geographic Information Systems, {SIGSPATIAL} 2018, Seattle, WA, USA, November 06-09, 2018. pp. 626–629. {ACM} (2018).
    2017[ to top ]
    • Klesen, F.: Flusserkennung in Luftbildaufnahmen, http://www1.pub.informatik.uni-wuerzburg.de/pub/theses/2017-klesen-bachelor.pdf, (2017).