1 citations · 1 across the 3 of their papers we have counts for
7 papers · 1 filter
The Complexity of Dependency Detection and Discovery in Relational Databases
Thomas Bläsius, Tobias Friedrich, Martin Schirneck
Multi-column dependencies in relational databases come associated with two different computational tasks. The detection problem is to decide whether a dependency of a certain type…
Efficiently Computing Maximum Flows in Scale-Free Networks
Thomas Bläsius, Tobias Friedrich, Christopher Weyand
We study the maximum-flow/minimum-cut problem on scale-free networks, i.e., graphs whose degree distribution follows a power-law. We propose a simple algorithm that capitalizes on…
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
Thomas Bläsius, Maximilian Böther, Philipp Fischbeck +9
Traditional navigation services find the fastest route for a single driver. Though always using the fastest route seems desirable for every individual, selfish behavior can have un…
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann +3
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs (GIRG) are two similar generative network models that were designed to resemble complex real world networks…
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
Thomas Bläsius, Annette Karrer, Ignaz Rutter
A simultaneous embedding (with fixed edges) of two graphs and with common graph is a pair of planar drawings of and that coincide on . I…
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
Thomas Bläsius, Ignaz Rutter
The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We…