@InProceedings{shao_et_al:LIPIcs.ISAAC.2023.57,
author = {Shao, Shuai and \v{Z}ivn\'{y}, Stanislav},
title = {{A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {57:1--57:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.57},
URN = {urn:nbn:de:0030-drops-193597},
doi = {10.4230/LIPIcs.ISAAC.2023.57},
annote = {Keywords: matchings, factors, edge constraint satisfaction problems, terminal backup problem, delta matroids}
}