1. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Symposium on Theory of Computing STOC, pp. 67–74. ACM Press, New York (2007)
2. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Trimmed Möbius inversion and graphs of bounded degree. In: Symposium on Theoretical Aspects of Computer Science STACS, IBFI, Schloss Dagstuhl, Germany, pp. 85–96 (2008)
3. Bumb, A.: Approximation algorithms for facility location problems. PhD Thesis, Univ. Twente, The Netherlands (2002)
4. Cesati, M.: The Turing way to parameterized complexity. Journal of Computer and System Sciences 67, 654–685 (2003)
5. Charikar, M., Guha, S., Tardos, E., Shmoys, D.S.: A constant-factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences 65, 129–149 (2002)