activity
20192023
most citedPriority Algorithms with Advice for Disjoint Path Allocation Problems

1 citations · 1 across the 5 of their papers we have counts for

collaborators

9 papers

cs.DS2023

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…

cs.DS2023

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…

cs.DS2023

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…

cs.DS2022★ 1 cited

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…

cs.CC2020

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata

Elisabet Burjons, Fabian Frei, Martin Raszyk

The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine the analogous problem…

cs.DS2020

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…

cs.CC2019

Complexity of Stability

Fabian Frei, Edith Hemaspaandra, Jörg Rothe

Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computatio…

cs.CC2019

Efficient Circuit Simulation in MapReduce

Fabian Frei, Koichi Wada

The MapReduce framework has firmly established itself as one of the most widely used parallel computing platforms for processing big data on tera- and peta-byte scale. Approaching…

cs.CC2019

Finding Optimal Solutions With Neighborly Help

Elisabet Burjons, Fabian Frei, Edith Hemaspaandra +2

Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficientl…