1. Baharev, A., Schichl, H., Neumaier, A., Achterberg, T.: An exact method for the minimum feedback arc set problem. ACM J. Exp. Algorithmics 26, 1–28 (2021). https://doi.org/10.1145/3446429
2. Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1994, pp. 344–354. Society for Industrial and Applied Mathematics (1994). https://dl.acm.org/doi/10.5555/314464.314514
3. Bathie, G., Berthe, G., Coudert-Osmont, Y., Desobry, D., Reinald, A., Rocton, M.: PACE solver description: DreyFVS. In: Dell, H., Nederlof, J. (eds.) 17th International Symposium on Parameterized and Exact Computation. LIPIcs, vol. 249, pp. 31:1–31:4. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl (2022). https://doi.org/10.4230/LIPIcs.IPEC.2022.31
4. Bresich, M.: Hybrid metaheuristics based on large neighborhood search and mixed integer linear programming for the directed feedback vertex set problem. Master’s thesis, TU Wien, Austria (2023). https://doi.org/10.34726/hss.2023.102404
5. Cai, X., Huang, J., Jian, G.: Search algorithm for computing minimum feedback vertex set of a directed graph. Jisuanji Gongcheng/Comput. Eng. 32(4), 67–69 (2006)