1: Backdoors to Acyclic SAT 2: Backdoors to Satisfaction 3: The generalized work function algorithm is competitive for the generalized 2-server problem 4: The Binary Perfect Phylogeny with Persistent characters