17 citations · 85 across the 28 of their papers we have counts for
42 papers
Rerouting Curves on Surfaces
Timo Brand, Stefan Felsner, Henry Förster +8
We study the problem of reconfiguring a crossing-free embedding of a graph on a surface, with edges represented as curves, into another crossing-free embedding of the same graph on…
Structure of betweenness uniform graphs with low values of betweenness centrality
Babak Ghanbari, David Hartman, Vít Jelínek +3
This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not t…
Three Edge-disjoint Plane Spanning Paths in a Point Set
Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta +1
We consider the following problem: Given a set of distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on ? Each spanning…
Bounding and computing obstacle numbers of graphs
Martin Balko, Steven Chaplick, Robert Ganian +4
An obstacle representation of a graph consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of to points such that…
Erdős--Szekeres-type problems in the real projective plane
Martin Balko, Manfred Scheucher, Pavel Valtr
We consider point sets in the real projective plane and explore variants of classical extremal problems about planar point sets in this setting, with a main focus o…
Tight bounds on the expected number of holes in random point sets
Martin Balko, Manfred Scheucher, Pavel Valtr
For integers and , a -hole in a set of points in general position in is a -tuple of points from in convex position such that the…