(Monday, October 15)
9:30--10:30
Akiyoshi Shioura (Tohoku University)
Minimization algorithms for discrete convex functions
11:00--12:00
S. Thomas McCormick (University of British Columbia)
Discrete convexity in supply chain models
14:00--15:00
Tibor Jordan (Kyoto University / Eötvös Loránd University)
On the 3-dimensional rigidity matroid
15:30--16:30
Viktoria E. Kaszanitzky (Eötvös Loránd University)
Highly connected rigidity matroids and
rigidity in hypergraphs in various spaces

(Tuesday, October 16)
9:30--10:30
Kazuo Murota (University of Tokyo)
M-convex functions on jump systems: A survey
11:00--12:00
Prasad Tetali (Georgia Institute of Technology)
Scaling limits for optimization in random graphs
using combinatorial interpolation
14:00--15:00
Kristof Berczi (Eötvös Loránd University)
Restricted b-mathcings
15:30--16:30
Kenjiro Takazawa (Kyoto University)
Discrete convexity in network optimization:
Matching forests and bibranchings

(Wednesday, October 17)
9:30--10:30
Stanislav Zivny (University of Oxford / University of Warwick)
The complexity of valued CSPs
11:00--12:00
Hiroshi Hirai (University of Tokyo)
Discrete convexity and polynomial solvability in
minimum 0-extension problems
14:00--15:00
Louis Theran (FU Berlin)
Generic rigidity with forced symmetry
15:30--16:30
Shin-ichi Tanigawa (Kyoto University)
Rigidity of graphs with symmetry

(Thursday, October 18)
9:30--10:30
Gleb Koshevoy (CEMI, Russian Academy of Sciences)
Discrete convexity and unimodularity
11:00--12:00
Sang-il Oum (KAIST)
Even cycle decompositions of graphs with no odd K_4-minor
14:00--15:00
Tamas Kiraly (Eötvös Loránd University)
Minimally non-ideal clutters and set functions
15:30--16:30
Takuro Fukunaga (Kyoto University)
Iterative rounding approximation algorithms for
degree-bounded node-connectivity network design