
On CrossingFamilies in Planar Point Sets
A kcrossing family in a point set S in general position is a set of k s...
read it

On the Connectivity and the Diameter of BetweennessUniform Graphs
Betweenness centrality is a centrality measure based on the overall amou...
read it

Nonhomotopic Loops with a Bounded Number of Pairwise Intersections
Let V_n be a set of n points in the plane and let x ∉ V_n. An xloop is ...
read it

Linear Layouts of Complete Graphs
A page (queue) with respect to a vertex ordering of a graph is a set of ...
read it

Graph Drawing and Network Visualization GD2020
Proceedings of GD2020: This volume contains the papers presented at GD 2...
read it

Upward Point Set Embeddings of Paths and Trees
We study upward planar straightline embeddings (UPSE) of directed trees...
read it

Long Alternating Paths Exist
Let P be a set of 2n points in convex position, such that n points are c...
read it

Holes and islands in random point sets
For d ∈ℕ, let S be a finite set of points in ℝ^d in general position. A ...
read it

On the Average Complexity of the kLevel
Let A be an arrangement of n lines in the Euclidean plane. The <i>kleve...
read it

Minimal Representations of Order Types by Geometric Graphs
In order to have a compact visualization of the order type of a given po...
read it

Crossing Numbers of BeyondPlanar Graphs
We study the 1planar, quasiplanar, and fanplanar crossing number in c...
read it

The Crossing Tverberg Theorem
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
read it

The exact chromatic number of the convex segment disjointness graph
Let P be a set of n points in strictly convex position in the plane. Let...
read it
Pavel Valtr
is this you? claim profile