No. Title Author Year
1 Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs Bläsius, Thomas et al. 2019
2 From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) Friedrich, Tobias 2019
3 The Satisfiability Threshold for Non-Uniform Random 2-SAT Friedrich, Tobias et al. 2019
4 Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry Bläsius, Thomas et al. 2018
5 Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT Friedrich, Tobias et al. 2017
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 Greed is Good for Deterministic Scale-Free Networks Chauhan, Ankit et al. 2016
9 Hyperbolic Random Graphs: Separators and Treewidth Bläsius, Thomas et al. 2016
10 Probabilistic Routing for On-Street Parking Search Arndt, Tobias et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Imprint | Privacy Published by LZI