Folgen
Johannes Zink
Johannes Zink
Bestätigte E-Mail-Adresse bei uni-wuerzburg.de
Titel
Zitiert von
Zitiert von
Jahr
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
152019
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
122015
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
112021
Faster force-directed graph drawing with the well-separated pair decomposition
F Lipp, A Wolff, J Zink
Algorithms 9 (3), 53, 2016
92016
Layered drawing of undirected graphs with generalized port constraints
J Zink, J Walter, J Baumeister, A Wolff
Computational Geometry 105, 101886, 2022
82022
Complexity of scheduling few types of jobs on related and unrelated machines
M Koutecký, J Zink
arXiv preprint arXiv:2009.11840, 2020
72020
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
72020
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
52018
Upward planar drawings with three and more slopes
J Klawitter, J Zink
International Symposium on Graph Drawing and Network Visualization, 149-165, 2021
32021
Erratum: Fast and simple horizontal coordinate assignment
U Brandes, J Walter, J Zink
arXiv preprint arXiv:2008.01252, 2020
32020
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
32020
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
32019
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
22022
Simplification of polyline bundles
J Spoerhase, S Storandt, J Zink
arXiv preprint arXiv:1907.05296, 2019
22019
Planar Steiner Orientation is NP-complete
M Beck, J Blum, M Kryven, A Löffler, J Zink
arXiv preprint arXiv:1804.07496, 2018
22018
1-planar RAC drawings with bends
J Zink
Master’s thesis, Institut für Informatik, Universität Würzburg, 2017
22017
Coloring and recognizing directed interval graphs
G Gutowski, K Junosza-Szaniawski, F Klesen, P Rzążewski, A Wolff, ...
arXiv preprint arXiv:2303.07960, 2023
12023
The complexity of finding tangles
O Firman, P Kindermann, B Klemz, A Ravsky, A Wolff, J Zink
International Conference on Current Trends in Theory and Practice of …, 2023
12023
The segment number: algorithms and universal lower bounds for some classes of planar graphs
I Goeßmann, J Klawitter, B Klemz, F Klesen, S Kobourov, M Kryven, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 271-286, 2022
12022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20