This is the original paper giving the two branching algorithms for satisfiability as discussed in the lecture. 

Source paper for the quasi-convex optimization used to determine the parameters as in the last slide.

This is the source paper for counting cardinality-k independent sets. 

Official link: 

https://link.springer.com/chapter/10.1007/978-3-540-72870-2_5

This is the source paper establishing the completeness for Independent Set in the complexity class W[1].