| Publication | Date of Publication | Type |
|---|
| Axis-parallel right angle crossing graphs | 2025-01-06 | Paper |
On upward-planar L-drawings of graphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| RAC drawings of graphs with low degree | 2024-08-06 | Paper |
| On upward-planar L-drawings of graphs | 2024-08-06 | Paper |
| Recognizing map graphs of bounded treewidth | 2024-05-27 | Paper |
Recognizing map graphs of bounded treewidth
Algorithmica | 2024-01-25 | Paper |
scientific article; zbMATH DE number 7788503 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Morphing triangle contact representations of triangulations
Discrete & Computational Geometry | 2023-10-12 | Paper |
Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
Algorithmica | 2023-09-27 | Paper |
| scientific article; zbMATH DE number 7692359 (Why is no real title available?) | 2023-06-05 | Paper |
| Bitonic st-orderings for upward planar graphs: the variable embedding setting | 2022-12-21 | Paper |
Planar L-drawings of bimodal graphs
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
On mixed linear layouts of series-parallel graphs
Theoretical Computer Science | 2022-10-21 | Paper |
| Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022) | 2022-09-09 | Paper |
Morphing Contact Representations of Graphs
(available as arXiv preprint) | 2022-07-18 | Paper |
One-bend drawings of outerplanar graphs inside simple polygons
(available as arXiv preprint) | 2022-07-01 | Paper |
Extending partial orthogonal drawings
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
On morphing 1-planar drawings
(available as arXiv preprint) | 2022-06-08 | Paper |
Extending Partial Orthogonal Drawings
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Planar L-Drawings of Bimodal Graphs
Lecture Notes in Computer Science | 2021-12-01 | Paper |
On Mixed Linear Layouts of Series-Parallel Graphs
Lecture Notes in Computer Science | 2021-12-01 | Paper |
2-Layer k-Planar Graphs
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Beyond Clustered Planar Graphs
Beyond Planar Graphs | 2021-07-22 | Paper |
Multi-level Steiner trees
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
Multi-Level Steiner Trees.
(available as arXiv preprint) | 2020-12-16 | Paper |
| Geometric representations of dichotomous ordinal data | 2020-02-24 | Paper |
Beyond level planarity: cyclic, torus, and simultaneous level planarity
Theoretical Computer Science | 2019-12-27 | Paper |
Greedy rectilinear drawings
Theoretical Computer Science | 2019-10-18 | Paper |
The QuaSEFE Problem
(available as arXiv preprint) | 2019-08-23 | Paper |
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
(available as arXiv preprint) | 2019-08-08 | Paper |
Hierarchical partial planarity
Algorithmica | 2019-05-17 | Paper |
Clustered planarity with pipes
Algorithmica | 2019-05-17 | Paper |
Universal slope sets for 1-bend planar drawings
Algorithmica | 2019-05-17 | Paper |
Morphing planar graph drawings with a polynomial number of steps
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Windrose planarity: embedding graphs with direction-constrained edges
ACM Transactions on Algorithms | 2019-03-28 | Paper |
1-fan-bundle-planar drawings of graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
On vertex- and empty-ply proximity drawings
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 |
Testing Planarity of Partially Embedded Graphs
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Small universal point sets for \(k\)-outerplanar graphs
Discrete & Computational Geometry | 2018-10-30 | Paper |
| A universal slope set for 1-bend planar drawings | 2018-08-13 | Paper |
Algorithms and bounds for L-drawings of directed graphs
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Windrose planarity: embedding graphs with direction-constrained edges
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
3-coloring arrangements of line segments with 4 slopes is hard
Information Processing Letters | 2018-06-15 | Paper |
Clustered Planarity with Pipes
(available as arXiv preprint) | 2018-04-19 | Paper |
1-fan-bundle-planar drawings of graphs
Theoretical Computer Science | 2018-04-04 | Paper |
Hierarchical partial planarity
Lecture Notes in Computer Science | 2018-01-04 | Paper |
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
(available as arXiv preprint) | 2018-01-04 | Paper |
Intersection-link representations of graphs
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
Optimal morphs of convex drawings
(available as arXiv preprint) | 2017-10-10 | Paper |
How to morph planar graph drawings
SIAM Journal on Computing | 2017-05-30 | Paper |
Strip planarity testing for embedded planar graphs
Algorithmica | 2017-05-02 | Paper |
Vertex-coloring with defects
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Beyond level planarity
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Low Ply Drawings of Trees
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Simultaneous orthogonal planarity
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A universal point set for 2-outerplanar graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Intersection-link representations of graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Monotone drawings of graphs with few directions
Information Processing Letters | 2017-01-31 | Paper |
SEFE without mapping via large induced outerplane graphs in plane graphs
Journal of Graph Theory | 2016-06-10 | Paper |
Vertex-coloring with star-defects
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
L-Drawings of Directed Graphs
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
Computational Geometry | 2016-01-15 | Paper |
Simultaneous embedding of embedded planar graphs
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Testing mutual duality of planar graphs
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Monotone drawings of graphs with fixed embedding
Algorithmica | 2015-05-26 | Paper |
Advancements on SEFE and partitioned book embedding problems
Theoretical Computer Science | 2015-04-01 | Paper |
Relaxing the constraints of clustered planarity
Computational Geometry | 2015-03-06 | Paper |
The importance of being proper
Theoretical Computer Science | 2015-01-30 | Paper |
The importance of being proper (in clustered-level planarity and \(T\)-level planarity)
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Anchored drawings of planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Morphing Planar Graph Drawings Optimally
Automata, Languages, and Programming | 2014-07-01 | Paper |
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications | 2014-06-10 | Paper |
| Testing planarity of partially embedded graphs | 2014-05-22 | Paper |
On Some $\mathcal{NP}$ -complete SEFE Problems
Algorithms and Computation | 2014-02-18 | Paper |
On the area requirements of Euclidean minimum spanning trees
Computational Geometry | 2014-01-22 | Paper |
SEFE with no mapping via large induced outerplane graphs in plane graphs
Algorithms and Computation | 2014-01-14 | Paper |
Testing Mutual Duality of Planar Graphs
Algorithms and Computation | 2014-01-14 | Paper |
Morphing Planar Graph Drawings Efficiently
Graph Drawing | 2013-12-20 | Paper |
Strip planarity testing
Graph Drawing | 2013-12-20 | Paper |
Drawing non-planar graphs with crossing-free subgraphs
Graph Drawing | 2013-12-20 | Paper |
Topological morphing of planar graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Implementing a partitioned 2-page book embedding testing algorithm
Graph Drawing | 2013-04-03 | Paper |
Universal point subsets for planar graphs
Algorithms and Computation | 2013-03-21 | Paper |
Large angle crossing drawings of planar graphs in subquadratic area
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Acyclically 3-colorable planar graphs
Journal of Combinatorial Optimization | 2012-12-21 | Paper |
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Succinct greedy drawings do not always exist
Networks | 2012-06-29 | Paper |
Monotone Drawings of Graphs with Fixed Embedding
Graph Drawing | 2012-03-09 | Paper |
Small point sets for simply-nested planar graphs
Graph Drawing | 2012-03-09 | Paper |
On a tree and a path with no geometric simultaneous embedding
Journal of Graph Algorithms and Applications | 2012-01-12 | Paper |
Monotone drawings of graphs
Journal of Graph Algorithms and Applications | 2012-01-12 | Paper |
Simultaneous embedding of embedded planar graphs
Algorithms and Computation | 2011-12-16 | Paper |
On the area requirements of Euclidean minimum spanning trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
Algorithmica | 2011-07-01 | Paper |
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On the perspectives opened by right angle crossing drawings
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Straight-line rectangular drawings of clustered graphs
Discrete & Computational Geometry | 2011-03-10 | Paper |
Upward geometric graph embeddings into point sets
Graph Drawing | 2011-02-11 | Paper |
On a tree and a path with no geometric simultaneous embedding
Graph Drawing | 2011-02-11 | Paper |
Monotone drawings of graphs
Graph Drawing | 2011-02-11 | Paper |
On the perspectives opened by right angle crossing drawings
Graph Drawing | 2010-04-27 | Paper |
Succinct greedy drawings do not always exist
Graph Drawing | 2010-04-27 | Paper |
Splitting clusters to get c-planarity
Graph Drawing | 2010-04-27 | Paper |
Acyclically 3-colorable planar graphs
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
An Algorithm to Construct Greedy Drawings of Triangulations
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Straight-Line Rectangular Drawings of Clustered Graphs
Lecture Notes in Computer Science | 2009-10-20 | Paper |
An Algorithm to Construct Greedy Drawings of Triangulations
Graph Drawing | 2009-03-03 | Paper |
Topological Morphing of Planar Graphs
Graph Drawing | 2009-03-03 | Paper |
Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time
Lecture Notes in Computer Science | 2009-02-17 | Paper |
