research
∙
08/30/2023
Decomposing Triangulations into 4-Connected Components
A connected graph is 4-connected if it contains at least five vertices a...
share
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 ...
research
∙
08/29/2022
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
In a planar confluent orthogonal drawing (PCOD) of a directed graph (dig...
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
∙
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
∙
08/17/2020
Drawing Shortest Paths in Geodetic Graphs
Motivated by the fact that in a space where shortest paths are unique, n...
research
∙
03/18/2019
Morphing Contact Representations of Graphs
We consider the problem of morphing between contact representations of a...
research
∙
08/30/2018
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
While orthogonal drawings have a long history, smooth orthogonal drawing...
research
∙
08/30/2017