APA (7th ed.) Citation

Ezra, T., Feldman, M., Gravin, N., & Tang, Z. (2025). Tight Bounds for Secretary Matching in General Graphs. Mathematics of Operations Research (INFORMS), 50(4), 3039. https://doi.org/10.1287/moor.2022.0206

Chicago Style (17th ed.) Citation

Ezra, Tomer, Michal Feldman, Nikolai Gravin, and Zhihao Tang. "Tight Bounds for Secretary Matching in General Graphs." Mathematics of Operations Research (INFORMS) 50, no. 4 (2025): 3039. https://doi.org/10.1287/moor.2022.0206.

MLA (9th ed.) Citation

Ezra, Tomer, et al. "Tight Bounds for Secretary Matching in General Graphs." Mathematics of Operations Research (INFORMS), vol. 50, no. 4, 2025, p. 3039, https://doi.org/10.1287/moor.2022.0206.