Mini-Symposium on New Developments of Discrete Algorithms

来週の月曜日午後です．是非お越しください．

Free of charge for participation (except for reception).

Date: February 15 (Monday) Afternoon
Place: 2nd Meeting Room of Faculty of Science, Tokyo Institute of Technology (on the 3rd floor of the main building of Ookayama Campus) http://www.titech.ac.jp/english/about/campus/o_map.html?id=03 (No. 1 is the main building)

Program

13:30-14:00 Kiyohito Nagano (Tokyo Tech)
- Submodular Function Minimization under Covering Constraints
14:00-14:30 Sang-il Oum (KAIST)
- Testing Branch-width at most k for fixed k or non-fixed k
14:40-15:10 Zoya Svitkina (U Alberta)
- Asymmetric Traveling Salesman Path and Directed Latency Problems
15:10-15:40 Naoyuki Kamiyama (Chuo U)
- The Root Location Problem for Arc-disjoint Arborescences
15:50-16:20 Vahab Mirrokni (Google)
- Recent developments in submodular maximization
16:20-16:50 Gagan Goel (Georgia Tech)
- Algorithms for Multi-agent Combinatorial Problems with Submodular Cost Functions
17:00-17:30 Takuro Fukunaga (Kyoto U)
- Algorithms for Partitioning Hypergraphs and Submodular Systems
17:30-18:00 Christian Sommer (U Tokyo and NII)
- Distance Oracles for Sparse Graphs
18:30- Reception