| Date | Speaker | Title |
|---|---|---|
| Sep 20 | Jonah Weinbaum (Dartmouth Trust Lab) |
Building a Bombe: The Mathematics and Circuitry that Bested German Encryption |
| Sep 27 | Jonathan | Embedding planar graphs into bounded treewidth graphs with (1+ε) distortion |
| Oct 04 | - | - |
| Oct 11 | Reilly | Constant factor approximation algorithms for convex cover and hidden set in simple polygons |
| Oct 18 | Prantar Ghosh (Tennessee Tech University) |
The Power of Score Sequence of a Tournament |
| Oct 25 | Eli Friedman | Most Vital Nodes for Max Flow in Bounded Degree Forest Satellite Networks with Unbounded Transport Capacity |
| Nov 01 | - | - |
| Nov 08 | ||
| Nov 15 | ||
| Nov 22 |