APA (7th ed.) Citation

Aronshtam, L., Ilani, H., & Shufan, E. (2023). Perfect matching in bipartite hypergraphs subject to a demand graph. Annals of operations research, 321(1-2), 39-48. https://doi.org/10.1007/s10479-022-05073-9

Chicago Style (17th ed.) Citation

Aronshtam, Lior, Hagai Ilani, and Elad Shufan. "Perfect Matching in Bipartite Hypergraphs Subject to a Demand Graph." Annals of Operations Research 321, no. 1-2 (2023): 39-48. https://doi.org/10.1007/s10479-022-05073-9.

MLA (9th ed.) Citation

Aronshtam, Lior, et al. "Perfect Matching in Bipartite Hypergraphs Subject to a Demand Graph." Annals of Operations Research, vol. 321, no. 1-2, 2023, pp. 39-48, https://doi.org/10.1007/s10479-022-05073-9.