| 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 | 15 | 2019 |
| 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 | 14 | 2021 |
| Faster force-directed graph drawing with the well-separated pair decomposition F Lipp, A Wolff, J Zink Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015 | 12 | 2015 |
| Faster force-directed graph drawing with the well-separated pair decomposition F Lipp, A Wolff, J Zink Algorithms 9 (3), 53, 2016 | 9 | 2016 |
| Layered drawing of undirected graphs with generalized port constraints J Zink, J Walter, J Baumeister, A Wolff Computational Geometry 105, 101886, 2022 | 8 | 2022 |
| Complexity of scheduling few types of jobs on related and unrelated machines M Koutecký, J Zink arXiv preprint arXiv:2009.11840, 2020 | 8 | 2020 |
| 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 | 8* | 2019 |
| Layered drawing of undirected graphs with generalized port constraints J Walter, J Zink, J Baumeister, A Wolff Graph Drawing and Network Visualization: 28th International Symposium, GD …, 2020 | 7 | 2020 |
| 1-bend RAC drawings of NIC-planar graphs in quadratic area S Chaplick, F Lipp, A Wolff, J Zink GD 2018, 2018 | 5 | 2018 |
| Upward planar drawings with three and more slopes J Klawitter, J Zink International Symposium on Graph Drawing and Network Visualization, 149-165, 2021 | 3 | 2021 |
| Erratum: Fast and simple horizontal coordinate assignment U Brandes, J Walter, J Zink arXiv preprint arXiv:2008.01252, 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 |
| 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 | 3 | 2019 |
| Simplification of polyline bundles J Spoerhase, S Storandt, J Zink arXiv preprint arXiv:1907.05296, 2019 | 3 | 2019 |
| Coloring mixed and directional interval graphs G Gutowski, F Mittelstädt, I Rutter, J Spoerhase, A Wolff, J Zink International Symposium on Graph Drawing and Network Visualization, 418-431, 2022 | 2 | 2022 |
| Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity in 2D. S Storandt, J Zink arXiv preprint arXiv 2201, 2022 | 2 | 2022 |
| Consistent Simplification of Polyline Tree Bundles Y Bosch, P Schäfer, J Spoerhase, S Storandt, J Zink Computing and Combinatorics: 27th International Conference, COCOON 2021 …, 2021 | 2 | 2021 |
| Planar Steiner Orientation is NP-complete M Beck, J Blum, M Kryven, A Löffler, J Zink arXiv preprint arXiv:1804.07496, 2018 | 2 | 2018 |
| 1-planar RAC drawings with bends J Zink Master¢s thesis, Institut für Informatik, Universität Würzburg, 2017 | 2 | 2017 |
| Constrained and ordered level planarity parameterized by the number of levels V Blažej, B Klemz, F Klesen, MD Sieper, A Wolff, J Zink arXiv preprint arXiv:2403.13702, 2024 | 1 | 2024 |
