git clone --recursive https://github.com/feldsherov/pace2016
Than just run make in the repository root.
The executable file will be created in folder src.
For run <path_to_file>/fsolve < <path to instance>.graph. It outputs size of minimal feedback vertexset (I hope, it outputs exactly that.)
That is an implementation of algorithm by Becker with optimized processing of multiple edges.
Namely, suppose A and B have several edges between them, hence A or B belongs to answer and we can recursively branch on two cases. That allows improve complexity to O(2^l * 4^(k-l)), where l is the size of maximal independent set of multiply edges. (Set of multiply edges, which haven't got common vertices.)