In this paper we study the threshold model of geometric inhomogeneous
ra...
We consider a variant of treewidth that we call clique-partitioned treew...
Detecting the dimensionality of graphs is a central topic in machine
lea...
A recent trend in the context of graph theory is to bring theoretical
an...
One of the most fundamental graph problems is finding a shortest path fr...
We study computational aspects of Gibbs point processes that are defined...
A Voronoi diagram is a basic geometric structure that partitions the spa...
Human lives are increasingly influenced by algorithms, which therefore n...
We study a general model for continuous spin systems with hard-core
inte...
Greedy routing has been studied successfully on Euclidean unit disk grap...
Finding a minimum vertex cover in a network is a fundamental NP-complete...
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs...
The VertexCover problem is proven to be computationally hard in differen...
A popular paradigm for 3D point cloud registration is by extracting 3D
k...
A common way to accelerate shortest path algorithms on graphs is the use...