The study of nonplanar drawings of graphs with restricted crossing
confi...
We prove that for every planar graph X of treedepth h, there exists a
po...
Hadwiger's Conjecture asserts that every K_h-minor-free graph is properl...
We prove that for every tree T of radius h, there is an integer c such
t...
We prove that the linear chromatic number of any k× k pseudogrid is
Ω(k)...
The Product Structure Theorem for planar graphs (Dujmović et al.JACM, 67...
We show that anagram-free vertex colouring a 2× n square grid requires
a...
Layered treewidth and row treewidth are recently introduced graph parame...
We describe a family of graphs with queue-number at most 4 but unbounded...
We show that for every integer n≥ 1 there exists a graph G_n with
(1+o(1...
A (vertex) ℓ-ranking is a labelling φ:V(G)→ℕ of the
vertices of a graph ...
Layered pathwidth is a new graph parameter studied by Bannister et al (2...
Dujmović et al (FOCS2019) recently proved that every planar graph G is a...
We show that there exists an adjacency labelling scheme for planar graph...
We study the problem of embedding graphs in the plane as good geometric
...
Dujmović et al. (FOCS 2019) recently proved that every planar graph is a...
We show that planar graphs have bounded queue-number, thus proving a
con...
We consider the following problem: given three sets of real numbers, out...
We prove that graphs with bounded degree and bounded Euler genus have bo...
For any constants d> 1, ϵ >0, t>1, and any n-point set
P⊂R^d, we show th...
Following the seminal works of Danzer (1956, 1986) and Stachó
(1965,1981...
We prove that a minor-closed class of graphs has bounded layered pathwid...
An obstacle representation of a graph is a mapping of the vertices onto
...
In an EPG-representation of a graph G each vertex is represented by a pa...
We study the following family of problems: Given a set of n points in
co...
In this paper we consider query versions of visibility testing and visib...