4 citations · 28 across the 18 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022★ 2 cited
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
Calum MacRury, Will Ma, Nathaniel Grammel
Online Contention Resolution Schemes (OCRS's) represent a modern tool for selecting a subset of elements, subject to resource constraints, when the elements are presented to the al…
math.CO2022★ 1 cited
Sharp Thresholds in Adaptive Random Graph Processes
Calum MacRury, Erlang Surya
The -process is a single player game in which the player is initially presented the empty graph on vertices. In each step, a subset of edges is independently s…
math.CO2022
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
Pu Gao, Calum MacRury, Pawel Pralat
The semi-random graph process is a single player game in which the player is initially presented an empty graph on vertices. In each round, a vertex is presented to the pla…