7 citations · 11 across the 3 of their papers we have counts for
6 papers
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
Thomas Bläsius, Sarel Cohen, Philipp Fischbeck +2
Random graph models are widely used to understand network properties and graph algorithms. Key to such analyses are the different parameters of each model, which affect various net…
On the External Validity of Average-Case Analyses of Graph Algorithms
Thomas Bläsius, Philipp Fischbeck
The number one criticism of average-case analysis is that we do not actually know the probability distribution of real-world inputs. Thus, analyzing an algorithm on some random mod…
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…
Understanding the Effectiveness of Data Reduction in Public Transportation Networks
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich +1
Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although…
Zeros and approximations of Holant polynomials on the complex plane
Katrin Casel, Philipp Fischbeck, Tobias Friedrich +2
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into…
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich +1
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasona…