6月21日(木) 午前 09:30 - 17:35 |
(1) |
09:30-09:55 |
組合せ問題の解を列挙索引化するZDD構築アルゴリズムの汎用化 |
○川原 純(JST/北大)・湊 真一(北大/JST) |
(2) |
09:55-10:20 |
系列二分決定グラフを操作するための豊富な演算体系の構築 |
○伝住周平・有村博紀(北大)・湊 真一(北大/JST) |
(3) |
10:20-10:45 |
Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data |
Masashi Kiyomi(Yokohama City Univ.)・○Yoshio Okamoto(Univ. of Electro-Comm.)・Toshiki Saitoh(Kobe Univ) |
|
10:45-11:00 |
休憩 ( 15分 ) |
(4) |
11:00-11:25 |
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees |
Tatsuya Akutsu・○Takeyuki Tamura(Kyoto Univ.)・Daiji Fukagawa(Doshisha Univ.)・Atsuhiro Takasu(NII) |
(5) |
11:25-11:50 |
Recursive and non recursive formulas in finitism |
○Eiichi Tanaka(Kobe Univ.) |
|
11:50-13:20 |
昼食 ( 90分 ) |
(6) |
13:20-13:45 |
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis |
○Kazuhisa Seto・Suguru Tamaki(Kyoto Univ.) |
(7) |
13:45-14:10 |
Candidate Boolean Functions towards Super-Quadratic Formula Size |
○Kenya Ueno(Kyoto Univ.) |
(8) |
14:10-14:35 |
距離d独立頂点集合問題の計算複雑さ |
江藤 宏・郭 豊瑞・○宮野英次(九工大) |
|
14:35-14:50 |
休憩 ( 15分 ) |
(9) |
14:50-15:15 |
An Algorithm for the Next-to-Shortest Path in Undirected Planar Graphs |
○Cong Zhang・Hiroshi Nagamochi(Kyoto Univ.) |
(10) |
15:15-15:40 |
Efficient Atomic Block for Faster Elliptic Curve Scalar Multiplication |
○Chitchanok Chuengsatiansup(Univ. of Tokyo) |
(11) |
15:40-16:05 |
Optimal Average Joint Hamming Weight for Asymmetric Representation |
○Vorapong Suppakitpaisarn(Univ. of Tokyo)・Masato Edahiro(Nagoya Univ.)・Hiroshi Imai(Univ. of Tokyo) |
|
16:05-16:20 |
休憩 ( 15分 ) |
(12) |
16:20-16:45 |
包含多角形列の計算手法とその実験的解析 |
○大西建輔(東海大)・星 守(電通大) |
(13) |
16:45-17:10 |
Approximation for the Geometric Unique Coverage Problem on Unit Squares |
○Takehiro Ito(Tohoku Univ.)・Shin-ichi Nakano(Gunma Univ.)・Yoshio Okamoto(Univ. of Electro-Comm.)・Yota Otachi・Ryuhei Uehara(JAIST)・Takeaki Uno(NII)・Yushi Uno(Osaka Prefecture Univ.) |
(14) |
17:10-17:35 |
Notes on weighted Delaunay triangulations and discrete Ricci flow
-- Relation between weighted Delaunay triangulations and circle packing metrics -- |
○Toshihiro Tanuma・Hiroshi Imai(Univ. of Tokyo) |