| Publication | Date of Publication | Type |
|---|
Drawing graphs with \(k\) vertices per face: complexity and algorithms
Theoretical Computer Science | 2025-12-02 | Paper |
| Introducing fairness in graph visualization (poster abstract) | 2025-10-07 | Paper |
| On the complexity of recognizing \(k^+\)-real face graphs | 2025-10-07 | Paper |
| Graphtrials: visual proofs of graph properties | 2025-10-07 | Paper |
| On the parameterized complexity of computing \(st\)-orientations with few transitive edges | 2024-12-03 | Paper |
On the parameterized complexity of bend-minimum orthogonal planarity
Algorithmica | 2024-10-24 | Paper |
Strictly-convex drawings of 3-connected planar graphs
Journal of Computational Geometry | 2024-10-18 | Paper |
Optimal-area visibility representations of outer-1-plane graphs
Journal of Computational Geometry | 2024-10-18 | Paper |
| Extending orthogonal planar graph drawings is fixed-parameter tractable | 2024-10-16 | Paper |
| On the parameterized complexity of bend-minimum orthogonal planarity | 2024-10-14 | Paper |
| Upward and orthogonal planarity are W[1-hard parameterized by treewidth] | 2024-10-14 | Paper |
Planar drawings with few slopes of Halin graphs and nested pseudotrees
Algorithmica | 2024-08-13 | Paper |
| On 1-bend upward point-set embeddings of \(st\)-digraphs | 2024-05-31 | Paper |
| Recognizing map graphs of bounded treewidth | 2024-05-27 | Paper |
Convex grid drawings of planar graphs with constant edge-vertex resolution
Theoretical Computer Science | 2024-02-23 | Paper |
Recognizing map graphs of bounded treewidth
Algorithmica | 2024-01-25 | Paper |
| Book embeddings of nonplanar graphs with small faces in few pages | 2023-11-02 | Paper |
Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
Discrete Mathematics | 2023-10-30 | Paper |
On the complexity of the storyplan problem
Journal of Computer and System Sciences | 2023-10-24 | Paper |
Strictly-convex drawings of 3-connected planar graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
On the complexity of the storyplan problem
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 |
| scientific article; zbMATH DE number 7692359 (Why is no real title available?) | 2023-06-05 | Paper |
On the upward book thickness problem: combinatorial and complexity results
European Journal of Combinatorics | 2023-04-27 | Paper |
Geodesic obstacle representation of graphs
Computational Geometry | 2022-11-16 | Paper |
Parameterized algorithms for queue layouts
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
1-planarity testing and embedding: an experimental study
Computational Geometry | 2022-10-06 | Paper |
Convex grid drawings of planar graphs with constant edge-vertex resolution
(available as arXiv preprint) | 2022-08-30 | Paper |
Universal slope sets for upward planar drawings
Algorithmica | 2022-08-18 | Paper |
| Polyline Drawings with Topological Constraints | 2022-07-21 | Paper |
A user study on hybrid graph visualizations
(available as arXiv preprint) | 2022-07-01 | Paper |
Optimal-area visibility representations of outer-1-plane graphs
(available as arXiv preprint) | 2022-07-01 | Paper |
On the upward book thickness problem: combinatorial and complexity results
Lecture Notes in Computer Science | 2022-07-01 | Paper |
On morphing 1-planar drawings
(available as arXiv preprint) | 2022-06-08 | Paper |
Planar drawings with few slopes of Halin graphs and nested pseudotrees
(available as arXiv preprint) | 2022-03-25 | Paper |
Orthogonal planarity testing of bounded treewidth graphs
Journal of Computer and System Sciences | 2022-01-31 | Paper |
Crossing numbers of beyond-planar graphs
Theoretical Computer Science | 2021-12-01 | Paper |
Parameterized Algorithms for Queue Layouts
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Storyline visualizations with ubiquitous actors
Lecture Notes in Computer Science | 2021-12-01 | Paper |
VAIM: Visual Analytics for Influence Maximization
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Grid drawings of graphs with constant edge-vertex resolution
Computational Geometry | 2021-09-17 | Paper |
Geodesic obstacle representation of graphs
(available as arXiv preprint) | 2021-07-28 | Paper |
Edge Partitions and Visibility Representations of 1-planar Graphs
Beyond Planar Graphs | 2021-07-22 | Paper |
| Generalized LR-drawings of trees | 2021-05-14 | Paper |
Ortho-polygon visibility representations of 3-connected 1-plane graphs
Theoretical Computer Science | 2021-03-18 | Paper |
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
Journal of Graph Algorithms and Applications | 2021-01-19 | Paper |
Parameterized algorithms for book embedding problems
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
ChordLink: a new hybrid visualization model
(available as arXiv preprint) | 2020-10-26 | Paper |
Crossing numbers of beyond-planar graphs
Lecture Notes in Computer Science | 2020-10-26 | Paper |
Parameterized algorithms for book embedding problems
(available as arXiv preprint) | 2020-10-26 | Paper |
Sketched representations and orthogonal planarity of bounded treewidth graphs
(available as arXiv preprint) | 2020-10-26 | Paper |
1-bend upward planar slope number of SP-digraphs
Computational Geometry | 2020-10-23 | Paper |
An experimental study of a 1-planarity testing and embedding algorithm
(available as arXiv preprint) | 2020-07-22 | Paper |
Planar graphs of bounded degree have bounded queue number
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Polyline drawings with topological constraints
Theoretical Computer Science | 2020-01-29 | Paper |
Polyline drawings with topological constraints
Theoretical Computer Science | 2020-01-29 | Paper |
Planar graphs of bounded degree have bounded queue number
SIAM Journal on Computing | 2019-10-11 | Paper |
Universal slope sets for 1-bend planar drawings
Algorithmica | 2019-05-17 | Paper |
Gap-Planar Graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Edge partitions of optimal 2-plane and 3-plane graphs
Discrete Mathematics | 2019-02-20 | Paper |
Ortho-polygon visibility representations of 3-connected 1-plane graphs
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
(available as arXiv preprint) | 2019-02-15 | Paper |
Universal slope sets for upward planar drawings
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation
Algorithmica | 2019-01-11 | Paper |
Edge partitions of optimal 2-plane and 3-plane graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Visibility representations of boxes in 2.5 dimensions
Computational Geometry | 2018-10-31 | Paper |
Embedding-preserving rectangle visibility representations of nonplanar graphs
Discrete & Computational Geometry | 2018-10-30 | Paper |
Gap-planar graphs
Theoretical Computer Science | 2018-09-24 | Paper |
| A universal slope set for 1-bend planar drawings | 2018-08-13 | Paper |
Ortho-polygon visibility representations of embedded graphs
Algorithmica | 2018-07-25 | Paper |
| Bounded stub resolution for some maximal 1-planar graphs | 2018-06-05 | Paper |
Drawing subcubic planar graphs with four slopes and optimal angular resolution
Theoretical Computer Science | 2018-02-06 | Paper |
New results on edge partitions of 1-plane graphs
Theoretical Computer Science | 2018-02-06 | Paper |
| On visibility representations of non-planar graphs | 2018-01-30 | Paper |
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
(available as arXiv preprint) | 2018-01-04 | Paper |
Progress on partial edge drawings
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
An annotated bibliography on 1-planarity
Computer Science Review | 2017-09-28 | Paper |
On RAC drawings of 1-planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
On guarding orthogonal polygons with sliding cameras
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Vertex-coloring with defects
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
1-bend RAC drawings of 1-planar graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Visibility representations of boxes in 2.5 dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
1-bend upward planar drawings of SP-digraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A distributed multilevel force-directed algorithm
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Placing arrows in directed graph drawings
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Ortho-polygon visibility representations of embedded graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A million edge drawing for a fistful of dollars
Lecture Notes in Computer Science | 2017-02-10 | Paper |
\textsc{Kojaph}: visual definition and exploration of patterns in graph databases
Lecture Notes in Computer Science | 2017-02-10 | Paper |
2-layer fan-planarity: from caterpillar to stegosaurus
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Recognizing and drawing IC-planar graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
On partitioning the edges of 1-plane graphs
Theoretical Computer Science | 2017-01-09 | Paper |
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
Theoretical Computer Science | 2016-08-31 | Paper |
Recognizing and drawing IC-planar graphs
Theoretical Computer Science | 2016-06-01 | Paper |
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
Computational Geometry | 2016-01-15 | Paper |
Fast layout computation of clustered networks: algorithmic advances and experimental analysis
Information Sciences | 2016-01-14 | Paper |
Drawing outer 1-planar graphs with few slopes
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
L-visibility drawings of IC-planar graphs
Information Processing Letters | 2016-01-05 | Paper |
Fan-planarity: properties and complexity
Theoretical Computer Science | 2015-06-01 | Paper |
Drawing outer 1-planar graphs with few slopes
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Fan-planar graphs: combinatorial properties and complexity results
Graph Drawing | 2015-01-07 | Paper |
The Planar Slope Number of Subcubic Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
1-bend orthogonal partial edge drawing
Journal of Graph Algorithms and Applications | 2014-03-24 | Paper |
Drawing non-planar graphs with crossing-free subgraphs
Graph Drawing | 2013-12-20 | Paper |
Exploring Complex Drawings via Edge Stratification
Graph Drawing | 2013-12-20 | Paper |
Area requirement of graph drawings with few crossings per edge
Computational Geometry | 2013-07-31 | Paper |
Progress on partial edge drawings
Graph Drawing | 2013-04-03 | Paper |
\(h\)-quasi planar drawings of bounded treewidth graphs in linear area
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
