1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
The 2-Attractor Problem is NP-Complete
Janosch Fuchs, Philip Whittington
A -attractor is a combinatorial object unifying dictionary-based compression. It allows to compare the repetitiveness measures of different dictionary compressors such as Lempel…
The Complexity of Graph Exploration Games
Janosch Fuchs, Christoph Grüne, Tom Janßen
Graph Exploration problems ask a searcher to explore an unknown environment. The environment is modeled as a graph, where the searcher needs to visit each vertex beginning at some…
The Complexity of Packing Edge-Disjoint Paths
Jan Dreier, Janosch Fuchs, Tim A. Hartmann +4
We introduce and study the complexity of Path Packing. Given a graph and a list of paths, the task is to embed the paths edge-disjoint in . This generalizes the well known H…
The Graph Exploration Problem with Advice
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Moving an autonomous agent through an unknown environment is one of the crucial problems for robotics and network analysis. Therefore, it received a lot of attention in the last de…