21 citations · 44 across the 25 of their papers we have counts for
39 papers
Hyperbolic Sphericity
Thomas Bläsius, Lennart Großkreutz, Jean-Pierre von der Heydt
The sphericity of a graph is the minimum dimension d such that the graph has an intersection representation of d-dimensional balls of equal radius. While sphericity has been studie…
Benchmarking and Engineering Data Structures for Spherical Range Queries
Thomas Bläsius, Jean-Pierre von der Heydt, Tobias Kempf +2
Spherical range queries are a fundamental primitive for working with spatial data. Many spatial data structures have been developed to answer these queries, but choosing the optima…
Diameter Computation on (Random) Geometric Graphs
Thomas Bläsius, Annemarie Schaub, Marcus Wilhelm
We present an algorithm that computes the diameter of random geometric graphs (RGGs) with expected average degree for constant in $\tilde{O}(n^{\frac{3}{2}(1+δ…
Weighted Embeddings for Low-Dimensional Graph Representation
Thomas Bläsius, Jean-Pierre von der Heydt, Maximilian Katzmann +1
Learning low-dimensional numerical representations from symbolic data, e.g., embedding the nodes of a graph into a geometric space, is an important concept in machine learning. Whi…
Efficient Uniform Negative Edge Weights
Lukas Geis, Daniel Allendorf, Thomas Bläsius +4
We consider a maximum entropy edge weight model that allows for negative weights. Given a graph and possible weights typically consisting of positive and negative…
Structure and Independence in Hyperbolic Uniform Disk Graphs
Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak +2
We consider intersection graphs of disks of radius in the hyperbolic plane. Unlike the Euclidean setting, these graph classes are different for different values of , where v…