Last update: 2018/03/31 (Added Slides)

Program book online version

3/28

08:30~08:50 Registration

08:50~09:00 Opening

Chair：Mishima Miwako

• 09:00~09:45 Momihara Koji：Switching for Hadamard Matrices–A new approach to the excess problem
• 09:45~10:10 Fu Hung-Lin: Probabilistic constructions of pooling designs

10:20~10:40: Photo

Chair：Li Wei-Tian

• 10:45~11:30 Katona O. H. Gyula: The forbidden poset problem
• 11:30~11:55 Vizer Máté: Smart elements in combinatorial group testing problems
• 11:55~12:20 Chang Huilan: Density-based Interval Group Testing

Lunch

Chair: Hirao Masatake

• 13:30~13:50 Shao Minfeng: A construction of ZDB functions
• 13:50~14:10 Gu Yujie: On codes with the identifiable parent property for multimedia fingerprinting
• 14:10~14:30 Fan Jinping: A new combinatorial structure for pooling design

Chair: Chang Huilan

• 14:30~14:55 Fu Tung-Shan: A Simple Transformation for Mahonian Statistics on Labelings of Rake Posets
• 14:44~15:20 Huang Ming-Hway: Gregarious strongly balanced (4,2)-tadpole designs
• 15:20~15:40 Tsunoda Yu: Polynomial-time construction algorithm for X-codes of constant weight three

Chair: Lu Xiao-Nan

• 13:55~16:20 Fujiwara Yuichiro: Correcting both qubit loss and decoherence by stabilizer codes
• 16:20~16:45 Miyamoto Nobuko: On λ-compatible cyclic difference packings
• 16:40~17:00 Satake Shohei: Graphs with some adjacency properties

18:00~20:00 Banquet

3/29

Chair：Fu Hung-Lin

• 09:00~09:45 Ozeki Kenta: Kempe equivalence of 3-edge-colorings in cubic graphs on the projective plane
• 09:45~10:10 Hirao Masatake: QMC design, frame potential and determinantal point process on the sphere
• 10:10~10:35 Lo Yuan-Hsun: Channel hopping sequences with full rendezvous diversity for cognitive radio networks

Chair：Lo Yuan-Hsun

• 10:45~11:20 Wong Wing Shing: Schedule Sequences and Their Relatives
• 11:20~11:45 Shum Wing-Ki, Kenneth: Bounds and Constructions of Protocol Sequences with Applications to Wireless Communication Systems
• 11:45~12:10 Chen Hong-Bin: Beyond a Consequence of Bertrand's Postulate

Lunch

Chair：Ota Katsuhiro

• 13:20~13:45 Fujisawa Jun: Edge proximity condition and matching extension in cubic bipartite graphs
• 13:45~14:10 Yashima Takamasa: Degree-sum conditions for the set of paths with specified end-vertices in bipartite graphs
• 14:10~14:35 Fujita Shinya: Safe Sets in Graphs

Chair：Chen Hong-Bin

• 14:40~15:05 Lai Hsin-Hao: Results on Additive Colorings of Halin Graphs
• 15:05~15:25 Cheng Yen-Jen: Spectral bounds obtained by reweighting entries in a row of a nonnegative matrix
• 15:25~15:45 Abe Toshiki: The signature of edge-colorings and list-edge-colorings of regular graphs on the projective plane

Chair：Miao Ying

• 16:00~16:25 Matsubara Kazuki: Cyclically near-resolvable 4-cycle systems of 2Kv
• 16:25~16:45 Saito Ken: On binary codes with complementary dual
• 16:45~17:05 Yamada Kohei: On multifold factorizations of cyclic groups into subsets

3/30

Chair：Fu Chin-Mei

• 09:00~09:45 Wang Tao-Ming: Graph Labeling and Coloring of Antimagic Types
• 09:45~10:10 Lin Yuan-Lung: Circulant Orthogonal Arrays and its Application to fMRI Experiments

Chair：Jimbo Masakazu

• 10:30~11:15 Huang Kuo-Ching: On the H-Decompositions of Graphs with H of Size Three
• 11:15~11:40 Lu Xiao-Nan: Locating arrays with error correcting ability
• 11:40~12:00 Noguchi Satoshi: q-ary cyclic codes with large minimum distances

13:30~17:00 Free Discussion