( en | de | ru )

 

Disambiguation of "Zink, Johannes"

Author of the publication

copydeleteadd this publication to your clipboard
Layered Drawing of Undirected Graphs with Generalized Port Constraints

, , , and . Proc. 28th Int. Symp. Graph Drawing & Network Vis. (GD'20), volume 12590 of Lecture Notes in Computer Science, page 220--234. Springer-Verlag, (2021)
DOI: 10.1007/978-3-030-68766-3_18

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sabrina Zink

Sabrina Zink

Uwe Zink

Petra Zink

Fritz Zink

 

Other publications of authors with the same name

Tree Drawings with Columns, and . Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), page 195--210. Springer, (2023)Planar Steiner Orientation is NP-complete, , , , and . The 34th Symposium on Computational Geometry: Young Researchers Forum, (2018)Robust Gateway Placement for Scalable LoRaWAN., , , , and . WMNC, page 71-78. IEEE, (2021)Algorithms for Drawing Graphs and Polylines with Straight-Line Segments. (2024)Dissertation, Universität Würzburg.Complexity of scheduling few types of jobs on related and unrelated machines, and . Journal of Scheduling, (2025)Simultaneous Drawing of Layered Trees, , , , and . Proc. 18th International Conference and Workshops on Algorithms and Computation (WALCOM'24), page 47--61. Springer, (2024)Upward Planar Drawings with Three and More Slopes, and . Journal of Graph Algorithms and Applications, 27 (2): 49--70 (2023)Recognizing Stick Graphs with and without Length Constraints, , , , , , and . Journal of Graph Algorithms and Applications, 24 (4): 657--681 (2020)Special Issue on Selected Papers from GD 2020.Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines, and . Journal of Scheduling, (2024)to appear.Beschleunigung von kräftebasierten Graphzeichenalgorithmen mittels wohlseparierten Paardekompositionen (Engl. Speeding up Force-Directed Graph Drawing Algorithms Using Well-Separated Pair Decompositions). Bachelor Thesis, Institut für Informatik, Universität Würzburg, (2015)Bachelor Thesis, Universität Würzburg. (in German).