
Towards Explainable Real Estate Valuation via Evolutionary Algorithms
Human lives are increasingly influenced by algorithms, which therefore n...
read it

Algorithms for general hardconstraint point processes via discretization
We study a general model for continuous spin systems with hardcore inte...
read it

Routing in Strongly Hyperbolic Unit Disk Graphs
Greedy routing has been studied successfully on Euclidean unit disk grap...
read it

Pareto optimal and popular house allocation with lower and upper quotas
In the house allocation problem with lower and upper quotas, we are give...
read it

SpaceEfficient FaultTolerant Diameter Oracles
We design fedge faulttolerant diameter oracles (fFDOs). We preprocess...
read it

NearOptimal Deterministic SingleSource Distance Sensitivity Oracles
Given a graph with a source vertex s, the Single Source Replacement Path...
read it

Efficiency and Stability in Euclidean Network Design
Network Design problems typically ask for a minimum cost subnetwork fro...
read it

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

Adaptive Sampling for Fast Constrained Maximization of Submodular Function
Several largescale machine learning tasks, such as data summarization, ...
read it

Selfish Creation of Social Networks
Understanding realworld networks has been a core research endeavor thro...
read it

On Counting (Quantum)Graph Homomorphisms in Finite Fields of Prime Order
We study the problem of counting the number of homomorphisms from an inp...
read it

Balanced Crown Decomposition for Connectivity Constraints
We introduce the balanced crown decomposition that captures the structur...
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

Fair Tree Connection Games with TopologyDependent Edge Cost
How do rational agents selforganize when trying to connect to a common ...
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

Polymer Dynamics via Cliques: New Conditions for Approximations
Abstract polymer models are systems of weighted objects, called polymers...
read it

timeXplain – A Framework for Explaining the Predictions of Time Series Classifiers
Modern time series classifiers display impressive predictive capabilitie...
read it

FlowBased Network Creation Games
Network Creation Games(NCGs) model the creation of decentralized communi...
read it

Shortest Distances as Enumeration Problem
We investigate the single source shortest distance (SSSD) and all pairs ...
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

NonMonotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
We study the problem of maximizing a nonmonotone submodular function un...
read it

From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
We generalize the tree doubling and Christofides algorithm, the two most...
read it

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

Convergence and Hardness of Strategic Schelling Segregation
The phenomenon of residential segregation was captured by Schelling's fa...
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

Zeros and approximations of Holant polynomials on the complex plane
We present fully polynomial approximation schemes for general classes of...
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

Geometric Network Creation Games
Network Creation Games are a wellknown approach for explaining and anal...
read it

The Satisfiability Threshold for NonUniform Random 2SAT
Propositional satisfiability (SAT) is one of the most fundamental proble...
read it

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints
A popular paradigm for 3D point cloud registration is by extracting 3D k...
read it

Pareto Optimization for Subset Selection with Dynamic Cost Constraints
In this paper, we consider the subset selection problem for function f w...
read it

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
We investigate the performance of a deterministic GREEDY algorithm for t...
read it

Randomized Local Search Heuristics for Submodular Maximization and Covering Problems: Benefits of Heavytailed Mutation Operators
A core feature of evolutionary algorithms is their mutation operator. Re...
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

Quasirandom Agents for Image Transition and Animation
Quasirandom walks show similar features as standard random walks, but w...
read it

Approximating Optimization Problems using EAs on ScaleFree Networks
It has been experimentally observed that realworld networks follow cert...
read it

A Generic Betandrun Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover
A common strategy for improving optimization algorithms is to restart th...
read it

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
Population diversity is essential for avoiding premature convergence in ...
read it

The Benefit of Sex in Noisy Evolutionary Search
The benefit of sexual recombination is one of the most fundamental quest...
read it

Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point
Many optimization problems arising in applications have to consider seve...
read it

Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation
Wind energy plays an increasing role in the supply of energy worldwide....
read it
Tobias Friedrich
is this you? claim profile