1 citations · 1 across the 4 of their papers we have counts for
5 papers
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
We study pursuit-evasion games on graphs with a single pursuer and an invisible evader. The pursuer may assign integer travel times to the edges of the graph and specify a finite s…
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
Sofia Brenner, Justin Dallant, Linda Kleist +3
We consider the set of matchings of a graph and a local change operation, called a flip, between them. In the combinatorial setting, the base graphs are either complete graphs or c…
Complexity of Firefighting on Graphs
Julius Althoetmar, Jamico Schade, Torben Schürenberg
We consider a pursuit-evasion game that describes the process of extinguishing a fire burning on the nodes of an undirected graph. We denote the minimum number of firefighters requ…
On the Price of Anarchy in Packet Routing Games with FIFO
Daniel Schmand, Torben Schürenberg, Martin Strehler
We investigate packet routing games in which network users selfishly route themselves through a network over discrete time, aiming to reach the destination as quickly as possible.…
On the Min-Max Star Partitioning Number
Sarah Feldmann, Torben Schürenberg
In this paper, we introduce a novel star partitioning problem for simple connected graphs . The goal is to find a partition of the edges into stars that minimizes the maxi…