(Monday, October 15)
| |
9:30--10:30 | |
Minimization algorithms for discrete convex functions | |
11:00--12:00 | |
Discrete convexity in supply chain models | |
14:00--15:00 | |
On the 3-dimensional rigidity matroid | |
15:30--16:30 | |
Highly connected rigidity matroids and rigidity in hypergraphs in various spaces | |
| |
(Tuesday, October 16)
| |
9:30--10:30 | |
M-convex functions on jump systems: A survey | |
11:00--12:00 | |
Scaling limits for optimization in random graphs using combinatorial interpolation | |
14:00--15:00 | |
Restricted b-mathcings | |
15:30--16:30 | |
Discrete convexity in network optimization: Matching forests and bibranchings | |
| |
(Wednesday, October 17)
| |
9:30--10:30 | |
The complexity of valued CSPs | |
11:00--12:00 | |
Discrete convexity and polynomial solvability in minimum 0-extension problems | |
14:00--15:00 | |
Generic rigidity with forced symmetry | |
15:30--16:30 | |
Rigidity of graphs with symmetry | |
| |
(Thursday, October 18)
| |
9:30--10:30 | |
Discrete convexity and unimodularity | |
11:00--12:00 | |
Even cycle decompositions of graphs with no odd K_4-minor | |
14:00--15:00 | |
Minimally non-ideal clutters and set functions | |
15:30--16:30 | |
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design |