Seguir
Calum MacRury
Calum MacRury
Columbia Business School
Dirección de correo verificada de columbia.edu - Página principal
Título
Citado por
Citado por
Año
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
152023
Algorithms for p-Faulty Search on a Half-Line
A Bonato, K Georgiou, C MacRury, P Prałat
Algorithmica 85 (8), 2485-2514, 2023
14*2023
Perfect matchings in the semirandom graph process
P Gao, C MacRury, P Prałat
SIAM Journal on Discrete Mathematics 36 (2), 1274-1290, 2022
142022
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
142022
Probabilistic zero forcing on random graphs
S English, C MacRury, P Prałat
European Journal of Combinatorics 91, 103207, 2021
132021
Online bipartite matching in the probe-commit model
A Borodin, C MacRury
arXiv preprint arXiv:2303.08908, 2023
11*2023
Prophet matching in the probe-commit model
A Borodin, C MacRury, A Rakheja
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022
10*2022
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
9*2018
Sharp thresholds in adaptive random graph processes
C MacRury, E Surya
Random Structures & Algorithms 64 (3), 741-767, 2024
82024
Localization game for random graphs
A Dudek, S English, A Frieze, C MacRury, P Prałat
Discrete Applied Mathematics 309, 202-214, 2022
82022
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
P Gao, C MacRury, P Pralat
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022
82022
Secretary matching meets probing with commitment
A Borodin, C MacRury, A Rakheja
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021
6*2021
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
6*2021
Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals
C MacRury, W Ma
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1629 …, 2024
42024
The phase transition of discrepancy in random hypergraphs
C MacRury, T Masařík, L Pai, X Pérez-Giménez
SIAM Journal on Discrete Mathematics 37 (3), 1818-1841, 2023
42023
Extending Wormald's Differential Equation Method to One-sided Bounds
P Bennett, C MacRury
arXiv preprint arXiv:2302.12358, 2023
22023
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
Injective colouring of binomial random graphs
RM DEL RÍO-CHANONA, C MACRURY, J NICOLAIDIS, ...
preprint, 0
2
Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions
W Ma, C MacRury, J Zhang
arXiv preprint arXiv:2403.05378, 2024
12024
Online decision-making in a randomized environment: Stochastic matching and adaptive random graph processes
C MacRury
University of Toronto (Canada), 2023
12023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20