
The Complexity of Dependency Detection and Discovery in Relational Databases
Multicolumn dependencies in relational databases come associated with t...
read it

The Flip Schelling Process on Random Geometric and ErdösRényi Graphs
Schelling's classical segregation model gives a coherent explanation for...
read it

Efficiently Approximating Vertex Cover on ScaleFree Networks with Underlying Hyperbolic Geometry
Finding a minimum vertex cover in a network is a fundamental NPcomplete...
read it

Efficiently Computing Maximum Flows in ScaleFree Networks
We study the maximumflow/minimumcut problem on scalefree networks, i....
read it

A Strategic Routing Framework and Algorithms for Computing Alternative Paths
Traditional navigation services find the fastest route for a single driv...
read it

Synchronized Planarity with Applications to Constrained Planarity Problems
We introduce the problem Synchronized Planarity. Roughly speaking, its i...
read it

The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
Satisfiability is considered the canonical NPcomplete problem and is us...
read it

The Minimization of Random Hypergraphs
We investigate the maximumentropy model B_n,m,p for random nvertex, m...
read it

Understanding the Effectiveness of Data Reduction in Public Transportation Networks
Given a public transportation network of stations and connections, we wa...
read it

Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs...
read it

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
The VertexCover problem is proven to be computationally hard in differen...
read it

Efficient Shortest Paths in ScaleFree Networks with Underlying Hyperbolic Geometry
A common way to accelerate shortest path algorithms on graphs is the use...
read it

On the Enumeration of Minimal Hitting Sets in Lexicographical Order
It is a longstanding open problem whether there exists an outputpolyno...
read it
Thomas Bläsius
is this you? claim profile