piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms and Complexity

    Johannes Zink, M.Sc.

    Johannes Zink

    Lehrstuhl für Informatik I
    Universität Würzburg
    Am Hubland
    97074 Würzburg
    Deutschland
    Building: M4
    Room: 1.007
    Phone: +49 0 931-31-88038
    ORCID: https://orcid.org/0000-0002-7398-718X

    • Theoretical and applied graph drawing
    • Algorithmic problems and their complexity

    • Since 2018: Research assistant and PhD student at Chair of Computer Science I, University of Würzburg
    • 2015–2017: Master studies in computer science at the University of Würzburg
    • 2012–2015: Bachelor studies in computer science at the University of Würzburg

    • 2020: 1st place in the manual category of the Graph Drawing Live Challenge at the 28th International Symposium on Graph Drawing and Network Visualization (GD'20) in Vancouver (online), together with Jonathan Klawitter
    • 2018: 1st place in the manual category of the Graph Drawing Live Challenge at the 26th International Symposium on Graph Drawing and Network Visualization (GD'18) in Barcelona, together with Myroslav Kryven
    • 2015–2017: Deutschlandstipendium (“Germany-scholarship”)
    • 2016: Prize by the Institute of Computer Science, University of Würzburg for excellent academic achievements with an outstanding bachelor thesis (sponsored by denkbares GmbH)

    • Lukas Brückner: Orthogonal Drawing as a Coloring Problem in Perfect Graphs (Bachelor Thesis, in German), 2021
      [pdf]

    • Dominique Bau: Algorithm Engineering for a Geometric Set Cover Problem (Master Thesis, in German), 2021
      [pdf]

    • Julian Walter: A Variant of Sugiyama's Algorithm for Undirected Graphs with Port Constraints (Master Thesis, in German), 2020
      [pdf], [slides]

    • Julian Walter: Partial Zooming in Large Network Graphs (Master Project, in German), 2019
      [pdf], [slides]

    • Chris Rettner: Flipped Bitonic st-Orderings of Upward Plane Graphs (Bachelor Thesis), 2019
      [pdf]

    2022

    • 1.
      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. Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22). pp. 53:1–6 (2022).
      [ BibTeX ] [ URL ] [arxiv]
       
    • 2.
      Storandt, S., Zink, J.: Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity. Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22). pp. 18:1–7 (2022).
      [ BibTeX ] [ URL ] [arxiv]
       

    2021

    • 1.
      Loh, F., Bau, D., Zink, J., Wolff, A., Hoßfeld, T.: Robust Gateway Placement for Scalable LoRaWAN. Proc. 13th IFIP Wireless and Mobile Networking Conference (WMNC’21). pp. 71–78. IEEE (2021).
      [ BibTeX ]
       
    • 2.
      Bosch, Y., Schäfer, P., Spoerhase, J., Storandt, S., Zink, J.: Consistent Simplification of Polyline Tree Bundles. Proc. 27th International Computing and Combinatorics Conference (COCOON’21) (2021).
      [ BibTeX ] [arxiv]
       
    • 3.
      Klawitter, J., Zink, J.: Upward Planar Drawings with Three and More Slopes. In: Purchase, H. and Rutter, I. (eds.) Proc. 29th International Symposium on Graph Drawing and Network Visualization (GD’21). Springer-Verlag (2021).
      [ BibTeX ] [arxiv]
       
    • 4.
      Klawitter, J., Zink, J.: Upward Planar Drawings with Three Slopes. Proc. 37th Europ. Workshop Comput. Geom. (EuroCG’21) (2021).
      [ BibTeX ] [arxiv]
       

    2020

    • 1.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: The Complexity of Finding Tangles. In: Auber, D. and Valtr, P. (eds.) Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD’20). Springer-Verlag (2020).
      [ BibTeX ] [arxiv]
       
    • 2.
      Spoerhase, J., Storandt, S., Zink, J.: Simplification of Polyline Bundles. In: Albers, S. (ed.) Proc. 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’20). pp. 35:1–35:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 3.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: The Complexity of Finding Tangles. Proc. 36th Europ. Workshop Comput. Geom. (EuroCG’20) (2020).
      [ BibTeX ] [slides] [arxiv]
       
    • 4.
      Walter, J., Zink, J., Baumeister, J., Wolff, A.: Layered Drawing of Undirected Graphs with Generalized Port Constraints. In: Auber, D. and Valtr, P. (eds.) Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD’20). Springer-Verlag (2020).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 5.
      Brandes, U., Walter, J., Zink, J.: Erratum: Fast and Simple Horizontal Coordinate Assignment. CoRR. abs/2008.01252, (2020).
      [ BibTeX ] [arxiv]
       
    • 6.
      Koutecký, M., Zink, J.: Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. Proc. 31st International Symposium on Algorithms and Computation (ISAAC’20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 7.
      Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Recognizing Stick Graphs with and without Length Constraints. Journal of Graph Algorithms and Applications. 24, 657–681 (2020).
      [ BibTeX ] [ URL ] [ DOI ]
       

    2019

    • 1.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Height-Optimal Tangles Faster. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD’19). Springer-Verlag (2019).
      [ BibTeX ] [ DOI ] [arxiv]
       
    • 2.
      Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick Graphs with Length Constraints. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD’19). Springer-Verlag (2019).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 3.
      Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. Computational Geometry: Theory and Applications. 84, 50–68 (2019).
      [ BibTeX ] [ URL ] [ DOI ] [arxiv]
       
    • 4.
      Spoerhase, J., Storandt, S., Zink, J.: Simplification of Polyline Bundles. Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19) (2019).
      [ BibTeX ] [slides] [arxiv]
       
    • 5.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Optimal Tangles Faster. Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19) (2019).
      [ BibTeX ] [slides] [arxiv]
       

    2018

    • 1.
      Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. In: Biedl, T. and Kerren, A. (eds.) Proc. 26th International Symposium on Graph Drawing and Network Visualization (GD’18). Springer-Verlag (2018).
      [ BibTeX ] [ DOI ] [slides] [arxiv]
       
    • 2.
      Beck, M., Blum, J., Kryven, M., Löffler, A., Zink, J.: Planar Steiner Orientation is NP-complete. Proc. 10th Int. Colloquium on Graph Theory and Combinatorics (ICGT’18) (2018).
      [ BibTeX ] [arxiv]
       
    • 3.
      Chaplick, S., Lipp, F., Wolff, A., Zink, J.: 1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area. In: Korman, M. and Mulzer, W. (eds.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18). pp. 28:1–6 (2018).
      [ BibTeX ] [ URL ] [slides]
       

    2017

    • 1.
      Zink, J.: 1-Planar RAC Drawings with Bends, http://www1.pub.informatik.uni-wuerzburg.de/pub/theses/2017-zink-master.pdf, (2017).
      [ BibTeX ] [ URL ]
       

    2016

    • 1.
      Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms. 9, article 53, 17 pages (2016).
      [ BibTeX ] [ URL ] [ DOI ]
       

    2015

    • 1.
      Zink, J.: Beschleunigung von kräftebasierten Graphzeichenalgorithmen mittels wohlseparierten Paardekompositionen (Engl. Speeding up Force-Directed Graph Drawing Algorithms Using Well-Separated Pair Decompositions), http://www1.pub.informatik.uni-wuerzburg.de/pub/theses/2015-zink-bachelor.pdf, (2015).
      [ BibTeX ] [ URL ] [slides]
       
    • 2.
      Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. In: Di Giacomo, E. and Lubiw, A. (eds.) Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD’15). pp. 52–59. Springer International Publishing (2015).
      [ BibTeX ] [ URL ] [ DOI ]