Παραπομπή σε μορφή APA (7η εκδ.)

Klemz, B., & Rote, G. (2022). Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. https://doi.org/10.17169/refubium-33566

Παραπομπή σε μορφή Chicago (17η εκδ.)

Klemz, Boris, και Günter Rote. Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. 2022. https://doi.org/10.17169/refubium-33566.

Παραπομπή σε μορφή MLA (9th εκδ.)

Klemz, Boris, και Günter Rote. Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. 2022. https://doi.org/10.17169/refubium-33566.