Calum MacRury

Orcid: 0000-0003-0966-4332

According to our database1, Calum MacRury authored at least 27 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention.
Public Transp., June, 2024

Sharp thresholds in adaptive random graph processes.
Random Struct. Algorithms, May, 2024

Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions.
CoRR, 2024

Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2023
The Phase Transition of Discrepancy in Random Hypergraphs.
SIAM J. Discret. Math., September, 2023

Algorithms for p-Faulty Search on a Half-Line.
Algorithmica, August, 2023

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds.
CoRR, 2023

Online Bipartite Matching in the Probe-Commit Model.
CoRR, 2023

Extending Wormald's Differential Equation Method to One-sided Bounds.
CoRR, 2023

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Perfect Matchings in the Semirandom Graph Process.
SIAM J. Discret. Math., 2022

Hamilton cycles in the semi-random graph process.
Eur. J. Comb., 2022

Localization game for random graphs.
Discret. Appl. Math., 2022

A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process.
Proceedings of the Approximation, 2022

Prophet Matching in the Probe-Commit Model.
Proceedings of the Approximation, 2022

2021
Probabilistic zero forcing on random graphs.
Eur. J. Comb., 2021

Perfect Matchings in the Semi-random Graph Process.
CoRR, 2021

Prophet Inequality Matching Meets Probing with Commitment.
CoRR, 2021

Secretary Matching Meets Probing with Commitment.
Proceedings of the Approximation, 2021

2020
Greedy Approaches to Online Stochastic Matching.
CoRR, 2020

Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models.
CoRR, 2020

Probabilistically Faulty Searching on a Half-Line.
CoRR, 2020

Probabilistically Faulty Searching on a Half-Line - (Extended Abstract).
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2018
The robot crawler graph process.
Discret. Appl. Math., 2018

Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs.
Electron. J. Comb., 2018

2015
The Robot Crawler Number of a Graph.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015


  Loading...