I was invited to the MIP 2019 workshop to give a talk about my work on integer programming. I chose to talk about "the big paper". The structure of the talk is

- Structural parameterizations of IP, which allows us to phrase the main result as an FPT algorithm for IP when the largest coefficient and the primal or dual treedepth are bounded by a parameter.
- The theory of iterative augmentation. This is so far the most accessible introduction to the theory there is (in my opinion).
- The extras: a little bit about more advanced topics such as proximity theorems, reducibility bounds, strongly-poly algorithms, near-linear algorithms etc.
- A bit of research outlook.