research
∙
09/03/2023
Relaxed Agreement Forests
There are multiple factors which can cause the phylogenetic inference pr...
share
research
∙
02/21/2023
Snakes and Ladders: a Treewidth Story
Let G be an undirected graph. We say that G contains a ladder of length ...
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
∙
06/30/2022
Bounding and computing obstacle numbers of graphs
An obstacle representation of a graph G consists of a set of pairwise di...
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
∙
03/10/2022
Parameterized Algorithms for Upward Planarity
We obtain new parameterized algorithms for the classical problem of dete...
research
∙
12/06/2021
Morphing Rectangular Duals
We consider the problem of morphing between rectangular duals of a plane...
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
∙
02/03/2021
Extending Partial Representations of Rectangular Duals with Given Contact Orientations
A rectangular dual of a graph G is a contact representation of G by axis...
research
∙
12/15/2020
Edge-Minimum Saturated k-Planar Drawings
For a class 𝒟 of drawings of loopless multigraphs in the plane, a drawin...
research
∙
11/23/2020
Recognizing Proper Tree-Graphs
We investigate the parameterized complexity of the recognition problem f...
research
∙
10/07/2020
Query Minimization under Stochastic Uncertainty
We study problems with stochastic uncertainty information on intervals f...
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/11/2020
Monotone Arc Diagrams with few Biarcs
We show that every planar graph can be represented by a monotone topolog...
research
∙
03/10/2020
Drawing Graphs with Circular Arcs and Right-Angle Crossings
In a RAC drawing of a graph, vertices are represented by points in the p...
research
∙
02/22/2020
On Layered Fan-Planar Graph Drawings
In this paper, we study fan-planar drawings that use h layers and are pr...
research
∙
07/18/2019
On Arrangements of Orthogonal Circles
In this paper, we study arrangements of orthogonal circles, that is, arr...
research
∙
07/11/2019
Stick Graphs with Length Constraints
Stick graphs are intersection graphs of horizontal and vertical line seg...
research
∙
06/29/2019
Intersection Graphs of Non-crossing Paths
We study graph classes modeled by families of non-crossing (NC) connecte...
research
∙
03/18/2019
Morphing Contact Representations of Graphs
We consider the problem of morphing between contact representations of a...
research
∙
12/11/2018
Bundled Crossings Revisited
An effective way to reduce clutter in a graph drawing that has (many) cr...
research
∙
06/26/2018
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
We study the following classes of beyond-planar graphs: 1-planar, IC-pla...
research
∙
08/30/2017
Planar L-Drawings of Directed Graphs
We study planar drawings of directed graphs in the L-drawing standard. W...
research
∙
08/29/2017
Beyond Outerplanarity
We study straight-line drawings of graphs where the vertices are placed ...
research
∙
07/05/2017
