On the Complexity of Integer Programming with Fixed-Coefficient Scaling (Short Paper). - Jorke M. de Vlas (CP, 2024)

On the Parameterized Complexity of the Perfect Phylogeny Problem. - Jorke M. de Vlas (SOFSEM, 2024)

Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables. - Peter Jonsson; Victor Lagerkvist; Jorke M. de Vlas; Magnus Wahlström (CoRR, 2025)