Submitted by Anders Wind (awis@itu.dk) and Mikael Lindemann (mlin@itu.dk)
The public repository for the submission of the PACE challenge 2017 B-Track: Minimum Fill-In . The core algorithm is based on Fomin and Villanger's article Subexponential Parameterized Algorithm for Minimum Fill-in, with a few adjustments for optimization.
The report can be seen here