1 citations · 1 across the 4 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
Continuous Defensive Domination Problems
Christoph Grüne, Tom Janßen
The problem Defensive -Covering, for some covering range , is a continuous facility location problem on undirected graphs where all edges have unit length. It is a general…
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…
cs.CC2022
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…