Thu, Apr 22
10:00 - 17:05 |
| (1) |
10:00-10:35 |
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs |
Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Pref. Univ.) |
| (2) |
10:35-11:10 |
Counting the number of dominating sets in graph classes |
Shuji Kijima (Kyushu Univ), Yoshio Okamoto (Tokyo Inst. of Tech.), Takeaki Uno (NII) |
| (3) |
11:10-11:45 |
Averaging Techniques for Competitive Auctions |
Takayuki Ichiba (Nomura Research Institute), Kazuo Iwama (Kyoto Univ.) |
| |
11:45-13:15 |
Lunch Break ( 90 min. ) |
| (4) |
13:15-13:50 |
Complete classification of small realizable oriented matroids |
Hiroyuki Miyata, Sonoko Moriyama (Tokyo Univ.), Komei Fukuda (ETH Zurich) |
| (5) |
13:50-14:25 |
Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux |
Shinya Anzai, Jinhee Chun, Ryosei Kasai (Tohoku Univ.), Matias Korman (Univ. Libre de Bruxelles), Takeshi Tokuyama (Tohoku Univ.) |
| |
14:25-14:35 |
Break ( 10 min. ) |
| (6) |
14:35-15:10 |
Transposition Invariant Fully Compressed Pattern Matching Algorithm |
Wataru Matsubara, Ayumi Shinohara (Tohoku Univ.) |
| (7) |
15:10-15:45 |
Elementary Formal System with Nonterminal Symbols |
Tomohiko Koide, Ayumi Shinohara (Tohoku Univ.) |
| |
15:45-15:55 |
Break ( 10 min. ) |
| (8) |
15:55-16:30 |
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings |
Takuro Fukunaga (Kyoto Univ.) |
| (9) |
16:30-17:05 |
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees |
Hiroshi Hirai (Kyoto Univ.) |
is
