Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. - Fabian Lipp; Alexander Wolff 001; Johannes Zink 001 (Algorithms, 2016)

Planar Steiner Orientation is NP-complete. - Moritz Beck 001; Johannes Blum 001; Myroslav Kryven; Andre Löffler; Johannes Zink 001 (CoRR, 2018)

Stick Graphs with Length Constraints. - Steven Chaplick; Philipp Kindermann; Andre Löffler; Florian Thiele; Alexander Wolff 001; Alexander Zaft; Johannes Zink 001 (GD, 2019)

Computing Height-Optimal Tangles Faster. - Oksana Firman; Philipp Kindermann; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (GD, 2019)

Compact drawings of 1-planar graphs with right-angle crossings and few bends. - Steven Chaplick; Fabian Lipp; Alexander Wolff 001; Johannes Zink 001 (Comput. Geom., 2019)

Simplification of Polyline Bundles. - Joachim Spoerhase; Sabine Storandt; Johannes Zink 001 (SWAT, 2020)

Erratum: Fast and Simple Horizontal Coordinate Assignment. - Ulrik Brandes; Julian Walter; Johannes Zink 001 (CoRR, 2020)

Recognizing Stick Graphs with and without Length Constraints. - Steven Chaplick; Philipp Kindermann; Andre Löffler; Florian Thiele; Alexander Wolff 001; Alexander Zaft; Johannes Zink 001 (J. Graph Algorithms Appl., 2020)

Consistent Simplification of Polyline Tree Bundles. - Yannick Bosch; Peter Schäfer; Joachim Spoerhase; Sabine Storandt; Johannes Zink 001 (COCOON, 2021)

Robust Gateway Placement for Scalable LoRaWAN. - Frank Loh; Dominique Bau; Johannes Zink 001; Alexander Wolff 001; Tobias Hoßfeld (WMNC, 2021)

Upward Planar Drawings with Three Slopes. - Jonathan Klawitter; Johannes Zink 001 (CoRR, 2021)

Coloring Mixed and Directional Interval Graphs. - Grzegorz Gutowski; Florian Mittelstädt; Ignaz Rutter; Joachim Spoerhase; Alexander Wolff 001; Johannes Zink 001 (GD, 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 001; Johannes Zink 001 (WG, 2022)

Layered drawing of undirected graphs with generalized port constraints. - Johannes Zink 001; Julian Walter; Joachim Baumeister; Alexander Wolff 001 (Comput. Geom., 2022)

Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity in 2D. - Sabine Storandt; Johannes Zink 001 (CoRR, 2022)

Optimal Polyline Simplification under the Local Fréchet Distance in 2D in (Near-)Quadratic Time. - Peter Schäfer; Sabine Storandt; Johannes Zink 001 (CCCG, 2023)

Tree Drawings with Columns. - Jonathan Klawitter; Johannes Zink 001 (GD (1), 2023)

Coloring and Recognizing Mixed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (ISAAC, 2023)

The Complexity of Finding Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2023)

Coloring and Recognizing Directed Interval Graphs. - Grzegorz Gutowski; Konstanty Junosza-Szaniawski; Felix Klesen; Pawel Rzazewski; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

Deciding the Feasibility and Minimizing the Height of Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

Upward Planar Drawings with Three and More Slopes. - Jonathan Klawitter; Johannes Zink 001 (J. Graph Algorithms Appl., 2023)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels. - Václav Blazej; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SoCG, 2024)

From Planar via Outerplanar to Outerpath - Engineering NP-Hardness Constructions (Poster Abstract). - Joshua Geis; Johannes Zink 001 (GD, 2024)

Outerplanar and Forest Storyplans. - Jirí Fiala 001; Oksana Firman; Giuseppe Liotta; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Morphing Graph Drawings in the Presence of Point Obstacles. - Oksana Firman; Tim Hegemann; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2024)

Simultaneous Drawing of Layered Trees. - Julia Katheder; Stephen G. Kobourov; Axel Kuckuk; Maximilian Pfister 002; Johannes Zink 001 (WALCOM, 2024)

Algorithms for Drawing Graphs and Polylines with Straight-Line Segments (Algorithmen zum Zeichnen von Graphen und Polygonzügen mittels Strecken) - Johannes Zink 001 (2024)

Linear Layouts of Graphs with Priority Queues. - Emilio Di Giacomo; Walter Didimo; Henry Förster; Torsten Ueckerdt; Johannes Zink 001 (WADS, 2025)

Unbent Collections of Orthogonal Drawings. - Todor Antic; Giuseppe Liotta; Tomás Masarík; Giacomo Ortali; Matthias Pfretzschner; Peter Stumpf; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2025)

Complexity of scheduling few types of jobs on related and unrelated machines. - Martin Koutecký; Johannes Zink 001 (J. Sched., 2025)

Exploring MLLMs Perception of Network Visualization Principles. - Jacob Miller 001; Markus Wallinger; Ludwig Felder; Timo Brand; Henry Förster; Johannes Zink 001; Chunyang Chen; Stephen G. Kobourov (CoRR, 2025)

A CDE-based data structure for radiotherapeutic decision-making in breast cancer. - Fabio Dennstädt; Maximilian Schmalfuss; Johannes Zink 001; Janna Hastings; Roberto Gaio; Max Schmerder; Nikola Cihoric; Paul Martin Putora (BMC Medical Informatics Decis. Mak., 2025)