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