| Publication | Date of Publication | Type |
|---|
OOPS: optimized one-planarity solver via SAT
Journal of Graph Algorithms and Applications | 2026-09-25 | Paper |
| OOPS: optimized one-planarity solver via SAT | 2026-09-21 | Paper |
| Forbidden patterns in mixed linear layouts | 2026-06-24 | Paper |
| Transforming stacks into queues: mixed and separated layouts of graphs | 2026-06-24 | Paper |
The price of upwardness
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
| The price of upwardness | 2025-10-07 | Paper |
| Approximating the minimum logarithmic arrangement problem | 2024-09-11 | Paper |
| On families of planar DAGs with constant stack number | 2024-06-21 | Paper |
scientific article; zbMATH DE number 7788615 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Queue layouts of two-dimensional posets
Lecture Notes in Computer Science | 2023-08-16 | Paper |
The Turing Test for Graph Drawing Algorithms
Lecture Notes in Computer Science | 2021-12-01 | Paper |
The Turing Test for Graph Drawing Algorithms
Lecture Notes in Computer Science | 2021-12-01 | Paper |
| On Families of Planar DAGs with Constant Stack Number | 2021-07-28 | Paper |
The Mixed Page Number of Graphs
(available as arXiv preprint) | 2021-07-11 | Paper |
On dispersable book embeddings
Theoretical Computer Science | 2021-03-09 | Paper |
Improved Basic Block Reordering
IEEE Transactions on Computers | 2020-12-14 | Paper |
Four pages are indeed necessary for planar graphs
(available as arXiv preprint) | 2020-09-09 | Paper |
Improved bounds for track numbers of planar graphs
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
| Book Embeddings of Graph Products | 2020-07-29 | Paper |
Mixed linear layouts of planar graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
On dispersable book embeddings
Lecture Notes in Computer Science | 2018-11-22 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
The Bundled Crossing Number
Lecture Notes in Computer Science | 2017-02-21 | Paper |
The Bundled Crossing Number
Lecture Notes in Computer Science | 2017-02-21 | Paper |
On embeddability of buses in point sets
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Threshold-coloring and unit-cube contact representation of planar graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Weak unit disk and interval representation of graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Weak unit disk and interval representation of graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Representing permutations with few moves
SIAM Journal on Discrete Mathematics | 2016-10-20 | Paper |
Edge routing with ordered bundles
Computational Geometry | 2016-05-17 | Paper |
Colored Non-crossing Euclidean Steiner Forest
Algorithms and Computation | 2016-01-11 | Paper |
MapSets: visualizing embedded and clustered graphs
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Contact Graphs of Circular Arcs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Contact representations of graphs in 3D
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Ordering metro lines by block crossings
Journal of Graph Algorithms and Applications | 2015-03-04 | Paper |
Balanced circle packings for planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Are crossings important for drawing large graphs?
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
MapSets: visualizing embedded and clustered graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Improved approximation algorithms for box contact representations
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Semantic word cloud representations: hardness and approximation algorithms
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Metro-line crossing minimization: hardness, approximations, and tractable cases
Graph Drawing | 2013-12-20 | Paper |
Drawing permutations with few corners
Graph Drawing | 2013-12-20 | Paper |
Threshold-coloring and unit-cube contact representation of graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Ordering Metro Lines by Block Crossings
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Ordering Metro Lines by Block Crossings
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Edge routing with ordered bundles
Graph Drawing | 2012-03-09 | Paper |
Improving layered graph layouts with edge bundling
Graph Drawing | 2011-02-11 | Paper |
