No. Title Author Year
1 Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry Bläsius, Thomas et al. 2018
2 Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT Friedrich, Tobias et al. 2017
3 The Parameterized Complexity of Dependency Detection in Relational Databases Bläsius, Thomas et al. 2017
4 Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane Bläsius, Thomas et al. 2016
5 Greed is Good for Deterministic Scale-Free Networks Chauhan, Ankit et al. 2016
6 Hyperbolic Random Graphs: Separators and Treewidth Bläsius, Thomas et al. 2016
7 Probabilistic Routing for On-Street Parking Search Arndt, Tobias et al. 2016
8 Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk) Friedrich, Tobias 2016
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI