No. Title Author Year
1 A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs Friedrich, Tobias et al. 2022
2 Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances Bilò, Davide et al. 2022
3 Fixed-Parameter Sensitivity Oracles Bilò, Davide et al. 2022
4 Social Distancing Network Creation Friedrich, Tobias et al. 2022
5 Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081) Auger, Anne et al. 2022
6 A Spectral Independence View on Hard Spheres via Block Dynamics Friedrich, Tobias et al. 2021
7 Balanced Crown Decomposition for Connectivity Constraints Casel, Katrin et al. 2021
8 Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry Bläsius, Thomas et al. 2021
9 Efficiently Computing Maximum Flows in Scale-Free Networks Bläsius, Thomas et al. 2021
10 Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane Bläsius, Thomas et al. 2021
11 Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles Bilò, Davide et al. 2021
12 On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order Lagodzinski, J. A. Gregor et al. 2021
13 Space-Efficient Fault-Tolerant Diameter Oracles Bilò, Davide et al. 2021
14 The Impact of Geometry on Monochrome Regions in the Flip Schelling Process Bläsius, Thomas et al. 2021
15 A Strategic Routing Framework and Algorithms for Computing Alternative Paths Bläsius, Thomas et al. 2020
16 Fair Tree Connection Games with Topology-Dependent Edge Cost Bilò, Davide et al. 2020
17 Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs Bläsius, Thomas et al. 2020
18 The Minimization of Random Hypergraphs Bläsius, Thomas et al. 2020
19 Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431) Doerr, Carola et al. 2020
20 Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs Bläsius, Thomas et al. 2019
21 From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) Friedrich, Tobias 2019
22 The Satisfiability Threshold for Non-Uniform Random 2-SAT Friedrich, Tobias et al. 2019
23 Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry Bläsius, Thomas et al. 2018
24 Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT Friedrich, Tobias et al. 2017
25 The Parameterized Complexity of Dependency Detection in Relational Databases Bläsius, Thomas et al. 2017
26 Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane Bläsius, Thomas et al. 2016
27 Greed is Good for Deterministic Scale-Free Networks Chauhan, Ankit et al. 2016
28 Hyperbolic Random Graphs: Separators and Treewidth Bläsius, Thomas et al. 2016
29 Probabilistic Routing for On-Street Parking Search Arndt, Tobias et al. 2016
30 Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk) Friedrich, Tobias 2016
Current Page :
Number of result pages: 1
Number of documents: 30


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