MacRury, Calum
- Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals
2023/10/16 by MacRury, Calum, Ma, Will · 2 citations
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
- Hamilton Cycles in the Semi-random Graph Process
2020/06/04 by Pu Gao, Bogumił Kamiński, Gao, Pu +5 · 1 citation
Computer Science · Decision Sciences · #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Game Theory and Applications #Optimization and Search Problems #Probability (math.PR)
- Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions
2024/03/08 by Ma, Will, MacRury, Calum, Zhang, Jingwei · 2 citations
#Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
- A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
2022/05/04 by Gao, Pu, MacRury, Calum, Pralat, Pawel · 1 citation
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Localization Game for Random Graphs
2019/10/24 by Dudek, Andrzej, English, Sean, Frieze, Alan +2 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
- Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds
2023/11/09 by Alan Frieze, Pu Gao, Frieze, Alan +7 · 1 citation
Computer Science · #Algorithms and Data Compression #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems