APA (7th ed.) Citation

Segschneider, J., & Koster, A. M. C. A. (2025). Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes. Networks, 86(2), 220-237. https://doi.org/10.1002/net.22286

Chicago Style (17th ed.) Citation

Segschneider, Jenny, and Arie M. C. A. Koster. "Complexity of the Directed Robust B‐Matching Problem and Its Variants on Different Graph Classes." Networks 86, no. 2 (2025): 220-237. https://doi.org/10.1002/net.22286.

MLA (9th ed.) Citation

Segschneider, Jenny, and Arie M. C. A. Koster. "Complexity of the Directed Robust B‐Matching Problem and Its Variants on Different Graph Classes." Networks, vol. 86, no. 2, 2025, pp. 220-237, https://doi.org/10.1002/net.22286.