activity
20092026
most citedOn Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids

16 citations · 64 across the 32 of their papers we have counts for

collaborators
Showing 2025Show all

2 papers · 1 filter

cs.DS2025

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems

Aaron Bernstein, Sayan Bhattacharya, Nick Fischer +2

We establish the first update-time separation between dynamic algorithms against oblivious adversaries and those against adaptive adversaries in natural dynamic graph problems, bas…

cs.DS2025

Deterministic Dynamic Maximal Matching in Sublinear Update Time

Aaron Bernstein, Sayan Bhattacharya, Peter Kiss +1

We give a fully dynamic deterministic algorithm for maintaining a maximal matching of an -vertex graph in amortized update time. This breaks the long-standi…