No. Title Author Year
1 Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs Bläsius, Thomas et al. 2020
2 Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431) Doerr, Carola et al. 2020
3 Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs Bläsius, Thomas et al. 2019
4 From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) Friedrich, Tobias 2019
5 The Satisfiability Threshold for Non-Uniform Random 2-SAT Friedrich, Tobias et al. 2019
6 Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry Bläsius, Thomas et al. 2018
7 Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT Friedrich, Tobias et al. 2017
8 The Parameterized Complexity of Dependency Detection in Relational Databases Bläsius, Thomas et al. 2017
9 Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane Bläsius, Thomas et al. 2016
10 Greed is Good for Deterministic Scale-Free Networks Chauhan, Ankit et al. 2016
11 Hyperbolic Random Graphs: Separators and Treewidth Bläsius, Thomas et al. 2016
12 Probabilistic Routing for On-Street Parking Search Arndt, Tobias et al. 2016
13 Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk) Friedrich, Tobias 2016
Current Page :
Number of result pages: 1
Number of documents: 13

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