Length-Weighted Disjoint Path Allocation - Advice and Parametrization. - Elisabet Burjons; Fabian Frei; Jasmin Smula; David Wehner (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Efficient Circuit Simulation in MapReduce. - Fabian Frei; Koichi Wada 001 (ISAAC, 2019)

Advice for Online Knapsack With Removable Items. - Hans-Joachim Böckenhauer; Jan Dreier; Fabian Frei; Peter Rossmanith (CoRR, 2020)

From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata. - Elisabet Burjons; Fabian Frei; Martin Raszyk (CoRR, 2020)

Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata. - Fabian Frei; Juraj Hromkovic; Juhani Karhumäki (Fundam. Informaticae, 2020)

An Open Pouring Problem. - Fabian Frei; Peter Rossmanith; David Wehner (FUN, 2021)

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata. - Elisabet Burjons; Fabian Frei; Martin Raszyk (LICS, 2021)

Beneath, Behind, and Beyond Common Complexity Classes. - Fabian Frei (2021)

Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract). - Hans-Joachim Böckenhauer; Fabian Frei; Silvan Horvath (ICS, 2022)

Complexity of stability. - Fabian Frei; Edith Hemaspaandra; Jörg Rothe (J. Comput. Syst. Sci., 2022)

Delaying Decisions and Reservation Costs. - Elisabet Burjons; Fabian Frei; Matthias Gehnen; Henri Lotze; Daniel Mock; Peter Rossmanith (COCOON (1), 2023)

Bounds for c-Ideal Hashing. - Fabian Frei; David Wehner (FCT, 2023)

Zero-Memory Graph Exploration with Unknown Inports. - Hans-Joachim Böckenhauer; Fabian Frei; Walter Unger; David Wehner (SIROCCO, 2023)

Two-Way Non-Uniform Finite Automata. - Fabian Frei; Juraj Hromkovic; Rastislav Královic; Richard Královic (Int. J. Found. Comput. Sci., 2023)

Efficient deterministic MapReduce algorithms for parallelizable problems. - Fabian Frei; Koichi Wada 001 (J. Parallel Distributed Comput., 2023)

Hitting Meets Packing: How Hard Can It Be? - Jacob Focke; Fabian Frei; Shaohua Li 005; Dániel Marx; Philipp Schepper; Roohani Sharma; Karol Wegrzycki (ESA, 2024)

From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. - Fabian Frei; Ahmed Ghazy; Tim A. Hartmann; Florian Hörsch; Dániel Marx (ISAAC, 2024)

Brief Announcement: Content-Oblivious Leader Election on Rings. - Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin (PODC, 2024)

Invited Paper: Gathering Oblivious Robots in the Plane. - Fabian Frei; Koichi Wada 001 (SSS, 2024)

Gathering Semi-Synchronously Scheduled Two-State Robots. - Kohei Otaka; Fabian Frei; Koichi Wada 001 (SSS, 2024)

Removable Online Knapsack and Advice. - Hans-Joachim Böckenhauer; Fabian Frei; Peter Rossmanith (STACS, 2024)

Brief Announcement: Distinct Gathering Under Round Robin. - Fabian Frei; Koichi Wada 001 (DISC, 2024)

Content-Oblivious Leader Election on Rings. - Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin (DISC, 2024)

Tree Coloring: Random Order and Predictions. - Fabian Frei; Matthias Gehnen; Dennis Komm; Rastislav Královic; Richard Královic; Peter Rossmanith; Moritz Stocker (CoRR, 2024)

Priority algorithms with advice for disjoint path allocation problems. - Hans-Joachim Böckenhauer; Fabian Frei; Silvan Horvath (Theor. Comput. Sci., 2024)

Transformations of probability distributions. - Fabian Frei; Peter Rossmanith (Theor. Comput. Sci., 2024)

Finding Optimal Solutions with Neighborly Help. - Elisabet Burjons; Fabian Frei; Edith Hemaspaandra; Dennis Komm; David Wehner (Algorithmica, 2024)

Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs. - Karolina Drabik; Anita Dürr; Fabian Frei; Filip Mazowiecki; Karol Wegrzycki (CoRR, 2025)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity. - Fabian Frei; Ahmed Ghazy; Tim A. Hartmann; Florian Hörsch; Dániel Marx (CoRR, 2025)

Time-Optimal k-Server. - Fabian Frei; Dennis Komm; Moritz Stocker; Philip Whittington (CoRR, 2025)