Johannes Zink, M.Sc.
Johannes Zink
Universität Würzburg
Am Hubland

- 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)
- Summer term 2023:
- Lecture for Visualization of Graphs
- Winter term 2022/23:
- Lecture for Advanced Algorithms
- Summer term 2022:
- Exercises for Algorithmic Graph Theory
- Winter term 2021/22:
- Exercises for Computational Geometry
- Seminar Graph Visualization
- Summer term 2021:
- Exercises for Algorithmic Graph Theory
- Summer term 2020:
- Summer term 2019:
- Exercises for Algorithmic Graph Theory
- Seminar Graph Visualization in 3D
- Winter term 2018/19:
- Exercises for Algorithms and Data Structures
- Seminar Graph Visualization
- Summer term 2018:
- Exercises for Randomized Algorithms
- Summer term 2017:
- Student assistant in the exercises for Algorithmic Graph Theory
-
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]
-
Upward Planar Drawings with Three and More Slopes in Journal of Graph Algorithms and Applications (2023). 27(2) 49–70.
-
The Complexity of Finding Tangles 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.
-
Coloring Mixed and Directional Interval Graphs in Proc. 30th International Symposium on Graph Drawing and Network Visualization (GD’22), P. Angelini, R. von Hanxleden (eds.) (2022).
-
Layered Drawing of Undirected Graphs with Generalized Port Constraints in Computational Geometry: Theory and Applications (2022). 105--106 101886.
-
Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22) (2022). 53:1–6.
-
Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22) (2022). 18:1–7.
-
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs in Proc. 48th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG’22), M. Bekos, M. Kaufmann (eds.) (2022). 16 pages.
-
Robust Gateway Placement for Scalable LoRaWAN in Proc. 13th IFIP Wireless and Mobile Networking Conference (WMNC’21) (2021). 71–78.
-
Consistent Simplification of Polyline Tree Bundles 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 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 in Proc. 37th Europ. Workshop Comput. Geom. (EuroCG’21) (2021).
-
The Complexity of Finding Tangles in Proc. 36th Europ. Workshop Comput. Geom. (EuroCG’20) (2020).
-
Simplification of Polyline Bundles 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 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 in CoRR (2020). abs/2008.01252
-
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines in Proc. 31st International Symposium on Algorithms and Computation (ISAAC’20), LIPIcs (2020).
-
Recognizing Stick Graphs with and without Length Constraints in Journal of Graph Algorithms and Applications (2020). 24(4) 657–681.
-
Computing Height-Optimal Tangles Faster 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 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 in Computational Geometry: Theory and Applications (2019). 84 50–68.
-
Simplification of Polyline Bundles in Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19) (2019).
-
Computing Optimal Tangles Faster in Proc. 35th Europ. Workshop Comput. Geom. (EuroCG’19) (2019).
-
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends 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 in Proc. 10th Int. Colloquium on Graph Theory and Combinatorics (ICGT’18) (2018).
-
1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area in Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (eds.) (2018). 28:1–6.
-
1-Planar RAC Drawings with Bends (2017).
-
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition in Algorithms (2016). 9(3) article 53, 17 pages.
-
Beschleunigung von kräftebasierten Graphzeichenalgorithmen mittels wohlseparierten Paardekompositionen (Engl. Speeding up Force-Directed Graph Drawing Algorithms Using Well-Separated Pair Decompositions) (2015).
-
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition 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.