1 citations · 1 across the 4 of their papers we have counts for
5 papers · 1 filter
Delaying Decisions and Reservation Costs
Elisabet Burjons, Fabian Frei, Matthias Gehnen +3
We study the Feedback Vertex Set and the Vertex Cover problem in a natural variant of the classical online model that allows for delayed decisions and reservations. Both problems c…
Zero-Memory Graph Exploration with Unknown Inports
Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger +1
We study a very restrictive graph exploration problem. In our model, an agent without persistent memory is placed on a vertex of a graph and only sees the adjacent vertices. The go…
Bounds for c-Ideal Hashing
Fabian Frei, David Wehner
In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideal…
Priority Algorithms with Advice for Disjoint Path Allocation Problems
Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath
We analyze the Disjoint Path Allocation problem (DPA) in the priority framework. Motivated by the problem of traffic regulation in communication networks, DPA consists of allocatin…
Removable Online Knapsack and Advice
Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith
In the knapsack problem, we are given a knapsack of some capacity and a set of items, each with a size and a value. The goal is to pack a selection of these items fitting the knaps…