Sachin & Panda, B. (2026). Algorithms and complexity of strongly stable non-crossing matchings. Discrete Applied Mathematics, 379, 802-813. https://doi.org/10.1016/j.dam.2025.10.025
Citácia podle Chicago (17th ed.)Sachin a B.S Panda. "Algorithms and Complexity of Strongly Stable Non-crossing Matchings." Discrete Applied Mathematics 379 (2026): 802-813. https://doi.org/10.1016/j.dam.2025.10.025.
Citácia podľa MLA (8th ed.)Sachin a B.S Panda. "Algorithms and Complexity of Strongly Stable Non-crossing Matchings." Discrete Applied Mathematics, vol. 379, 2026, pp. 802-813, https://doi.org/10.1016/j.dam.2025.10.025.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..