Johannes Zink, M.Sc.

2020

• 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]
   
  @inproceedings{ffkrwz-cft-EuroCG20, author = {Firman, Oksana and Felsner, Stefan and Kindermann, Philipp and Ravsky, Alexander and Wolff, Alexander and Zink, Johannes}, booktitle = {Proc. 36th Europ. Workshop Comput. Geom. (EuroCG'20)}, keywords = {myown}, title = {The Complexity of Finding Tangles}, year = 2020 }

2019

• Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Height-Optimal Tangles Faster. In: Archambault, D. und Tóth, C.D. (hrsg.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19). Springer-Verlag (2019).
  [ BibTeX ] [arxiv]
   
  @inproceedings{fkrwz2019tangles, author = {Firman, Oksana and Kindermann, Philipp and Ravsky, Alexander and Wolff, Alexander and Zink, Johannes}, booktitle = {Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19)}, editor = {Archambault, Daniel and Tóth, Csaba D.}, keywords = {myown}, month = {sep}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, title = {Computing Height-Optimal Tangles Faster}, year = 2019 }
• Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick Graphs with Length Constraints. In: Archambault, D. und Tóth, C.D. (hrsg.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19). Springer-Verlag (2019).
  [ BibTeX ] [slides] [arxiv]
   
  @inproceedings{ckltwzz2019stick, author = {Chaplick, Steven and Kindermann, Philipp and Löffler, Andre and Thiele, Florian and Wolff, Alexander and Zaft, Alexander and Zink, Johannes}, booktitle = {Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19)}, editor = {Archambault, Daniel and Tóth, Csaba D.}, keywords = {myown}, month = {sep}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, title = {Stick Graphs with Length Constraints}, year = 2019 }
• Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact drawings of 1-planar graphs with right-angle crossings and few bends. Comput. Geom. 84, 50-68 (2019).
  [ BibTeX ]
   
  @article{journals/comgeo/ChaplickLWZ19, author = {Chaplick, Steven and Lipp, Fabian and Wolff, Alexander and Zink, Johannes}, journal = {Comput. Geom.}, keywords = {myown}, pages = {50-68}, title = {Compact drawings of 1-planar graphs with right-angle crossings and few bends.}, volume = 84, year = 2019 }
• Spoerhase, J., Storandt, S., Zink, J.: Simplification of Polyline Bundles. Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19) (2019).
  [ BibTeX ] [slides] [arxiv]
   
  @inproceedings{ssz-spb-EuroCG19, author = {Spoerhase, Joachim and Storandt, Sabine and Zink, Johannes}, booktitle = {Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19)}, keywords = {myown}, title = {Simplification of Polyline Bundles}, year = 2019 }
• 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]
   
  @inproceedings{fkrwz-cft-EuroCG19, author = {Firman, Oksana and Kindermann, Philipp and Ravsky, Alexander and Wolff, Alexander and Zink, Johannes}, booktitle = {Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19)}, keywords = {myown}, title = {Computing Optimal Tangles Faster}, year = 2019 }

2018

• Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. In: Biedl, T. und Kerren, A. (hrsg.) Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD'18). Springer-Verlag (2018).
  [ BibTeX ] [slides] [arxiv]
   
  @inproceedings{clwz2018compact, author = {Chaplick, Steven and Lipp, Fabian and Wolff, Alexander and Zink, Johannes}, booktitle = {Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD'18)}, editor = {Biedl, Therese and Kerren, Andreas}, keywords = {myown}, month = {sep}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, title = {Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends}, year = 2018 }
• 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]
   
  @inproceedings{bbklz-psonpc-ICGT18, author = {Beck, Moritz and Blum, Johannes and Kryven, Myroslav and Löffler, Andre and Zink, Johannes}, booktitle = {Proc. 10th Int. Colloquium on Graph Theory and Combinatorics (ICGT'18)}, keywords = {myown}, title = {Planar Steiner Orientation is NP-complete}, year = 2018 }
• Chaplick, S., Lipp, F., Wolff, A., Zink, J.: 1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area. In: Korman, M. und Mulzer, W. (hrsg.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG'18). S. 28:1--6 (2018).
  [ BibTeX ] [ URL ] [slides]
   
  @inproceedings{clwz-1brac-EuroCG18, author = {Chaplick, Steven and Lipp, Fabian and Wolff, Alexander and Zink, Johannes}, booktitle = {Proc. 34th Europ. Workshop Comput. Geom. (EuroCG'18)}, editor = {Korman, Matias and Mulzer, Wolfgang}, keywords = {myown}, pages = {28:1--6}, title = {1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area}, year = 2018 }

2017

• Zink, J.: 1-Planar RAC Drawings with Bends, http://www1.pub.informatik.uni-wuerzburg.de/pub/theses/2017-zink-master.pdf, (2017).
  [ BibTeX ] [ URL ]
   
  @mastersthesis{z-1prac-MTh17, author = {Zink, Johannes}, keywords = {myown}, school = {Institut für Informatik, Universität Würzburg}, title = {1-Planar RAC Drawings with Bends}, year = 2017 }

2016

• Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms. 9, article 53, 17 pages (2016).
  [ Abstract ] [ BibTeX ] [ URL ] [ DOI ]
   
  The force-directed paradigm is one of the few generic approaches to drawing graphs. Since force-directed algorithms can be extended easily, they are used frequently. Most of these algorithms are, however, quite slow on large graphs, as they compute a quadratic number of forces in each iteration. We give a new algorithm that takes only \($O(m+n \log n)$\) time per iteration when laying out a graph with \($n$\) vertices and \($m$\) edges. Our algorithm approximates the true forces using the so-called well-separated pair decomposition. We perform experiments on a large number of graphs and show that we can strongly reduce the runtime, even on graphs with less than a hundred vertices, without a significant influence on the quality of the drawings (in terms of the number of crossings and deviation in edge lengths).
  @article{lwz-ffdgd-Algorithms16, abstract = {The force-directed paradigm is one of the few generic approaches to drawing graphs. Since force-directed algorithms can be extended easily, they are used frequently. Most of these algorithms are, however, quite slow on large graphs, as they compute a quadratic number of forces in each iteration. We give a new algorithm that takes only $O(m+n \log n)$ time per iteration when laying out a graph with $n$ vertices and $m$ edges. Our algorithm approximates the true forces using the so-called well-separated pair decomposition. We perform experiments on a large number of graphs and show that we can strongly reduce the runtime, even on graphs with less than a hundred vertices, without a significant influence on the quality of the drawings (in terms of the number of crossings and deviation in edge lengths).}, author = {Lipp, Fabian and Wolff, Alexander and Zink, Johannes}, journal = {Algorithms}, keywords = {myown}, number = 3, pages = {article 53, 17 pages}, title = {Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition}, volume = 9, year = 2016 }

2015

• 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]
   
  @misc{z-bkgwp-BTh15, author = {Zink, Johannes}, howpublished = {Bachelor's Thesis, Institut für Informatik, Universität Würzburg}, keywords = {myown}, note = {In German}, title = {Beschleunigung von kräftebasierten Graphzeichenalgorithmen mittels wohlseparierten Paardekompositionen (Engl. Speeding up Force-Directed Graph Drawing Algorithms Using Well-Separated Pair Decompositions)}, year = 2015 }
• Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. In: Di Giacomo, E. und Lubiw, A. (hrsg.) Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD'15). S. 52--59. Springer International Publishing (2015).
  [ BibTeX ] [ URL ] [ DOI ]
   
  @inproceedings{lwz-ffggd-GD15, author = {Lipp, Fabian and Wolff, Alexander and Zink, Johannes}, booktitle = {Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD'15)}, editor = {Di Giacomo, Emilio and Lubiw, Anna}, keywords = {myown}, pages = {52--59}, publisher = {Springer International Publishing}, series = {Lecture Notes in Computer Science}, title = {Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition}, volume = 9411, year = 2015 }