English Intern
Lehrstuhl für Informatik I - Algorithmen und Komplexität

Jonathan Klawitter

Jonathan Klawitter

Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
97074 Würzburg
Deutschland
Gebäude: M4
Raum: 1.006
Foto Jonathan Klawitter

Lehrveranstaltungen

Betreuung

  • Jonas Zeier: Animating Morphs between Rectangular Duals, Bachelorarbeit
  • Peter Markfelder: Extension of Partial Contact Representations, Masterarbeit
  • Alexander Zaft: Map labelling with phylogenetic tree constraints, Masterpraktikum
  • Moritz Niederer: Ein Algorithmus zur gemeinsamen Visualisierung von Arten- und Genbäumen, Bachelorarbeit
  • Leon Füger: A Local Search Algorithm for Coordinated Motion Planning, Masterpraktikum
  • Lukas Garbe: Segment number of maximal outerplanar graphs, Zulassungsarbeit
  • Felix Klesen: Algorithms for automated floor planning, Masterarbeit
  • Micheal May: Ein Algorithmus zur Optimierung einer Flächenaufteilung, Bachelorarbeit

Forschungsinteressen

  • Graph Drawing
  • Combinatorial Phylogenetics

Curriculum Vitae

  • Oktober 2019 – Oktober 2021:
    Postdoktorand am Lehrstuhl für Informatik 1, Universität Würzburg, Deutschland
  • September 2016 – August 2019:
    Promotion an der Universität Auckland, Neuseeland
  • Oktober 2014 – April 2016:
    Master in Informatik am Karlsruher Institut für Technologie, Deutschland
  • Oktober 2011 – Oktober 2014:
    Bachelor in Mathematik am Karlsruher Institut für Technologie, Deutschland
  • Oktober 2011 – Oktober 2014:
    Bachelor in Informatik am Karlsruher Institut für Technologie, Deutschland

Publikationen

Schaue online bei dblp oder Scholar für eine aktuelle Liste.

Paper

  • Upward Planar Drawings with Two Slopes
    J Klawitter, T Mchedlidze
    < arXiv >
  • Upward Planar Drawings with Three and More Slopes
    J Klawitter, J Zink
    Graph Drawing and Network Visualization (GD'21) (Helen C. Purchase, Ignaz Rutter, eds.), LNCS, vol.12868, pp. 149-165 (2021)
    extended abstract appeared at EuroCG'21
    < BibTeX >   < arXiv >   < Springer >
  • Algorithms for Floor Planning with Proximity Requirements
    J Klawitter, F Klesen, A Wolff
    appeared at CAAD Futures 2021 (2021)
    < arXiv >
  • Extending Partial Representations of Rectangular Duals with Given Contact Orientations
    S Chaplick, P Kindermann, J Klawitter, I Rutter, A Wolff
    Algorithms and Complexity (CIAC'21) (Tiziana Calamoneri, Federico Corò, eds.), LNCS, vol. 12701, pp. 340-353 (2021)
    < BibTeX >   < arXiv >     < Springer >    < Video >
  • Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings
    J Klawitter, P Stumpf
    Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), LNCS, vol. 12590, pp. 173-180 (2020)
    < BibTeX >  < arXiv >    < Springer >   < Slides >
  • The agreement distance of unrooted phylogenetic networks
    J Klawitter
    Discrete Mathematics & Theoretical Computer Science, vol. 22, no. 1 (2020)
    < BibTeX >   < arXiv >   < DMTCS >
  • Rearrangement operations on unrooted phylogenetic networks
    R Janssen, J Klawitter
    Theory and Applications of Graphs, vol. 6, no. 2, art. 6 (2019)
    < BibTeX >   < arXiv >   < TAG >
  • The agreement distance of rooted phylogenetic networks
    J Klawitter
    Discrete Mathematics & Theoretical Computer Science, vol. 21, no. 3 (2019)
    < BibTeX >   < arXiv >   < DMTCS >
  • On the Subnet Prune and Regraft Distance
    J Klawitter, S Linz
    Electronic Journal of Combinatorics, vol. 26, pp. 2.3 (2019)
    < BibTeX >   < arXiv >   < EJC >
  • The SNPR neighbourhood of tree-child networks
    J Klawitter
    Journal of Graph Algorithms and Applications, vol. 22, no. 2, pp. 329–355 (2018)
    < BibTeX >   < arXiv >   < JGAA >
  • Experimental Evaluation of Book Drawing Algorithms
    J Klawitter, T Mchedlidze, M Nöllenburg
    Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), LNCS, vol. 10692, pp. 224–238 (2018)
    < BibTeX >   < arXiv >   < Springer >
  • Combinatorial properties of triangle-free rectangle arrangements and the squarability problem
    J Klawitter, M Nöllenburg, T Ueckerdt
    Graph Drawing and Network Visualization (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), LNCS, vol. 9411, pp. 231–244 (2015)
    < BibTeX >   < arXiv >   < Springer >   < Slides >

Thesen

  • Spaces of phylogenetic networks
    PhD thesis, 2019
    < BibTeX >   < pdf >   < slides >
  • Algorithms for crossing minimisation in book drawings
    Master thesis, 2016
    < pdf >  
  • Transforming rectangles into squares
    Bachelor thesis, 2014
    < pdf >

Poster

  • Minimising Crossings in a Tree-Based Network
    J Klawitter, P Stumpf
    Poster session at Graph Drawing and Network Visualization (GD'19)
    < poster >   < abstract >
  • Game of Thrones relations and timeline
    J Klawitter, M Karmin
    Creative contest at Graph Drawing and Network Visualization (GD'18)
    < poster >   < website >
  • Heuristic Picker for Book Drawings
    J Klawitter, T Mchedlidze
    Poster session at Graph Drawing and Network Visualization (GD'16)
    *Best Poster Award*
    < poster >   < abstract >
  • MYTH
    J Klawitter, T Mchedlidze
    Creative contest at Graph Drawing and Network Visualization (GD'16)
    *Winner*
    < poster >   < website >
  • Tic Tac Toe
    J Klawitter
    Creative contest at Graph Drawing and Network Visualization (GD'15)
    < poster >   < website >