5 citations · 6 across the 7 of their papers we have counts for
8 papers
Coloring Reconfiguration under Color Swapping
Janosch Fuchs, Rin Saito, Tatsuhiro Suga +2
In the \textsc{Coloring Reconfiguration} problem, we are given two proper -colorings of a graph and asked to decide whether one can be transformed into the other by repeatedly a…
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 Online Graph Games
Janosch Fuchs, Christoph Grüne, Tom Janßen
Online computation is a concept to model uncertainty where not all information on a problem instance is known in advance. An online algorithm receives requests which reveal the ins…
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
Elisabet Burjons, Janosch Fuchs, Henri Lotze
In the area of graph drawing, the One-Sided Crossing Minimization Problem (OSCM) is defined on a bipartite graph with both vertex sets aligned parallel to each other and all edges…
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…
Online Exploration of Rectangular Grids
Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki +1
In this paper, we consider the problem of exploring unknown environments with autonomous agents. We model the environment as a graph with edge weights and analyze the task of visit…