| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Strongly Hyperbolic Unit Disk Graphs | Bläsius, Thomas et al. | 2023 |
| 2 | Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry | Bläsius, Thomas et al. | 2021 |
| 3 | Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane | Bläsius, Thomas et al. | 2021 |
| 4 | Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs | Bläsius, Thomas et al. | 2020 |
| 5 | Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs | Bläsius, Thomas et al. | 2019 |
| 6 | Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry | Bläsius, Thomas et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |