Tue, Oct 17 AM 09:00 - 16:50 |
(1) |
09:00-09:35 |
Convex Grid Drawings of Plane Graphs with Rectangular Contours |
Akira Kamada (Tohoku Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Tohoku Univ.) |
(2) |
09:35-10:10 |
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs |
Kazuyuki Miura (Fukushima Univ.), Tetsuya Matsuno, Takao Nishizeki (Tohoku Univ.) |
|
10:10-10:25 |
Break ( 15 min. ) |
(3) |
10:25-11:00 |
Approximability of Partitioning Graphs with Supply and Demand |
Takehiro Ito (Tohoku Univ.), Erik D.Demaine (MIT), Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
(4) |
11:00-11:35 |
Efficient Algorithms for Airline problem |
Ryuhei Uehara (JAIST) |
(5) |
11:35-12:10 |
Byzantine Agreement on the Order of Processing Received Requests is Solvable Deterministically in Asynchronous Systems |
Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
|
12:10-13:40 |
Lunch Break ( 90 min. ) |
(6) |
13:40-14:15 |
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars |
Hiroyuki Seki, Yuki Kato (NAIST) |
(7) |
14:15-14:50 |
The Number of Possible Weave Patterns in Case of Using Long-Eye Heald |
Isamu Matsuura, Masayoshi Andoh (AITEC), Tomio Hirata (Nagoya Univ.) |
(8) |
14:50-15:25 |
A Randomness Based Analysis on the Data Size Needed for Generating Reliable Rules |
Kazuya Haraguchi (Kyoto Univ.), Mutsunori Yagiura (Nagoya Univ.), Endre Boros (Rutgers Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.) |
|
15:25-15:40 |
Break ( 15 min. ) |
(9) |
15:40-16:15 |
On the Computer-Assisted Proof of Linear Lower Bounds on Circuit Size |
Kazuyuki Amano (Gunma Univ.) |
(10) |
16:15-16:50 |
An Exponentioal Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity |
Kei Uchizawa, Eiji Takimoto (Tohoku Univ.) |