
Weak Coloring Numbers of Intersection Graphs
Weak and strong coloring numbers are generalizations of the degeneracy o...
read it

EdgeMinimum Saturated kPlanar Drawings
For a class 𝒟 of drawings of loopless multigraphs in the plane, a drawin...
read it

The Local Queue Number of Graphs with Bounded Treewidth
A queue layout of a graph G consists of a vertex ordering of G and a par...
read it

Plattenbauten: Touching Rectangles in Space
Planar bipartite graphs can be represented as touching graphs of horizon...
read it

Guarding Quadrangulations and Stacked Triangulations with Edges
Let G = (V,E) be a plane graph. A face f of G is guarded by an edge vw ∈...
read it

Four Pages Are Indeed Necessary for Planar Graphs
An embedding of a graph in a book consists of a linear order of its vert...
read it

On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
We study covering numbers and local covering numbers with respect to dif...
read it

Engineering Negative Cycle Canceling for Wind Farm Cabling
In a wind farm turbines convert wind energy into electrical energy. The ...
read it

Local and Union Page Numbers
We introduce the novel concepts of local and union book embeddings, and,...
read it

Planar Graphs have Bounded QueueNumber
We show that planar graphs have bounded queuenumber, thus proving a con...
read it

A Note on Covering Young Diagrams with Applications to Local Dimension of Posets
We prove that in every cover of a Young diagram with 2kk steps with gene...
read it

Planar Ramsey graphs
We say that a graph H is planar unavoidable if there is a planar graph G...
read it

Planar Graphs of Bounded Degree have Constant Queue Number
A queue layout of a graph consists of a linear order of its vertices and...
read it

The number of crossings in multigraphs with no empty lens
Let G be a multigraph with n vertices and e>4n edges, drawn in the plane...
read it

The queuenumber of posets of bounded width or height
Heath and Pemmaraju conjectured that the queuenumber of a poset is boun...
read it

The queuenumber of planar posets
Heath and Pemmaraju conjectured that the queuenumber of a poset is boun...
read it

The interval number of a planar graph is at most three
The interval number of a graph G is the minimum k such that one can assi...
read it

Induced and Weak Induced Arboricities
We define the induced arboricity of a graph G, denoted by ia(G), as the...
read it

BeyondPlanarity: Density Results for Bipartite Graphs
Beyondplanarity focuses on the study of geometric and topological graph...
read it

Decomposing 4connected planar triangulations into two trees and one path
Refining a classical proof of Whitney, we show that any 4connected plan...
read it
Torsten Ueckerdt
is this you? claim profile