| Publication | Date of Publication | Type |
|---|
Rectilinear-upward planarity testing of digraphs
Journal of Computer and System Sciences | 2026-03-12 | Paper |
| Upward pointset embeddings of planar st-graphs | 2025-10-07 | Paper |
| The price of upwardness | 2025-10-07 | Paper |
| Rectilinear-upward planarity testing of digraphs | 2025-07-24 | Paper |
Upward pointset embeddings of planar \(st\)-graphs
Algorithmica | 2025-05-23 | Paper |
| Ranking and unranking of the planar embeddings of a planar graph | 2025-04-15 | Paper |
Unit-length rectangular drawings of graphs
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
| Efficient enumeration of drawings and combinatorial structures for maximal planar graphs | 2024-07-19 | Paper |
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
European Journal of Combinatorics | 2024-06-28 | Paper |
scientific article; zbMATH DE number 7788503 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
$st$-Orientations with Few Transitive Edges
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
Small Point-Sets Supporting Graph Stories
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
| Planar L-drawings of directed graphs | 2023-12-16 | Paper |
Upward book embeddability of \(st\)-graphs: complexity and algorithms
Algorithmica | 2023-12-13 | Paper |
| Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs | 2023-10-03 | Paper |
\(st\)-orientations with few transitive edges
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Unit-length rectangular drawings of graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Small point-sets supporting graph stories
Lecture Notes in Computer Science | 2023-08-16 | Paper |
On turn-regular orthogonal representations
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Upward book embeddings of st-graphs
(available as arXiv preprint) | 2022-07-18 | Paper |
Planar straight-line realizations of 2-trees with prescribed edge lengths
(available as arXiv preprint) | 2022-07-01 | Paper |
How to morph a tree on a small grid
Discrete & Computational Geometry | 2022-03-22 | Paper |
Schematic Representation of Biconnected Graphs
Lecture Notes in Computer Science | 2021-12-01 | Paper |
A Tipping Point for the Planarity of Small and Medium Sized Graphs
Lecture Notes in Computer Science | 2021-12-01 | Paper |
On Turn-Regular Orthogonal Representations
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Schematic representation of large biconnected graphs
Journal of Graph Algorithms and Applications | 2021-06-17 | Paper |
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On the area requirements of planar straight-line orthogonal drawings of ternary trees
Theoretical Computer Science | 2021-01-25 | Paper |
| Graph stories in small area | 2020-10-26 | Paper |
Upward planar morphs
Algorithmica | 2020-10-12 | Paper |
Graph Stories in Small Area
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Visualizing co-phylogenetic reconciliations
Theoretical Computer Science | 2020-04-06 | Paper |
How to morph a tree on a small grid
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Beyond level planarity: cyclic, torus, and simultaneous level planarity
Theoretical Computer Science | 2019-12-27 | Paper |
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
Journal of Computer and System Sciences | 2019-11-29 | Paper |
The QuaSEFE Problem
(available as arXiv preprint) | 2019-08-23 | Paper |
NodeTrix planarity testing with small clusters
Algorithmica | 2019-08-20 | 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 |
Planar L-drawings of directed graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Visualizing co-phylogenetic reconciliations
Lecture Notes in Computer Science | 2019-02-20 | Paper |
NodeTrix planarity testing with small clusters
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Clustered planarity = flat clustered planarity
(available as arXiv preprint) | 2019-02-15 | Paper |
Bend-minimum orthogonal drawings in quadratic time
(available as arXiv preprint) | 2019-02-15 | Paper |
Upward planar morphs
Lecture Notes in Computer Science | 2019-02-15 | Paper |
HV-planarity: algorithms and complexity
Journal of Computer and System Sciences | 2018-12-10 | Paper |
Testing Planarity of Partially Embedded Graphs
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| On the area requirements of straight-line orthogonal drawings of ternary trees | 2018-09-06 | Paper |
Algorithms and bounds for L-drawings of directed graphs
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Computing NodeTrix representations of clustered graphs
Journal of Graph Algorithms and Applications | 2018-01-12 | 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 |
Beyond level planarity
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Computing NodeTrix representations of clustered graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Intersection-link representations of graphs
Lecture Notes in Computer Science | 2017-02-10 | 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 |
Computational complexity of traffic hijacking under BGP and S-BGP
Theoretical Computer Science | 2015-09-16 | Paper |
Fan-planarity: properties and complexity
Theoretical Computer Science | 2015-06-01 | Paper |
Relaxing the constraints of clustered planarity
Computational Geometry | 2015-03-06 | Paper |
On the complexity of HV-rectilinear planarity testing
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 |
Fan-planar graphs: combinatorial properties and complexity results
Graph Drawing | 2015-01-07 | Paper |
Morphing Planar Graph Drawings Optimally
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Testing planarity of partially embedded graphs | 2014-05-22 | Paper |
Upward and quasi-upward planarity testing of embedded mixed graphs
Theoretical Computer Science | 2014-03-13 | Paper |
Morphing Planar Graph Drawings Efficiently
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 |
Nonconvex Representations of Plane Graphs
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
Computational complexity of traffic hijacking under BGP and S-BGP
Automata, Languages, and Programming | 2012-11-01 | 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 |
Drawing trees in a streaming model
Information Processing Letters | 2012-07-25 | Paper |
Monotone drawings of graphs
Journal of Graph Algorithms and Applications | 2012-01-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 |
Monotone drawings of graphs
Graph Drawing | 2011-02-11 | Paper |
Drawing trees in a streaming model
Graph Drawing | 2010-04-27 | Paper |
Splitting clusters to get c-planarity
Graph Drawing | 2010-04-27 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
On embedding a graph in the grid with the maximum number of bends and other bad features
Theory of Computing Systems | 2009-08-06 | Paper |
A note on 3D orthogonal drawings with direction constrained edges
Information Processing Letters | 2009-07-21 | Paper |
On embedding a cycle in a plane graph
Discrete Mathematics | 2009-04-09 | Paper |
Non-convex Representations of Graphs
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 |
Clustering Cycles into Cycles of Clusters
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Clustering Cycles into Cycles of Clusters
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
C-Planarity of C-Connected Clustered Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Complexity results for three-dimensional orthogonal graph drawing
Journal of Discrete Algorithms | 2008-11-18 | Paper |
On the Topologies of Local Minimum Spanning Trees
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
Graph Drawing | 2008-03-25 | Paper |
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
Visualizing Interdomain Routing with BGPlay
Journal of Graph Algorithms and Applications | 2006-04-03 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2185601 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2084302 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084314 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080084 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2044946 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1974115 (Why is no real title available?) | 2003-09-03 | Paper |
Drawing database schemas
Software: Practice and Experience | 2003-02-04 | Paper |
On the complexity of orthogonal compaction
Computational Geometry | 2001-09-09 | Paper |
A Split&Push Approach to 3D Orthogonal Drawing
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
A Split&Push Approach to 3D Orthogonal Drawing
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
