10月21日(金) 午前 電子情報システム・応物系 南講義棟103 10:00 - 16:20 |
(1) |
10:00-10:30 |
Random Popular Matchings with Incomplete Preference Lists |
○Suthee Ruangwises・Toshiya Itoh(Tokyo Tech.) |
(2) |
10:30-11:00 |
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems |
○Francois Le Gall(Kyoto Univ.) |
(3) |
11:00-11:30 |
A faster parameterized algorithm for Pseudoforest Deletion |
Hans Bodlaender(Utrecht Univ.)・Hirotaka Ono(Kyushu Univ.)・○Yota Otachi(JAIST) |
|
11:30-13:30 |
昼休み ( 120分 ) |
(4) |
13:30-14:00 |
Physical Bucket Sort with Two Kinds of Items |
○Atsuki Nagao・Shuhei Yoshizawa・Hiro Ito(UEC) |
(5) |
14:00-14:30 |
An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits. |
○Kazuhisa Seto(Seikei Univ.)・Suguru Tamaki(Kyoto Univ.)・Junichi Teruyama(NII) |
(6) |
14:30-15:00 |
On lower bounds for the complexity of the Frobenius problem and its subproblems |
○Shunichi Matsubara(Aoyama Gakuin Univ.) |
|
15:00-15:20 |
休憩 ( 20分 ) |
(7) |
15:20-15:50 |
シルエットパズルの凸配置の個数の研究 |
○岩井仁志・渋谷純吾・上原隆平(北陸先端大) |
(8) |
15:50-16:20 |
回転する地図に対するラベルサイズ最大化について |
○横須賀佑介・今井桂子(中大) |