17 citations · 85 across the 28 of their papers we have counts for
6 papers · 1 filter
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…
On Crossing-Families in Planar Point Sets
Oswin Aichholzer, Jan Kynčl, Manfred Scheucher +2
A -crossing family in a point set in general position is a set of segments spanned by points of such that all segments mutually cross. In this short note we pres…
On the Connectivity and the Diameter of Betweenness-Uniform Graphs
David Hartman, Aneta Pokorná, Pavel Valtr
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have…
Non-homotopic Loops with a Bounded Number of Pairwise Intersections
Václav Blažej, Michal Opler, Matas Šileikis +1
Let be a set of points in the plane and let . An -loop is a continuous closed curve not containing any point of . We say that two -loops are non-…
Linear Layouts of Complete Graphs
Stefan Felsner, Laura Merker, Torsten Ueckerdt +1
A page (queue) with respect to a vertex ordering of a graph is a set of edges such that no two edges cross (nest), i.e., have their endpoints ordered in an ABAB-pattern (ABBA-patte…
Graph Drawing and Network Visualization GD2020
David Auber, Pavel Valtr
Proceedings of GD2020: This volume contains the papers presented at GD~2020, the 28th International Symposium on Graph Drawing and Network Visualization, held on September 18-20, 2…