activity
20232026
most citedOn the Parameterized Complexity of the Perfect Phylogeny Problem

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2025

Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables

Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas +1

We study a model of constraint satisfaction problems geared towards instances with few variables but with domain of unbounded size (udCSP). Our model is inspired by recent work on…