Johannes Zink

According to our database, Johannes Zink authored at least 26 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Constrained and Ordered Level Planarity Parameterized by the Number of Levels.

Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink

CoRR, 2024

Simultaneous Drawing of Layered Trees.

Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink

Proceedings of the WALCOM: Algorithms and Computation, 2024

Morphing Graph Drawings in the Presence of Point Obstacles.

Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Outerplanar and Forest Storyplans.

Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Upward Planar Drawings with Three and More Slopes.

Jonathan Klawitter, Johannes Zink

J. Graph Algorithms Appl., 2023

Deciding the Feasibility and Minimizing the Height of Tangles.

Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink

CoRR, 2023

Coloring and Recognizing Directed Interval Graphs.

Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink

CoRR, 2023

The Complexity of Finding Tangles.

Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Coloring and Recognizing Mixed Interval Graphs.

Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Tree Drawings with Columns.

Jonathan Klawitter, Johannes Zink

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity in 2D.

Sabine Storandt, Johannes Zink

CoRR, 2022

Layered drawing of undirected graphs with generalized port constraints.

Johannes Zink, Julian Walter, Joachim Baumeister, Alexander Wolff

Comput. Geom., 2022

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs.

Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Coloring Mixed and Directional Interval Graphs.

Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Upward Planar Drawings with Three Slopes.

Jonathan Klawitter, Johannes Zink

CoRR, 2021

Robust Gateway Placement for Scalable LoRaWAN.

Frank Loh, Dominique Bau, Johannes Zink, Alexander Wolff, Tobias Hoßfeld

Proceedings of the 13th IFIP Wireless and Mobile Networking Conference, 2021

Consistent Simplification of Polyline Tree Bundles.

Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Recognizing Stick Graphs with and without Length Constraints.

Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink

J. Graph Algorithms Appl., 2020

Erratum: Fast and Simple Horizontal Coordinate Assignment.

Ulrik Brandes, Julian Walter, Johannes Zink

CoRR, 2020

Simplification of Polyline Bundles.

Joachim Spoerhase, Sabine Storandt, Johannes Zink

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines.

Martin Koutecký, Johannes Zink

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Compact drawings of 1-planar graphs with right-angle crossings and few bends.

Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink

Comput. Geom., 2019

Computing Height-Optimal Tangles Faster.

Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Stick Graphs with Length Constraints.

Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

Planar Steiner Orientation is NP-complete.

Moritz Beck, Johannes Blum, Myroslav Kryven, Andre Löffler, Johannes Zink

CoRR, 2018

2016

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition.

Fabian Lipp, Alexander Wolff, Johannes Zink

Algorithms, 2016