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

    • 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

    • 2022: 2nd place in the manual category of the Graph Drawing Live Challenge at the 30th International Symposium on Graph Drawing and Network Visualization (GD'22) in Tokyo, together with Felix Klesen
    • 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)

    • Joshua Geis: Upward-Planar Drawings of Outerpaths with Three Slopes (Bachelor Thesis, in German), 2022
      [pdf]

    • Vasil Alistarov: Computing Tangles Using a SAT Solver (Master Project), 2022
      [pdf]

    • Jonas Barth: Clear Drawing of Literary Networks Using the Sugiyama Framework (Bachelor Thesis, in German), 2022
      [pdf]

    • Florian Mittelstädt: About Coloring of Generalized Interval Graphs (Master Thesis, in German), 2022
      [pdf]

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

    2023[ to top ]
    • The Complexity of Finding Tangles Firman, Oksana; Kindermann, Philipp; Klemz, Boris; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’23), Lecture Notes in Computer Science, L. Gasieniec (ed.) (2023). 3–17.
    2022[ to top ]
    • Layered Drawing of Undirected Graphs with Generalized Port Constraints Zink, Johannes; Walter, Julian; Baumeister, Joachim; Wolff, Alexander in Computational Geometry: Theory and Applications (2022). 105--106 101886.
    • The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs Goeßmann, Ina; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Kobourov, Stephen G.; Kryven, Myroslav; Wolff, Alexander; Zink, Johannes in Proc. 48th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG’22), M. Bekos, M. Kaufmann (eds.) (2022). 16 pages.
    • 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) (2022). 53:1–6.
    • Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity Storandt, Sabine; Zink, Johannes in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22) (2022). 18:1–7.
    • Coloring Mixed and Directional Interval Graphs Gutowski, Grzegorz; Mittelstädt, Florian; Rutter, Ignaz; Spoerhase, Joachim; Wolff, Alexander; Zink, Johannes in Proc. 30th International Symposium on Graph Drawing and Network Visualization (GD’22), P. Angelini, R. von Hanxleden (eds.) (2022).
    2021[ to top ]
    • Robust Gateway Placement for Scalable LoRaWAN Loh, Frank; Bau, Dominique; Zink, Johannes; Wolff, Alexander; Hoßfeld, Tobias in Proc. 13th IFIP Wireless and Mobile Networking Conference (WMNC’21) (2021). 71–78.
    • Consistent Simplification of Polyline Tree Bundles Bosch, Yannick; Schäfer, Peter; Spoerhase, Joachim; Storandt, Sabine; Zink, Johannes in Proc. 27th International Computing and Combinatorics Conference (COCOON’21), C.-Y. Chen, W.-K. Hon, L.-J. Hung, C.-W. Lee (eds.) (2021).
    • Upward Planar Drawings with Three and More Slopes Klawitter, Jonathan; Zink, Johannes in Proc. 29th International Symposium on Graph Drawing and Network Visualization (GD’21), Lecture Notes in Computer Science, H. Purchase, I. Rutter (eds.) (2021).
    • Upward Planar Drawings with Three Slopes Klawitter, Jonathan; Zink, Johannes in Proc. 37th Europ. Workshop Comput. Geom. (EuroCG’21) (2021).
    2020[ to top ]
    • The Complexity of Finding Tangles Firman, Oksana; Felsner, Stefan; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 36th Europ. Workshop Comput. Geom. (EuroCG’20) (2020).
    • Simplification of Polyline Bundles Spoerhase, Joachim; Storandt, Sabine; Zink, Johannes in Proc. 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’20), LIPIcs, S. Albers (ed.) (2020). (Vol. 162) 35:1–35:20.
    • Layered Drawing of Undirected Graphs with Generalized Port Constraints Walter, Julian; Zink, Johannes; Baumeister, Joachim; Wolff, Alexander in Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD’20), Lecture Notes in Computer Science, D. Auber, P. Valtr (eds.) (2020).
    • Erratum: Fast and Simple Horizontal Coordinate Assignment Brandes, Ulrik; Walter, Julian; Zink, Johannes in CoRR (2020). abs/2008.01252
    • Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines Koutecký, Martin; Zink, Johannes in Proc. 31st International Symposium on Algorithms and Computation (ISAAC’20), LIPIcs (2020).
    • Recognizing Stick Graphs with and without Length Constraints Chaplick, Steven; Kindermann, Philipp; Löffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes in Journal of Graph Algorithms and Applications (2020). 24(4) 657–681.
    2019[ to top ]
    • Computing Height-Optimal Tangles Faster Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.) (2019).
    • Stick Graphs with Length Constraints Chaplick, Steven; Kindermann, Philipp; Löffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes in Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.) (2019).
    • Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends Chaplick, Steven; Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Computational Geometry: Theory and Applications (2019). 84 50–68.
    • Simplification of Polyline Bundles Spoerhase, Joachim; Storandt, Sabine; Zink, Johannes in Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19) (2019).
    • Computing Optimal Tangles Faster Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19) (2019).
    2018[ to top ]
    • Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends Chaplick, Steven; Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Proc. 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.) (2018).
    • Planar Steiner Orientation is NP-complete Beck, Moritz; Blum, Johannes; Kryven, Myroslav; Löffler, Andre; Zink, Johannes in Proc. 10th Int. Colloquium on Graph Theory and Combinatorics (ICGT’18) (2018).
    • 1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area Chaplick, Steven; Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (eds.) (2018). 28:1–6.
    2017[ to top ]
    • 1-Planar RAC Drawings with Bends Zink, Johannes (2017).
    2016[ to top ]
    • Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Algorithms (2016). 9(3) article 53, 17 pages.
    2015[ to top ]
    • Beschleunigung von kräftebasierten Graphzeichenalgorithmen mittels wohlseparierten Paardekompositionen (Engl. Speeding up Force-Directed Graph Drawing Algorithms Using Well-Separated Pair Decompositions) Zink, Johannes (2015).
    • Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD’15), Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.) (2015). (Vol. 9411) 52–59.