25 citations · 119 across the 29 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2022
Edge and Pair Queries -- Random Graphs and Complexity
Dariusz Dereniowski, Przemysław Gordinowicz, Paweł Prałat
We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random gr…
math.CO2008★ 4 cited
Maximum vertex occupation time and inert fugitive: recontamination does help
Dariusz Dereniowski
Given a simple graph , 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…