piwik-script

Deutsch Intern
Chair of Computer Science I - Algorithms and Complexity

Jonathan Klawitter

Jonathan Klawitter

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

  • Lukas Garbe: Segment number of maximal outerplanar graphs, Exam thesis
  • Felix Klesen: Algorithms for automated floor planning, Master thesis
  • Micheal May: Ein Algorithmus zur Optimierung einer Flächenaufteilung, Bachelor thesis

  • Graph Drawing
  • Combinatorial Phylogenetics

  • Since Oktober 2019:
    Postdoctoral fellow at Chair of Computer Science 1, University of Würzburg, Germany
  • September 2016 – August 2019:
    PhD at School of Computer Science, University of Auckland, New Zealand
  • Oktober 2014 – April 2016:
    Master in Computer Sience at Karlsruhe Institute of Technology, Germany
  • Oktober 2011 – Oktober 2014:
    Bachelor in Mathematics at Karlsruhe Institute of Technology, Germany
  • Oktober 2011 – Oktober 2014:
    Bachelor in Computer Science at Karlsruhe Institute of Technology, Germany

Online at dblp and Scholar.

Papers

  • Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings
    J Klawitter, P Stumpf
    appears at Graph Drawing and Network Visualization (GD'20) (2020)
    < arXiv >   < 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 >   < TGA >
  • 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 >

Theses

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

Posters

  • 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 >