There are multiple factors which can cause the phylogenetic inference pr...
Let G be an undirected graph. We say that G contains a ladder of length
...
We present an O(n^2)-time algorithm to test whether an n-vertex directed...
An obstacle representation of a graph G consists of a set of pairwise
di...
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edg...
We obtain new parameterized algorithms for the classical problem of
dete...
We consider the problem of morphing between rectangular duals of a plane...
The planar slope number psn(G) of a planar graph G is the
minimum number...
A rectangular dual of a graph G is a contact representation of G by
axis...
For a class 𝒟 of drawings of loopless multigraphs in the plane, a
drawin...
We investigate the parameterized complexity of the recognition problem f...
We study problems with stochastic uncertainty information on intervals f...
In a planar L-drawing of a directed graph (digraph) each edge e is
repre...
We show that every planar graph can be represented by a monotone topolog...
In a RAC drawing of a graph, vertices are represented by points in the p...
In this paper, we study fan-planar drawings that use h layers and are
pr...
In this paper, we study arrangements of orthogonal circles, that is,
arr...
Stick graphs are intersection graphs of horizontal and vertical line seg...
We study graph classes modeled by families of non-crossing (NC) connecte...
We consider the problem of morphing between contact representations of a...
An effective way to reduce clutter in a graph drawing that has (many)
cr...
We study the following classes of beyond-planar graphs: 1-planar, IC-pla...
We study planar drawings of directed graphs in the L-drawing standard. W...
We study straight-line drawings of graphs where the vertices are placed ...
We consider the problem of packing a family of disks "on a shelf", that ...