research
∙
06/15/2023
On the Giant Component of Geometric Inhomogeneous Random Graphs
In this paper we study the threshold model of geometric inhomogeneous ra...
share
research
∙
02/17/2023
Partitioning the Bags of a Tree Decomposition Into Cliques
We consider a variant of treewidth that we call clique-partitioned treew...
research
∙
02/13/2023
A simple statistic for determining the dimensionality of complex networks
Detecting the dimensionality of graphs is a central topic in machine lea...
research
∙
02/08/2023
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
A recent trend in the context of graph theory is to bring theoretical an...
research
∙
11/02/2022
Deep Distance Sensitivity Oracles
One of the most fundamental graph problems is finding a shortest path fr...
research
∙
04/04/2022
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials
We study computational aspects of Gibbs point processes that are defined...
research
∙
12/05/2021
Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane
A Voronoi diagram is a basic geometric structure that partitions the spa...
research
∙
10/11/2021
Towards Explainable Real Estate Valuation via Evolutionary Algorithms
Human lives are increasingly influenced by algorithms, which therefore n...
research
∙
07/19/2021
Algorithms for general hard-constraint point processes via discretization
We study a general model for continuous spin systems with hard-core inte...
research
∙
07/12/2021
Routing in Strongly Hyperbolic Unit Disk Graphs
Greedy routing has been studied successfully on Euclidean unit disk grap...
research
∙
10/06/2020
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
Finding a minimum vertex cover in a network is a fundamental NP-complete...
research
∙
05/16/2019
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs...
research
∙
04/29/2019
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
The VertexCover problem is proven to be computationally hard in differen...
research
∙
02/05/2019
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints
A popular paradigm for 3D point cloud registration is by extracting 3D k...
research
∙
05/07/2018
