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


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