Johannes Zink

From MaRDI portal
Person:1725746



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Drawing trees and cacti with integer edge lengths on a polynomial-size grid (poster abstract)2026-09-21Paper
Using reinforcement learning to optimize the global and local crossing number (poster abstract)2026-09-21Paper
Linear layouts of graphs with priority queues2026-08-11Paper
Unbent collections of orthogonal drawings2026-07-10Paper
Deciding the feasibility and minimizing the height of tangles
Journal of Graph Algorithms and Applications
2026-04-22Paper
Morphing graph drawings in the presence of point obstacles
Journal of Computer and System Sciences
2026-02-11Paper
Constrained and ordered level planarity parameterized by the number of levels2025-11-24Paper
From planar via outerplanar to outerpath -- engineering NP-hardness constructions (poster abstract)2025-10-07Paper
Constrained and ordered level planarity parameterized by the number of levels
Journal of Computational Geometry
2025-08-28Paper
Coloring and recognizing mixed interval graphs2025-07-24Paper
Complexity of scheduling few types of jobs on related and unrelated machines
Journal of Scheduling
2025-05-12Paper
Simplification of polyline bundles of graphs and trees
Journal of Computational Geometry
2025-04-23Paper
Simultaneous drawing of layered trees2024-07-19Paper
Tree drawings with columns2024-06-21Paper
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
(available as arXiv preprint)
2023-11-14Paper
Simplification of Polyline Bundles
(available as arXiv preprint)
2023-11-02Paper
Coloring mixed and directional interval graphs
Lecture Notes in Computer Science
2023-08-16Paper
The complexity of finding tangles
Lecture Notes in Computer Science
2023-08-14Paper
The segment number: algorithms and universal lower bounds for some classes of planar graphs
Graph-Theoretic Concepts in Computer Science
2023-05-05Paper
Consistent simplification of polyline tree bundles
(available as arXiv preprint)
2023-03-30Paper
Upward Planar Drawings with Three and More Slopes
Journal of Graph Algorithms and Applications
2023-03-30Paper
Upward planar drawings with three and more slopes
(available as arXiv preprint)
2022-07-01Paper
Layered drawing of undirected graphs with generalized port constraints
Computational Geometry
2022-06-13Paper
Layered Drawing of Undirected Graphs with Generalized Port Constraints
Lecture Notes in Computer Science
2021-12-01Paper
Recognizing stick graphs with and without length constraints
Journal of Graph Algorithms and Applications
2020-12-18Paper
Stick graphs with length constraints
(available as arXiv preprint)
2020-10-26Paper
Computing height-optimal tangles faster
(available as arXiv preprint)
2020-10-26Paper
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Computational Geometry
2019-10-25Paper
Faster force-directed graph drawing with the well-separated pair decomposition
Algorithms
2019-03-26Paper
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Lecture Notes in Computer Science
2019-02-15Paper
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
Lecture Notes in Computer Science
2017-02-10Paper


Research outcomes over time


This page was built for person: Johannes Zink