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

Marx, D., Sankar, G. S., & Schepper, P. (2025). Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). Algorithmica, 87(1), 22. https://doi.org/10.1007/s00453-024-01265-w

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

Marx, Dániel, Govind S. Sankar, και Philipp Schepper. "Anti-factor Is FPT Parameterized by Treewidth and List Size (but Counting Is Hard)." Algorithmica 87, no. 1 (2025): 22. https://doi.org/10.1007/s00453-024-01265-w.

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

Marx, Dániel, et al. "Anti-factor Is FPT Parameterized by Treewidth and List Size (but Counting Is Hard)." Algorithmica, vol. 87, no. 1, 2025, p. 22, https://doi.org/10.1007/s00453-024-01265-w.