| Publication | Date of Publication | Type |
|---|
Removing popular faces in curve arrangements Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
| Removing popular faces in curve arrangements | 2024-10-14 | Paper |
| On 1-bend upward point-set embeddings of \(st\)-digraphs | 2024-05-31 | Paper |
Upward book embeddability of \(st\)-graphs: complexity and algorithms Algorithmica | 2023-12-13 | Paper |
Recognizing DAGs with page-number 2 is NP-complete Lecture Notes in Computer Science | 2023-08-16 | Paper |
Graph drawing contest report Lecture Notes in Computer Science | 2023-08-16 | Paper |
Recognizing DAGs with page-number 2 is NP-complete Theoretical Computer Science | 2023-02-01 | Paper |
On mixed linear layouts of series-parallel graphs Theoretical Computer Science | 2022-10-21 | Paper |
Upward book embeddings of st-graphs (available as arXiv preprint) | 2022-07-18 | Paper |
Graph drawing contest report Lecture Notes in Computer Science | 2022-07-01 | Paper |
Upward planar drawings with two slopes Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Level-planar drawings with few slopes Algorithmica | 2022-02-01 | Paper |
On Mixed Linear Layouts of Series-Parallel Graphs Lecture Notes in Computer Science | 2021-12-01 | Paper |
Graph Drawing Contest Report Lecture Notes in Computer Science | 2021-12-01 | Paper |
Upward point set embeddings of paths and trees (available as arXiv preprint) | 2021-10-04 | Paper |
Drawing planar graphs with few segments on a polynomial grid (available as arXiv preprint) | 2020-10-26 | Paper |
Level-planar drawings with few slopes Lecture Notes in Computer Science | 2020-10-26 | Paper |
Graph drawing contest report Lecture Notes in Computer Science | 2020-10-26 | Paper |
Drawing clustered planar graphs on disk arrangements Journal of Graph Algorithms and Applications | 2020-02-17 | 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 |
Greedy rectilinear drawings Theoretical Computer Science | 2019-10-18 | Paper |
Planar drawings of fixed-mobile bigraphs Theoretical Computer Science | 2019-10-18 | Paper |
Drawing clustered graphs on disk arrangements WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
Planar graphs of bounded degree have bounded queue number SIAM Journal on Computing | 2019-10-11 | Paper |
Aesthetic Discrimination of Graph Layouts Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
| Drawing planar graphs with many collinear vertices | 2019-02-27 | Paper |
Aligned drawings of planar graphs Lecture Notes in Computer Science | 2019-02-20 | Paper |
Experimental evaluation of book drawing algorithms Lecture Notes in Computer Science | 2019-02-20 | Paper |
Planar drawings of fixed-mobile bigraphs Lecture Notes in Computer Science | 2019-02-20 | Paper |
Aesthetic discrimination of graph layouts (available as arXiv preprint) | 2019-02-15 | Paper |
A greedy heuristic for crossing-angle maximization (available as arXiv preprint) | 2019-02-15 | Paper |
-stars or on extending a drawing of a connected subgraph (available as arXiv preprint) | 2019-02-15 | Paper |
Greedy rectilinear drawings Lecture Notes in Computer Science | 2019-02-15 | Paper |
| Monotone simultaneous paths embeddings in \(\mathbb{R}^d\) | 2018-12-10 | Paper |
Small universal point sets for \(k\)-outerplanar graphs Discrete & Computational Geometry | 2018-10-30 | Paper |
Aligned drawings of planar graphs Journal of Graph Algorithms and Applications | 2018-10-25 | Paper |
Strongly monotone drawings of planar graphs (available as arXiv preprint) | 2018-01-30 | Paper |
Drawing planar graphs with many collinear vertices Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing planar graphs with many collinear vertices Lecture Notes in Computer Science | 2017-02-21 | Paper |
Monotone simultaneous embeddings of paths in \(d\) dimensions 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 |
Extending convex partial drawings of graphs Algorithmica | 2016-11-01 | Paper |
Lower and upper bounds for long induced paths in 3-connected planar graphs Theoretical Computer Science | 2016-06-01 | Paper |
Embedding Four-directional Paths on Convex Point Sets Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Fitting planar graphs on planar maps Journal of Graph Algorithms and Applications | 2015-10-29 | Paper |
Monotone drawings of graphs with fixed embedding Algorithmica | 2015-05-26 | Paper |
Monotone simultaneous embeddings of upward planar digraphs Journal of Graph Algorithms and Applications | 2015-03-04 | Paper |
Computing upward topological book embeddings of upward planar digraphs Journal of Discrete Algorithms | 2015-02-13 | Paper |
Bar 1-visibility graphs and their relation to other nearly planar graphs Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Fitting Planar Graphs on Planar Maps SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Embedding four-directional paths on convex point sets Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Minimum tree supports for hypergraphs and low-concurrency Euler diagrams Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Universal Point Sets for Drawing Planar Graphs with Circular Arcs Journal of Graph Algorithms and Applications | 2014-06-10 | Paper |
Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points'' Computational Geometry | 2014-01-22 | Paper |
Drawing planar graphs with a prescribed inner face Graph Drawing | 2013-12-20 | Paper |
Lower and upper bounds for long induced paths in 3-connected planar graphs Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Crossing-optimal acyclic HP-completion for outerplanar \(st\)-digraphs Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points Computational Geometry | 2013-07-31 | Paper |
On upward point set embeddability Computational Geometry | 2013-04-29 | Paper |
Point-set embeddability of 2-colored trees Graph Drawing | 2013-04-03 | Paper |
Universal point subsets for planar graphs Algorithms and Computation | 2013-03-21 | Paper |
Drawing graphs with vertices at specified positions and crossings at large angles WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Monotone Drawings of Graphs with Fixed Embedding Graph Drawing | 2012-03-09 | Paper |
Upward point set embeddability for convex point sets is in P Graph Drawing | 2012-03-09 | Paper |
Small point sets for simply-nested planar graphs Graph Drawing | 2012-03-09 | Paper |
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles Graph Drawing | 2012-03-09 | Paper |
Upward Point-Set Embeddability SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Upward geometric graph embeddings into point sets Graph Drawing | 2011-02-11 | Paper |
Unilateral orientation of mixed graphs SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs Algorithms and Computation | 2009-12-17 | Paper |
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs Lecture Notes in Computer Science | 2009-07-23 | Paper |
Spine Crossing Minimization in Upward Topological Book Embeddings Graph Drawing | 2009-03-03 | Paper |
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Computing Upward Topological Book Embeddings of Upward Planar Digraphs Algorithms and Computation | 2008-05-27 | Paper |