| Publication | Date of Publication | Type |
|---|
Min-\(k\)-planar drawings of graphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Min-\(k\)-planar drawings of graphs | 2024-06-21 | Paper |
| Evaluating animation parameters for morphing edge drawings | 2024-06-21 | Paper |
| Recognizing map graphs of bounded treewidth | 2024-05-27 | Paper |
| Nonplanar Graph Drawings with k Vertices per Face | 2024-05-03 | Paper |
Recognizing map graphs of bounded treewidth
Algorithmica | 2024-01-25 | Paper |
Small Point-Sets Supporting Graph Stories
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
k-Planar Placement and Packing of Δ-Regular Caterpillars
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
Small point-sets supporting graph stories
Lecture Notes in Computer Science | 2023-08-16 | Paper |
On the parameterized complexity of \(s\)-club cluster deletion problems
Lecture Notes in Computer Science | 2023-08-14 | Paper |
On the parameterized complexity of s-club cluster deletion problems
Theoretical Computer Science | 2023-08-01 | Paper |
Parameterized complexity of graph planarity with restricted cyclic orders
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Parameterized complexity of graph planarity with restricted cyclic orders
Journal of Computer and System Sciences | 2023-04-21 | Paper |
A user study on hybrid graph visualizations
(available as arXiv preprint) | 2022-07-01 | Paper |
Quasi-upward planar drawings with minimum curve complexity
(available as arXiv preprint) | 2022-07-01 | Paper |
Packing trees into 1-planar graphs
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Storyline visualizations with ubiquitous actors
Lecture Notes in Computer Science | 2021-12-01 | Paper |
\((k,p)\)-planarity: a relaxation of hybrid planarity
Theoretical Computer Science | 2021-11-18 | Paper |
Simultaneous FPQ-ordering and hybrid planarity testing
Theoretical Computer Science | 2021-06-22 | Paper |
Ortho-polygon visibility representations of 3-connected 1-plane graphs
Theoretical Computer Science | 2021-03-18 | Paper |
ChordLink: a new hybrid visualization model
(available as arXiv preprint) | 2020-10-26 | Paper |
Packing trees into 1-planar graphs
(available as arXiv preprint) | 2020-07-22 | Paper |
Simultaneous FPQ-ordering and hybrid planarity testing
Lecture Notes in Computer Science | 2020-07-20 | Paper |
| Coloring outerplanar graphs and planar 3-trees with small monochromatic components | 2019-11-25 | Paper |
Packing Trees into 1-planar Graphs
(available as arXiv preprint) | 2019-11-05 | Paper |
Greedy rectilinear drawings
Theoretical Computer Science | 2019-10-18 | Paper |
\((k, p)\)-planarity: a relaxation of hybrid planarity
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
Pole dancing: 3D morphs for tree drawings
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
NodeTrix planarity testing with small clusters
Algorithmica | 2019-08-20 | Paper |
NodeTrix planarity testing with small clusters
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Greedy rectilinear drawings
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Turning cliques into paths to achieve planarity
(available as arXiv preprint) | 2019-02-15 | Paper |
Pole dancing: 3D morphs for tree drawings
(available as arXiv preprint) | 2019-02-15 | Paper |
Ortho-polygon visibility representations of 3-connected 1-plane graphs
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Pole Dancing: 3D Morphs for Tree Drawings
(available as arXiv preprint) | 2018-08-31 | Paper |
