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-88. https://doi.org/10.1007/s00453-024-01265-w
ISO-690 (author-date, English)MARX, Dániel, SANKAR, Govind S. und SCHEPPER, Philipp, 2025. Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). Algorithmica. 1 Januar 2025. Vol. 87, no. 1, p. 22-88. DOI 10.1007/s00453-024-01265-w.
Modern Language Association 9th editionMarx, D., G. S. Sankar, und P. Schepper. „Anti-Factor Is FPT Parameterized by Treewidth and List Size (but Counting Is Hard)“. Algorithmica, Bd. 87, Nr. 1, Januar 2025, S. 22-88, https://doi.org/10.1007/s00453-024-01265-w.
Mohr Siebeck - Recht (Deutsch - Österreich)Marx, Dániel/Sankar, Govind S./Schepper, Philipp: Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard), Algorithmica 2025, 22-88.
Emerald - HarvardMarx, D., Sankar, G.S. und Schepper, P. (2025), „Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)“, Algorithmica, Vol. 87 No. 1, S. 22-88.