Talk—An Algorithmic Theory of Integer Programming (MIP 2019)

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

  1. 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.
  2. The theory of iterative augmentation. This is so far the most accessible introduction to the theory there is (in my opinion).
  3. The extras: a little bit about more advanced topics such as proximity theorems, reducibility bounds, strongly-poly algorithms, near-linear algorithms etc.
  4. A bit of research outlook.



I passed on to you what was most important and what had also been passed on to me. Christ died for our sins, just as the Scriptures said. He was buried, and he was raised from the dead on the third day, just as the Scriptures said. He was seen by Peter and then by the Twelve. After that, he was seen by more than 500 of his followers at one time, most of whom are still alive, though some have died. Then he was seen by James and later by all the apostles. Last of all, as though I had been born at the wrong time, I also saw him.

Paul of Tarsus, The First Epistle to the Corinthians, likely written no more than five years after Jesus' death (one of the oldest New Testament fragments).

I believe this. If you're curious, feel free to ask!