APA (7th ed.) Citation

MacRury, C., Ma, W., & Grammel, N. (2025). On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. Operations Research, 73(2), 689. https://doi.org/10.1287/opre.2023.0339

Chicago Style (17th ed.) Citation

MacRury, Calum, Will Ma, and Nathaniel Grammel. "On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs." Operations Research 73, no. 2 (2025): 689. https://doi.org/10.1287/opre.2023.0339.

MLA (9th ed.) Citation

MacRury, Calum, et al. "On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs." Operations Research, vol. 73, no. 2, 2025, p. 689, https://doi.org/10.1287/opre.2023.0339.