Algorithms and Pretty Theorems - Jack's Talks



(1.1.0) The Marriage Theorem, Monday, Feb. 8 at 11:30
(1.2.0) The Hungarian Method & Optimum Network Flow, Monday, Feb. 8 at 11:30
(1.3.2) Network Flow - Edmonds-Karp, JACM (reprint), Monday, Feb. 8 at 11:30
(2.1.0) Branchings, Tuesday, Feb. 9 at 11:30
(3.1.0) Polymatroids, Part 1, Wednesday, Feb. 10 at 10:00
(3.1.1) Matroid Partitioning (reprint), Wednesday, Feb. 10 at 10:00
(3.2.0) Polymatroids, Part 2, Wednesday, Feb. 10 at 10:00
(4.1.0) No Return and Mean Payoff Games, Thursday, Feb. 11 at 10:00
(4.2.0) Lehman's Game, Thursday, Feb. 11 at 10:00
(4.2.1) Directed Switching Games by Yahya & Michel (reprint), Thursday, Feb. 11 at 10:00
(4.3.0) BiMatrix Games, Thursday, Feb. 11 at 10:00
(4.3.1) On Finding Another Room-Partition, Thursday, Feb. 11 at 10:00
(4.3.2) Euler Complexes (Oiks), Thursday, Feb. 11 at 10:00
(4.3.3) Sperner Oiks, Friday, Feb. 12 at 10:00
(4.3.4) Scarf Oiks, Friday, Feb. 12 at 10:00
(6.2.0) Eliminate Gerrymandering, Balinski (reprint), Friday, Feb. 12 at 10:00
(7.1.1) Solving Systems of Linear Equations (reprint), Friday, Feb. 12 at 10:00
(7.3.1) Redundancy and Helly (reprint), Friday, Feb. 12 at 11:30