| No. |
Title |
Author |
Year |
| 1 |
A Branch-And-Bound Algorithm for Cluster Editing |
Bläsius, Thomas et al. |
2022 |
| 2 |
On the External Validity of Average-Case Analyses of Graph Algorithms |
Bläsius, Thomas et al. |
2022 |
| 3 |
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry |
Bläsius, Thomas et al. |
2021 |
| 4 |
Efficiently Computing Maximum Flows in Scale-Free Networks |
Bläsius, Thomas et al. |
2021 |
| 5 |
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane |
Bläsius, Thomas et al. |
2021 |
| 6 |
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm |
Bläsius, Thomas et al. |
2021 |
| 7 |
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm |
Bläsius, Thomas et al. |
2021 |
| 8 |
Synchronized Planarity with Applications to Constrained Planarity Problems |
Bläsius, Thomas et al. |
2021 |
| 9 |
The Impact of Geometry on Monochrome Regions in the Flip Schelling Process |
Bläsius, Thomas et al. |
2021 |
| 10 |
A Strategic Routing Framework and Algorithms for Computing Alternative Paths |
Bläsius, Thomas et al. |
2020 |
| 11 |
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs |
Bläsius, Thomas et al. |
2020 |
| 12 |
The Minimization of Random Hypergraphs |
Bläsius, Thomas et al. |
2020 |
| 13 |
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs |
Bläsius, Thomas et al. |
2019 |
| 14 |
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry |
Bläsius, Thomas et al. |
2018 |
| 15 |
The Parameterized Complexity of Dependency Detection in Relational Databases |
Bläsius, Thomas et al. |
2017 |
| 16 |
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane |
Bläsius, Thomas et al. |
2016 |
| 17 |
Hyperbolic Random Graphs: Separators and Treewidth |
Bläsius, Thomas et al. |
2016 |
| 18 |
Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths |
Baum, Moritz et al. |
2016 |
