| Compact drawings of 1-planar graphs with right-angle crossings and few bends S Chaplick, F Lipp, A Wolff, J Zink Computational Geometry 84, 50-68, 2019 | 13 | 2019 |
| Faster force-directed graph drawing with the well-separated pair decomposition F Lipp, A Wolff, J Zink International Symposium on Graph Drawing, 52-59, 2015 | 11 | 2015 |
| Faster force-directed graph drawing with the well-separated pair decomposition F Lipp, A Wolff, J Zink Algorithms 9 (3), 53, 2016 | 8 | 2016 |
| Stick graphs with length constraints S Chaplick, P Kindermann, A Löffler, F Thiele, A Wolff, A Zaft, J Zink International Symposium on Graph Drawing and Network Visualization, 3-17, 2019 | 7* | 2019 |
| 1-bend RAC drawings of NIC-planar graphs in quadratic area S Chaplick, F Lipp, A Wolff, J Zink GD 2018, 2018 | 4 | 2018 |
| Robust Gateway Placement for Scalable LoRaWAN F Loh, D Bau, J Zink, A Wolff, T Hoßfeld 2021 13th IFIP Wireless and Mobile Networking Conference (WMNC), 71-78, 2021 | 3 | 2021 |
| Layered drawing of undirected graphs with generalized port constraints J Walter, J Zink, J Baumeister, A Wolff International Symposium on Graph Drawing and Network Visualization, 220-234, 2020 | 3 | 2020 |
| 31st International Symposium on Algorithms and Computation (ISAAC 2020) S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 3 | 2020 |
| Complexity of scheduling few types of jobs on related and unrelated machines M Koutecký, J Zink arXiv preprint arXiv:2009.11840, 2020 | 2 | 2020 |
| Simplification of polyline bundles J Spoerhase, S Storandt, J Zink arXiv preprint arXiv:1907.05296, 2019 | 2 | 2019 |
| 1-planar RAC drawings with bends J Zink Master’s thesis, Institut für Informatik, Universität Würzburg, 2017 | 2 | 2017 |
| Layered drawing of undirected graphs with generalized port constraints J Zink, J Walter, J Baumeister, A Wolff Computational Geometry 105, 101886, 2022 | 1 | 2022 |
| Erratum: Fast and Simple Horizontal Coordinate Assignment U Brandes, J Walter, J Zink arXiv preprint arXiv:2008.01252, 2020 | 1 | 2020 |
| Planar Steiner Orientation is NP-complete M Beck, J Blum, M Kryven, A Löffler, J Zink arXiv preprint arXiv:1804.07496, 2018 | 1 | 2018 |
| Polyline Simplification under the Local Fr\'echet Distance has Subcubic Complexity in 2D S Storandt, J Zink arXiv preprint arXiv:2201.01344, 2022 | | 2022 |
| Consistent Simplification of Polyline Tree Bundles Y Bosch, P Schäfer, J Spoerhase, S Storandt, J Zink International Computing and Combinatorics Conference, 231-243, 2021 | | 2021 |
| Upward Planar Drawings with Three and More Slopes J Klawitter, J Zink International Symposium on Graph Drawing and Network Visualization, 149-165, 2021 | | 2021 |
| The complexity of finding tangles O Firman, S Felsner, P Kindermann, A Ravsky, A Wolff, J Zink arXiv preprint arXiv:2002.12251, 2020 | | 2020 |
| Computing Height-Optimal Tangles Faster O Firman, P Kindermann, A Ravsky, A Wolff, J Zink International Symposium on Graph Drawing and Network Visualization, 203-215, 2019 | | 2019 |
| Computing optimal tangles faster O Firman, P Kindermann, A Ravsky, A Wolff, J Zink ArXiv report, 2019 | | 2019 |
