default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Zink 0001
Person information
- affiliation: University of Würzburg, Germany
Other persons with the same name
- Johannes Zink 0002
![[0009-0007-9978-9169]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0009-0007-9978-9169")
— Deutsches Elektronen-Synchrotron (DESY), Hamburg, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Johannes Zink:
Algorithms for Drawing Graphs and Polylines with Straight-Line Segments (Algorithmen zum Zeichnen von Graphen und Polygonzügen mittels Strecken). Würzburg University, Germany, 2024- [c21]Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. SoCG 2024: 20:1-20:16 - [c20]Joshua Geis, Johannes Zink:
From Planar via Outerplanar to Outerpath - Engineering NP-Hardness Constructions (Poster Abstract). GD 2024: 42:1-42:3 - [c19]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. SOFSEM 2024: 211-225 - [c18]Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Morphing Graph Drawings in the Presence of Point Obstacles. SOFSEM 2024: 240-254 - [c17]Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink:
Simultaneous Drawing of Layered Trees. WALCOM 2024: 47-61 - [i19]Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. CoRR abs/2403.13702 (2024) - 2023
- [j5]Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three and More Slopes. J. Graph Algorithms Appl. 27(2): 49-70 (2023) - [c16]Peter Schäfer, Sabine Storandt, Johannes Zink:
Optimal Polyline Simplification under the Local Fréchet Distance in 2D in (Near-)Quadratic Time. CCCG 2023: 225-238 - [c15]Jonathan Klawitter, Johannes Zink:
Tree Drawings with Columns. GD (1) 2023: 195-210 - [c14]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Mixed Interval Graphs. ISAAC 2023: 36:1-36:14 - [c13]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
The Complexity of Finding Tangles. SOFSEM 2023: 3-17 - [i18]Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink:
Simultaneous Drawing of Layered Trees. CoRR abs/2302.11952 (2023) - [i17]Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff, Johannes Zink:
Coloring and Recognizing Directed Interval Graphs. CoRR abs/2303.07960 (2023) - [i16]Jonathan Klawitter, Johannes Zink:
Tree Drawings with Columns. CoRR abs/2308.10811 (2023) - [i15]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. CoRR abs/2311.13523 (2023) - [i14]Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Morphing Graph Drawings in the Presence of Point Obstacles. CoRR abs/2311.14516 (2023) - [i13]Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Deciding the Feasibility and Minimizing the Height of Tangles. CoRR abs/2312.16213 (2023) - 2022
- [j4]Johannes Zink, Julian Walter, Joachim Baumeister, Alexander Wolff:
Layered drawing of undirected graphs with generalized port constraints. Comput. Geom. 105-106: 101886 (2022) - [c12]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. GD 2022: 418-431 - [c11]Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink:
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. WG 2022: 271-286 - [i12]Sabine Storandt, Johannes Zink:
Polyline Simplification under the Local Fréchet Distance has Subcubic Complexity in 2D. CoRR abs/2201.01344 (2022) - [i11]Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink:
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. CoRR abs/2202.11604 (2022) - [i10]Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. CoRR abs/2208.14250 (2022) - 2021
- [c10]Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Consistent Simplification of Polyline Tree Bundles. COCOON 2021: 231-243 - [c9]Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three and More Slopes. GD 2021: 149-165 - [c8]Frank Loh, Dominique Bau, Johannes Zink, Alexander Wolff, Tobias Hoßfeld:
Robust Gateway Placement for Scalable LoRaWAN. WMNC 2021: 71-78 - [i9]Jonathan Klawitter, Johannes Zink:
Upward Planar Drawings with Three Slopes. CoRR abs/2103.06801 (2021) - [i8]Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Consistent Simplification of Polyline Tree Bundles. CoRR abs/2108.10790 (2021) - 2020
- [j3]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Recognizing Stick Graphs with and without Length Constraints. J. Graph Algorithms Appl. 24(4): 657-681 (2020) - [c7]Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff:
Layered Drawing of Undirected Graphs with Generalized Port Constraints. GD 2020: 220-234 - [c6]Martin Koutecký, Johannes Zink:
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. ISAAC 2020: 18:1-18:17 - [c5]Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Simplification of Polyline Bundles. SWAT 2020: 35:1-35:20 - [i7]Ulrik Brandes, Julian Walter, Johannes Zink:
Erratum: Fast and Simple Horizontal Coordinate Assignment. CoRR abs/2008.01252 (2020) - [i6]Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff:
Layered Drawing of Undirected Graphs with Generalized Port Constraints. CoRR abs/2008.10583 (2020) - [i5]Martin Koutecký, Johannes Zink:
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. CoRR abs/2009.11840 (2020)
2010 – 2019
- 2019
- [j2]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact drawings of 1-planar graphs with right-angle crossings and few bends. Comput. Geom. 84: 50-68 (2019) - [c4]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. GD 2019: 3-17 - [c3]Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Computing Height-Optimal Tangles Faster. GD 2019: 203-215 - [i4]Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. CoRR abs/1907.05257 (2019) - [i3]Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Simplification of Polyline Bundles. CoRR abs/1907.05296 (2019) - 2018
- [c2]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. GD 2018: 137-151 - [i2]Moritz Beck, Johannes Blum, Myroslav Kryven, Andre Löffler, Johannes Zink:
Planar Steiner Orientation is NP-complete. CoRR abs/1804.07496 (2018) - [i1]Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink:
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. CoRR abs/1806.10044 (2018) - 2016
- [j1]Fabian Lipp, Alexander Wolff, Johannes Zink:
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms 9(3): 53 (2016) - 2015
- [c1]Fabian Lipp, Alexander Wolff, Johannes Zink:
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. GD 2015: 52-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
