A finite set P of points in the plane is n-universal with respect to a
c...
We consider the computational problem of finding short paths in the skel...
Given an integer k and a graph where every edge is colored either red or...
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement gr...
In the Exact Matching Problem (EM), we are given a graph equipped with
a...
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipart...
We characterize all digraphs H such that orientations of chordal graphs
...
Recently, the second and third author showed that complete geometric gra...
Hadwiger's conjecture states that every K_t-minor free graph is
(t-1)-co...
In this paper we generalise the even directed cycle problem, which asks
...
We consider face-colorings of drawings of graphs in the plane. Given a
m...
In this article we discuss classical theorems from Convex Geometry in th...
Representations of planar triangulations as contact graphs of a set of
i...
Let A be an arrangement of n lines in the Euclidean plane. The
<i>k-leve...
Many well-known NP-hard algorithmic problems on directed graphs resist
e...
A colouring of a digraph as defined by Erdos and Neumann-Lara in 1980 is...
Flip graphs are a ubiquitous class of graphs, which encode relations ind...
We investigate which planar point sets allow simultaneous straight-line
...