| Publication | Date of Publication | Type |
|---|
Bounding and computing obstacle numbers of graphs
(available as arXiv preprint) | N/A | Paper |
| Universal quality metrics for graph drawings: which graphs excite us most? | 2026-09-21 | Paper |
| Optimizing wiggle in storylines | 2026-09-21 | Paper |
| Recognizing 2-layer and outer k-planar graphs | 2026-08-11 | Paper |
| Unbent collections of orthogonal drawings | 2026-07-10 | Paper |
| Adjacency graphs of polyhedral surfaces | 2026-04-27 | Paper |
Deciding the feasibility and minimizing the height of tangles
Journal of Graph Algorithms and Applications | 2026-04-22 | Paper |
Morphing graph drawings in the presence of point obstacles
Journal of Computer and System Sciences | 2026-02-11 | Paper |
| Eliminating crossings in ordered graphs | 2025-12-02 | Paper |
| Constrained and ordered level planarity parameterized by the number of levels | 2025-11-24 | Paper |
Outside-obstacle representations with all vertices on the outer face
CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
| Graph harvester (software abstract) | 2025-10-07 | Paper |
| Storylines with a protagonist | 2025-10-07 | Paper |
| Bounding the treewidth of outer k-planar graphs via triangulations | 2025-10-07 | Paper |
| The price of upwardness | 2025-10-07 | Paper |
Parameterized approaches to orthogonal compaction
Journal of Computer and System Sciences | 2025-09-29 | Paper |
Constrained and ordered level planarity parameterized by the number of levels
Journal of Computational Geometry | 2025-08-28 | Paper |
| Coloring and recognizing mixed interval graphs | 2025-07-24 | Paper |
| Bounding and computing obstacle numbers of graphs | 2025-06-19 | Paper |
| The parametrized complexity of the segment number | 2024-10-14 | Paper |
| A simple pipeline for orthogonal graph drawing | 2024-10-14 | Paper |
Bounding and computing obstacle numbers of graphs
SIAM Journal on Discrete Mathematics | 2024-05-22 | Paper |
Adjacency graphs of polyhedral surfaces
Discrete & Computational Geometry | 2024-05-21 | Paper |
The Computational Complexity of the ChordLink Model
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
| Planar L-drawings of directed graphs | 2023-12-16 | Paper |
Morphing planar graph drawings through 3D
CGT. Computing in Geometry and Topology | 2023-12-16 | Paper |
scientific article; zbMATH DE number 7759289 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
The Complexity of Drawing Graphs on Few Lines and Few Planes
Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
Morphing rectangular duals
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Coloring mixed and directional interval graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Outside-obstacle representations with all vertices on the outer face
Lecture Notes in Computer Science | 2023-08-16 | Paper |
The complexity of finding tangles
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Visualizing multispecies coalescent trees: drawing gene trees inside species trees
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Parameterized approaches to orthogonal compaction
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Morphing planar graph drawings through 3D
Lecture Notes in Computer Science | 2023-08-14 | Paper |
An efficient and effective approximation algorithm for the Map Labeling Problem
Lecture Notes in Computer Science | 2023-05-08 | Paper |
The segment number: algorithms and universal lower bounds for some classes of planar graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Extending partial representations of rectangular duals with given contact orientations
(available as arXiv preprint) | 2023-03-22 | Paper |
Stabbing rectangles by line segments -- how decomposition reduces the shallow-cell complexity
(available as arXiv preprint) | 2022-07-21 | Paper |
Layered drawing of undirected graphs with generalized port constraints
Computational Geometry | 2022-06-13 | Paper |
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
Theoretical Computer Science | 2022-05-10 | Paper |
Minimum rectilinear polygons for given angle sequences
Computational Geometry | 2021-12-15 | Paper |
Layered Drawing of Undirected Graphs with Generalized Port Constraints
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Multi-level Steiner trees
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
Bundled crossings revisited
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
Recognizing stick graphs with and without length constraints
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
Multi-Level Steiner Trees.
(available as arXiv preprint) | 2020-12-16 | Paper |
| Drawing graphs on few lines and few planes | 2020-11-12 | Paper |
Stick graphs with length constraints
(available as arXiv preprint) | 2020-10-26 | Paper |
Representing graphs and hypergraphs by touching polygons in 3D
(available as arXiv preprint) | 2020-10-26 | Paper |
Bundled crossings revisited
(available as arXiv preprint) | 2020-10-26 | Paper |
Computing height-optimal tangles faster
(available as arXiv preprint) | 2020-10-26 | Paper |
On arrangements of orthogonal circles
(available as arXiv preprint) | 2020-10-26 | Paper |
Line and plane cover numbers revisited
(available as arXiv preprint) | 2020-10-26 | Paper |
Variants of the segment number of a graph
(available as arXiv preprint) | 2020-10-26 | Paper |
Angle covers: algorithms and complexity
(available as arXiv preprint) | 2020-07-22 | Paper |
| Analysis of expression profile and gene variation via development of methods for next generation sequencing data | 2020-01-28 | Paper |
| Analysis of expression profile and gene variation via development of methods for next generation sequencing data | 2020-01-28 | Paper |
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Computational Geometry | 2019-10-25 | Paper |
Drawing binary tanglegrams: an experimental evaluation
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Drawing graphs on few circles and few spheres
Journal of Graph Algorithms and Applications | 2019-07-12 | Paper |
Faster force-directed graph drawing with the well-separated pair decomposition
Algorithms | 2019-03-26 | Paper |
Computing storyline visualizations with few block crossings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Planar L-drawings of directed graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Beyond outerplanarity
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Lecture Notes in Computer Science | 2019-02-15 | Paper |
The hardness of approximating set cover
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
| On the maximum crossing number | 2018-06-15 | Paper |
Drawing graphs on few circles and few spheres
(available as arXiv preprint) | 2018-06-05 | Paper |
Approximating the generalized minimum Manhattan network problem
Algorithmica | 2018-05-23 | Paper |
On the Maximum Crossing Number
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
Progress on partial edge drawings
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
Block crossings in storyline visualizations
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
The complexity of drawing graphs on few lines and few planes
(available as arXiv preprint) | 2017-09-22 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
| Cover contact graphs | 2017-03-09 | Paper |
Snapping graph drawings to the grid optimally
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing Graphs on Few Lines and Few Planes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing Graphs on Few Lines and Few Planes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Obstructing visibilities with one obstacle
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Block Crossings in Storyline Visualizations
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Pixel and voxel representations of graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Minimum rectilinear polygons for given angle sequences
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Multi-sided boundary labeling
Algorithmica | 2016-11-01 | Paper |
Simultaneous drawing of planar graphs with right-angle crossings and few bends
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Colored Non-crossing Euclidean Steiner Forest
Algorithms and Computation | 2016-01-11 | Paper |
Ordering metro lines by block crossings
Journal of Graph Algorithms and Applications | 2015-03-04 | Paper |
Approximating minimum Manhattan networks in higher dimensions
Algorithmica | 2015-03-02 | Paper |
Simultaneous drawing of planar graphs with right-angle crossings and few bends
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Drawing graphs within restricted area
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
On monotone drawings of trees
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Improved approximation algorithms for box contact representations
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Computing large matchings fast
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications | 2014-06-10 | Paper |
Smooth Orthogonal Drawings of Planar Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Semantic word cloud representations: hardness and approximation algorithms
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Approximating the generalized minimum Manhattan network problem
Algorithms and Computation | 2014-01-14 | Paper |
Two-sided boundary labeling with adjacent sides
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Augmenting the connectivity of planar and geometric graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Progress on partial edge drawings
Graph Drawing | 2013-04-03 | Paper |
Drawing metro maps using Bézier curves
Graph Drawing | 2013-04-03 | Paper |
