Full Citation:
Daniël~Paulusma, Stefan Szeider. On the Parameterized Complexity of (k,s)-SAT. Information Processing Letters, volume 143, pages 34–36, 2019.
Stefan Szeider is a Professor at the Algorithms and Complexity Group.