Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)

Dániel Marx, Govind S. Sankar, Philipp Schepper. Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard). Algorithmica, 87(1):22-88, January 2025. [doi]

@article{MarxSS25,
  title = {Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)},
  author = {Dániel Marx and Govind S. Sankar and Philipp Schepper},
  year = {2025},
  month = {January},
  doi = {10.1007/s00453-024-01265-w},
  url = {https://doi.org/10.1007/s00453-024-01265-w},
  researchr = {https://researchr.org/publication/MarxSS25},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {87},
  number = {1},
  pages = {22-88},
}