research
∙
08/29/2023
The Parametrized Complexity of the Segment Number
Given a straight-line drawing of a graph, a segment is a maximal set of ...
share
research
∙
07/17/2023
Quantum Graph Drawing
In this paper, we initiate the study of quantum algorithms in the Graph ...
research
∙
08/30/2022
Unit-length Rectangular Drawings of Graphs
A rectangular drawing of a planar graph G is a planar drawing of G in wh...
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...
research
∙
06/29/2022
Recognizing Map Graphs of Bounded Treewidth
A map graph is a graph admitting a representation in which vertices are ...
research
∙
05/11/2022
On Upward-Planar L-Drawings of Graphs
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edg...
research
∙
04/25/2022
Graph Product Structure for h-Framed Graphs
Graph product structure theory expresses certain graphs as subgraphs of ...
research
∙
08/28/2021
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths
We study a classic problem introduced thirty years ago by Eades and Worm...
research
∙
08/27/2021
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that th...
research
∙
05/17/2021
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
The planar slope number psn(G) of a planar graph G is the minimum number...
research
∙
11/04/2020
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees
Given a bipartite graph G=(V_b,V_r,E), the 2-Level Quasi-Planarity probl...
research
∙
08/21/2020
2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth
The 2-layer drawing model is a well-established paradigm to visualize bi...
research
∙
08/18/2020
Planar L-Drawings of Bimodal Graphs
In a planar L-drawing of a directed graph (digraph) each edge e is repre...
research
∙
03/17/2020
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
An embedding of a graph in a book, called book embedding, consists of a ...
research
∙
03/01/2020
On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
In this paper we study the area requirements of planar greedy drawings o...
research
∙
10/04/2019
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
For a clustered graph, i.e, a graph whose vertex set is recursively part...
research
∙
09/16/2019
How to Morph a Tree on a Small Grid
In this paper we study planar morphs between straight-line planar grid d...
research
∙
08/31/2019
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar
A simple topological graph is k-quasiplanar (k≥ 2) if it contains no k p...
research
∙
08/25/2019
Graph Stories in Small Area
We study the problem of drawing a dynamic graph, where each vertex appea...
research
∙
07/02/2019
Computing k-Modal Embeddings of Planar Digraphs
Given a planar digraph G and a positive even integer k, an embedding of ...
research
∙
03/19/2019
Upward Book Embeddings of st-Graphs
We study k-page upward book embeddings (kUBEs) of st-graphs, that is, bo...
research
∙
03/18/2019
Morphing Contact Representations of Graphs
We consider the problem of morphing between contact representations of a...
research
∙
02/18/2019
Extending Upward Planar Graph Drawings
In this paper we study the computational complexity of the Upward Planar...
research
∙
08/31/2018
Upward Planar Morphs
We prove that, given two topologically-equivalent upward planar straight...
research
∙
03/14/2018
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
The C-Planarity problem asks for a drawing of a clustered graph, i.e., a...
research
∙
10/01/2017
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs
A square-contact representation of a planar graph G=(V,E) maps vertices ...
research
∙
09/23/2017
Analogies between the crossing number and the tangle crossing number
Tanglegrams are special graphs that consist of a pair of rooted binary t...
research
∙
08/30/2017