Program (tentative)

Design Theory and its Applications

RIMS, Kyoto University

June 11, 2007 to June 13, 2007

June 11 (Mon.)

9:30 - 10:30 (Invited Talk)

・Walter D. Wallis*,　　 Triple Arrays

10:50 - 11:50

・Charles J. Colbourn*,　 Optical Grooming, Graph Decompositions, and Linear

　　　　 Programming Duality

・Violet Syrotiuk,　 Cover-Free Families and Topology-Transparent Communication

(Lunch)

13:20 - 14:20 (Invited Talk)

・Jonathan Jedwab*,　　 Golay complementary sequences: a multi-dimensional approach

14:40 - 15:40

・Keisuke Shiromoto,　 Tutte Polynomials of Linear Codes

・Ying Miao,　 Optimal Frequency-Hopping Sequences Based on Trace Functions

16:00 - 17:00

・Yuichiro Fujiwara,　 X-Tolerant Compaction Circuits from Steiner Systems

・Masanori Sawa,　 Steiner quadruple systems with point-regular automorphism groups

　　　

June 12 (Tue.)

9:30　 - 10:30 (Invited Talk)

・Akihiro Munemasa,　　　　　 Codes and lattices of Hadamard matrices

10:50　 - 11:50

・Masaaki Harada,　 Small Non-Embeddable Quasi-Derived Designs

・Yutaka Hiramine,　 On abelian affine difference sets

(Lunch)

13:20 - 14:20 (Invited Talk)

・Marco Buratti,　　　　 On Steiner Γ-systems

14:40　 - 15:40

・ Koji Momihara,　 Bounds and Constructions for Constant Weight Conflict-Avoiding

　　　　　 Codes

・ Miwako Mishima,　 On Conflict-Avoiding Codes of Length n=4m for Three　 Active Users

16:00　 - 17:00

・Roger K. Yeh,　　　　 Graph Labelings with Three Levels of Constraints

・Kenta Ozeki*,　　　　 On Relative Length of Longest Paths and Cycles

June 13 (Wed.)

9:30　 - 10:30 (Invited Talk)

・Cun-Quan Zhang*,　　　　 Spanning trees, dense subgraphs, parity subgraphs and flows

　　　

10:50　 - 11:50

・Kazuhiko Ushio,　　　　　 Balanced C₄-Cinquefoil Designs

・Takeshi Sugiyama*,　　　 Cycles through specified vertices with forbidden subgraphs

* Supported by “International Workshop on Combinatorics 2007”, Keio University COE Program.