25 citations · 119 across the 29 of their papers we have counts for
1 paper · 2 filters
Dariusz Dereniowski
Given a simple graph G, we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of st…