Suivre
Calum MacRury
Titre
Citée par
Citée par
Année
Algorithms for p-Faulty Search on a Half-Line
A Bonato, K Georgiou, C MacRury, P Prałat
Algorithmica, 1-30, 2022
8*2022
Perfect Matchings in the Semirandom Graph Process
P Gao, C MacRury, P Prałat
SIAM Journal on Discrete Mathematics 36 (2), 1274-1290, 2022
8*2022
Probabilistic zero forcing on random graphs
S English, C MacRury, P Prałat
European Journal of Combinatorics 91, 103207, 2021
82021
Localization game for random graphs
A Dudek, S English, A Frieze, C MacRury, P Prałat
Discrete Applied Mathematics 309, 202-214, 2022
72022
Hamilton cycles in the semi-random graph process
P Gao, B Kamiński, C MacRury, P Prałat
European Journal of Combinatorics 99, 103423, 2022
72022
The robot crawler graph process
A Bonato, M Rita, C MacRury, J Nicolaidis, X Pérez-Giménez, P Prałat, ...
Discrete Applied Mathematics 247, 23-36, 2018
7*2018
Bipartite stochastic matching: Online, random order, and iid models
A Borodin, C MacRury, A Rakheja
arXiv preprint arXiv:2004.14304, 2020
52020
Prophet Matching in the Probe-Commit Model
A Borodin, C MacRury, A Rakheja
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022
4*2022
Secretary matching meets probing with commitment
A Borodin, C MacRury, A Rakheja
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021
4*2021
The phase transition of discrepancy in random hypergraphs
C MacRury, T Masařík, L Pai, X Pérez-Giménez
arXiv preprint arXiv:2102.07342, 2021
32021
Zero-forcing in random regular graphs
D Bal, P Bennett, S English, C MacRury, P Prałat
Journal of Combinatorics 12 (1), 85-116, 2021
3*2021
A fully adaptive strategy for hamiltonian cycles in the semi-random graph process
P Gao, C MacRury, P Pralat
arXiv preprint arXiv:2205.02350, 2022
22022
Distribution of coefficients of rank polynomials for random sparse graphs
D Jakobson, C MacRury, S Norin, L Turner
the electronic journal of combinatorics, P4. 50-P4. 50, 2018
22018
Sharp thresholds in adaptive random graph processes
C MacRury, E Surya
arXiv preprint arXiv:2207.14469, 2022
12022
Hamilton cycles in the semi-random graph process
P Gao, B Kaminski, C MacRury, P Pralat
arXiv preprint arXiv:2006.02599, 2020
12020
Approximation algorithms for network flow and minimum cut problems
C MacRury
McGill University (Canada), 2019
12019
Injective colouring of binomial random graphs
RM DEL RÍO-CHANONA, C MACRURY, J NICOLAIDIS, ...
preprint, 0
1
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
C MacRury, W Ma, N Grammel
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
2023
Zero Forcing Randomly on the Random Graph
S English, C MacRury, P Pralat
2021 Joint Mathematics Meetings (JMM), 2021
2021
Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention
C MacRury, N Polituchyi, P Praªat, K Siuta, P Szufel
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20