The Robot Crawler Number of a Graph. - Anthony Bonato; Rita M. del Río-Chanona; Calum MacRury; Jake Nicolaidis; Xavier Pérez-Giménez; Pawel Pralat; Kirill Ternovsky (WAW, 2015)

Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs. - Dmitry Jakobson; Calum MacRury; Sergey Norin; Lise Turner (Electron. J. Comb., 2018)

The robot crawler graph process. - Anthony Bonato; Rita M. del Río-Chanona; Calum MacRury; Jake Nicolaidis; Xavier Pérez-Giménez; Pawel Pralat; Kirill Ternovsky (Discret. Appl. Math., 2018)

Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). - Anthony Bonato; Konstantinos Georgiou; Calum MacRury; Pawel Pralat (LATIN, 2020)

Probabilistically Faulty Searching on a Half-Line. - Anthony Bonato; Konstantinos Georgiou; Calum MacRury; Pawel Pralat (CoRR, 2020)

Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models. - Allan Borodin; Calum MacRury; Akash Rakheja (CoRR, 2020)

Greedy Approaches to Online Stochastic Matching. - Allan Borodin; Calum MacRury; Akash Rakheja (CoRR, 2020)

Secretary Matching Meets Probing with Commitment. - Allan Borodin; Calum MacRury; Akash Rakheja (APPROX-RANDOM, 2021)

Prophet Inequality Matching Meets Probing with Commitment. - Allan Borodin; Calum MacRury; Akash Rakheja (CoRR, 2021)

Perfect Matchings in the Semi-random Graph Process. - Pu Gao; Calum MacRury; Pawel Pralat (CoRR, 2021)

Probabilistic zero forcing on random graphs. - Sean English; Calum MacRury; Pawel Pralat (Eur. J. Comb., 2021)

Prophet Matching in the Probe-Commit Model. - Allan Borodin; Calum MacRury; Akash Rakheja (APPROX/RANDOM, 2022)

A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. - Pu Gao; Calum MacRury; Pawel Pralat (APPROX/RANDOM, 2022)

Localization game for random graphs. - Andrzej Dudek; Sean English; Alan M. Frieze; Calum MacRury; Pawel Pralat (Discret. Appl. Math., 2022)

Hamilton cycles in the semi-random graph process. - Pu Gao; Bogumil Kaminski; Calum MacRury; Pawel Pralat (Eur. J. Comb., 2022)

Perfect Matchings in the Semirandom Graph Process. - Pu Gao; Calum MacRury; Pawel Pralat (SIAM J. Discret. Math., 2022)

Online Bipartite Matching in the Probe-Commit Model. - Allan Borodin; Calum MacRury (CoRR, 2023)

Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes - Calum MacRury (2023)

Algorithms for p-Faulty Search on a Half-Line. - Anthony Bonato; Konstantinos Georgiou; Calum MacRury; Pawel Pralat (Algorithmica, 2023)

The Phase Transition of Discrepancy in Random Hypergraphs. - Calum MacRury; Tomás Masarík; Leilani Pai; Xavier Pérez-Giménez (SIAM J. Discret. Math., 2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities. - Will Ma; Calum MacRury; Pranav Nuti (EC, 2024)

Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. - Calum MacRury; Will Ma (STOC, 2024)

Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions. - Will Ma; Calum MacRury; Jingwei Zhang (CoRR, 2024)

Sharp thresholds in adaptive random graph processes. - Calum MacRury; Erlang Surya (Random Struct. Algorithms, 2024)

Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention. - Calum MacRury; Nykyta Polituchyi; Pawel Pralat; Kinga Siuta; Przemyslaw Szufel (Public Transp., 2024)

Proportionally Fair Matching via Randomized Rounding. - Sharmila Duppala; Nathaniel Grammel; Juan Luque; Calum MacRury; Aravind Srinivasan (AAAI, 2025)

Forward-backward Contention Resolution Schemes for Fair Rationing. - Will Ma; Calum MacRury; Cliff Stein 001 (EC, 2025)

Extending Wormald's differential equation method to one-sided bounds. - Patrick Bennett; Calum MacRury (Comb. Probab. Comput., 2025)

Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. - Alan M. Frieze; Pu Gao; Calum MacRury; Pawel Pralat; Gregory B. Sorkin (Eur. J. Comb., 2025)

On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. - Calum MacRury; Will Ma; Nathaniel Grammel (Oper. Res., 2025)