| No. | Title | Author | Year |
|---|---|---|---|
| 1 | A Strategic Routing Framework and Algorithms for Computing Alternative Paths | Bläsius, Thomas et al. | 2020 |
| 2 | Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs | Bläsius, Thomas et al. | 2020 |
| 3 | The Minimization of Random Hypergraphs | Bläsius, Thomas et al. | 2020 |
| 4 | Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs | Bläsius, Thomas et al. | 2019 |
| 5 | Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry | Bläsius, Thomas et al. | 2018 |
| 6 | The Parameterized Complexity of Dependency Detection in Relational Databases | Bläsius, Thomas et al. | 2017 |
| 7 | Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane | Bläsius, Thomas et al. | 2016 |
| 8 | Hyperbolic Random Graphs: Separators and Treewidth | Bläsius, Thomas et al. | 2016 |
| 9 | Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths | Baum, Moritz et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |