5 citations · 6 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023
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…
cs.CC2023★ 1 cited
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…