Kaiserstraße 21 66386 St. Ingbert (Germany)
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
ACM-SIAM Symposium on Discrete Algorithms (SODA)