1. A. Björklund, T. Husfeldt, Exact algorithms for exact satisfiability and number of perfect matchings, in: Proc. ICALP'06, 2006, pp. 548–559
2. A. Björklund, T. Husfeldt, Inclusion–exclusion algorithms for counting set partitions, in: Proc. FOCS'06, 2006, pp. 575–582
3. A. Björklund, T. Husfeldt, M. Koivisto, Set partitioning via inclusion–exclusion, SIAM J. Comput., Special Issue for FOCS 2006, in press
4. N. Bourjeois, B. Escoffier, V.T. Paschos, Efficient approximation by “low-complexity” exponential algorithms, Technical Report 271, LAMSADE, Université Paris Dauphine, 2008
5. Efficient approximation of Min Set Cover by moderately exponential algorithms;Bourgeois;Theor. Comput. Sci.,2009