Calum MacRury

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 31

Top Topics

Easy Hard Easy Pattern

Phase Transition

Network Revenue Management

Top Venues

SIAM J. Discret. Math.

Discret. Appl. Math.

Publications

Calum MacRury, Nykyta Polituchyi, Pawel Pralat, Kinga Siuta, Przemyslaw Szufel
Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention. Public Transp. 16 (2) (2024)
Calum MacRury, Will Ma
Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. STOC (2024)
Will Ma, Calum MacRury, Pranav Nuti
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities. CoRR (2024)
Will Ma, Calum MacRury, Jingwei Zhang
Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions. CoRR (2024)
Calum MacRury, Erlang Surya
Sharp thresholds in adaptive random graph processes. Random Struct. Algorithms 64 (3) (2024)
Calum MacRury, Will Ma
Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. CoRR (2023)
Allan Borodin, Calum MacRury
Online Bipartite Matching in the Probe-Commit Model. CoRR (2023)
Patrick Bennett, Calum MacRury
Extending Wormald's Differential Equation Method to One-sided Bounds. CoRR (2023)
Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez
The Phase Transition of Discrepancy in Random Hypergraphs. SIAM J. Discret. Math. 37 (3) (2023)
Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat
Algorithms for p-Faulty Search on a Half-Line. Algorithmica 85 (8) (2023)
Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds. CoRR (2023)
Calum MacRury, Will Ma, Nathaniel Grammel
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. SODA (2023)
Calum MacRury, Will Ma, Nathaniel Grammel
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. CoRR (2022)
Pu Gao, Calum MacRury, Pawel Pralat
Perfect Matchings in the Semirandom Graph Process. SIAM J. Discret. Math. 36 (2) (2022)
Calum MacRury, Erlang Surya
Sharp Thresholds in Adaptive Random Graph Processes. CoRR (2022)
Pu Gao, Calum MacRury, Pawel Pralat
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. CoRR (2022)
Andrzej Dudek, Sean English, Alan M. Frieze, Calum MacRury, Pawel Pralat
Localization game for random graphs. Discret. Appl. Math. 309 (2022)
Pu Gao, Calum MacRury, Pawel Pralat
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. APPROX/RANDOM (2022)
Allan Borodin, Calum MacRury, Akash Rakheja
Prophet Matching in the Probe-Commit Model. APPROX/RANDOM (2022)
Pu Gao, Bogumil Kaminski, Calum MacRury, Pawel Pralat
Hamilton cycles in the semi-random graph process. Eur. J. Comb. 99 (2022)
Allan Borodin, Calum MacRury, Akash Rakheja
Secretary Matching Meets Probing with Commitment. APPROX-RANDOM (2021)
Sean English, Calum MacRury, Pawel Pralat
Probabilistic zero forcing on random graphs. Eur. J. Comb. 91 (2021)
Allan Borodin, Calum MacRury, Akash Rakheja
Prophet Inequality Matching Meets Probing with Commitment. CoRR (2021)
Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez
The Phase Transition of Discrepancy in Random Hypergraphs. CoRR (2021)
Pu Gao, Calum MacRury, Pawel Pralat
Perfect Matchings in the Semi-random Graph Process. CoRR (2021)
Allan Borodin, Calum MacRury, Akash Rakheja
Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models. CoRR (2020)
Allan Borodin, Calum MacRury, Akash Rakheja
Greedy Approaches to Online Stochastic Matching. CoRR (2020)
Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat
Probabilistically Faulty Searching on a Half-Line. CoRR (2020)
Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat
Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). LATIN (2020)
Dmitry Jakobson, Calum MacRury, Sergey Norin, Lise Turner
Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs. Electron. J. Comb. 25 (4) (2018)
Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez, Pawel Pralat, Kirill Ternovsky
The robot crawler graph process. Discret. Appl. Math. 247 (2018)
Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez, Pawel Pralat, Kirill Ternovsky
The Robot Crawler Number of a Graph. WAW (2015)