research
∙
08/29/2022
Recognizing DAGs with Page-Number 2 is NP-complete
The page-number of a directed acyclic graph (a DAG, for short) is the mi...
share
research
∙
08/26/2022
Testing Upward Planarity of Partial 2-Trees
We present an O(n^2)-time algorithm to test whether an n-vertex directed...
research
∙
03/10/2022
Parameterized Algorithms for Upward Planarity
We obtain new parameterized algorithms for the classical problem of dete...
research
∙
08/02/2021
Recognizing and Embedding Simple Optimal 2-Planar Graphs
In the area of beyond-planar graphs, i.e. graphs that can be drawn with ...
research
∙
06/15/2021
On the Queue Number of Planar Graphs
A k-queue layout is a special type of a linear layout, in which the line...
research
∙
09/04/2019
