會議議程 (Program)
06月26日(週五) 報到及校園參訪
06月27日(週六) A:國際會議廳 B:SC1003 C:理學院小劇場 (國際會議廳,SC1003,及理學院小劇場皆在理學院一樓)
06月28日(週日)
06月29日(週一)
06月30日(週二)
06月27日(週六) A:國際會議廳 B:SC1003 C:理學院小劇場 (國際會議廳,SC1003,及理學院小劇場皆在理學院一樓)
08:30-09:00 | A 會議開幕 |
09:00-10:00 | A 朱緒鼎 Colouring and list colouring of sparse graphs (p.07) |
10:00~10:30 | Tea Break |
10:30-11:00 | A 張鎮華 Total weight choosability of trees (p.13) |
B 陸 玫 Linearized Wenger Graphs (p.74) | |
C 常 安 Tensor spectra of uniform hypergraphs (p.11) | |
11:00~11:30 | A 王彩蓮 Total weight choosability problem for 2-degenerate graphs (p.98) |
B 王維凡 The surviving rate of a graph (p.94) | |
C 張曉東 The spectral radius of directed graphs (p.112) | |
11:30~12:00 | A 陳宏賓 On-line choice number of complete multipartite graphs of independence number 4 (p.18) |
B 廖崇碩 The electric vehicle touring problem (p.63) | |
C 郭曙光 Ordering connected non-bipartite graphs by the least Q-eigenvalue (p.31) | |
12:00-13:30 | Lunch |
13:30-14:30 | A 游森棚 XD Stirling numbers and polynomial Stirling numbers (p.01) |
14:30-15:00 | A 陳鵬安 On almost s-stable Kneser hypergraph colorings (p.20) |
B 馮衍全 Tetravalent edge-primitive graphs (p.25) | |
C 李書超 On the normalized Laplacian, degree-kirchhoff index and spanning trees of graphs (p.57) | |
15:00-15:30 | Tea Break |
15:30-16:00 | A 王光輝 Vertex colorings induced by edge (total) colorings (p.90) |
B 傅東山 Refined major-balance identities on 321-avoiding involutions (p.28) | |
C 侯耀平 Distance and Laplacian matrices of some graphs (p.36) | |
16:00-16:30 | A 嚴志弘 r- Equitable coloring of Kronecker products of graphs (p.108) |
B 王 毅 Total positivity of combinatorial matrices (p.96) | |
C 路在平 On edge-transitive graphs of square-free order and small valency (p.75) | |
16:30-17:00 | A 林武雄 Equitable colorings and vertex orderings (p.66) |
B 李相文 Z3-connectivity and 2-neighborhoods of claw-free graphs (p.61) | |
C 譚必信 A characterization of graphs G with nullity |V(G)|-2m(G)+2c(G) (p.86) | |
17:00-17:30 | A 康麗英 Coloring clique-hypergraphs of graphs with no subdivision of K5 (p.44) |
B 鄭斯恩 Some combinatorial statistics in Dyck paths (p.22) | |
C 王道明 On zero-sum flows of hexagonal grids (p.92) | |
18:00- | 歡迎餐會 |
08:30-09:30 | A 向 青 Cameron-Liebler line classes (p.04) |
09:30-10:00 | A 劉德芬 Bounds on strong chromatic index of Halin graphs (p.69) |
B 孫智偉 New divisibility results on certain sums of binomial coefficients (p.85) | |
C 杜文學 Graph automorphisms from the geometric viewpoint (p.24) | |
10:00~10:30 | Tea Break |
10:30-11:00 | A 潘志實 The circular chromatic number of oriented circuit double cover of flower snark (p.80) |
B 郭軍偉 Some congruences involving powers of Legendre polynomials (p.33) | |
C 彭岳建 Motzkin-Straus type results on hypergraphs (p.82) | |
11:00~11:30 | A 張勝貴 Arc-coloring of digraphs (p.110) |
B 林延輯 Restricted growth functions of order 2 (p.67) | |
C 王星煒 Log-behavior of combinatorial sequences (p.91) | |
11:30~12:00 | A 蔡建生 Degenerate and star coloring of graphs (p.08) |
B 王秀梅 On matching cover of graphs (p.95) | |
C 張之正 U(n+1) and C_n Bailey lattices and their applications (p.114) | |
12:00-13:30 | Lunch |
13:30-14:00 | A 傅恆霖 Adaptive algorithms for complex group testing (p.27) |
B 郭大衛 All-to-all broadcast problem of graphs under the halfduplex all-port model (p.47) | |
C 高欣欣 On mutually independent hamiltonian cycles (p.45) | |
14:00-14:30 | A 張惠蘭 Interval group testing for consecutive positives (p.15) |
B 顏經和 The L(p,q)-equitable labeling problem (p.103) | |
C 胡智全 Weakly bipancyclic bipartite graphs (p.37) | |
14:30-15:00 | A 張飛黃 A new model for group testing (p.12) |
B 張定邦 Choice identification number of a graph (p.16) | |
C 郝荣霞 Fault tolerance of the balanced hypercube BHn (p.35) | |
15:00-15:30 | Tea Break |
15:30-16:00 | A 周文賢 Subfield value sets over finite fields (p.23) |
B 曹海濤 Recent progresses on cycle frames and almost resolvable cycle systems (p.10) | |
C 李渭天 Poset-free families (p.58) | |
16:00-16:30 | A 趙立璐 On a zero-sum problem in cyclic group (p.115) |
B 孫新民 On the existence of simple BIBDs (p.84) | |
C 郭君逸 Bounding the number of elements in a P-free family (p.30) | |
16:30-17:00 | A 沈俊嚴 Algebraic methods in sum-product problems (p.83) |
B 呂惠娟 Optimal star coverings of bipartite graphs (p.73) | |
C 季 青 On spt-crank of vector partitions (p.43) | |
17:00-17:30 | A 馬 杰 Extremal problems on diameter critical graphs (p.76) |
B 周君靈 Bounds on the dimensions of 2-spontaneous emission error designs (p.116) | |
C 顏 僅 On disjoint cycles with specified properties in graphs (p.102) | |
18:00- | 大會晚宴 |
08:30-09:30 | A 馮 濤The interplay between finite geometry and algebraic combinatorics (p.02) |
09:30-10:00 | A 葉鴻國 A note on graphs whose maximum nullity equals to zero forcing number (p.107) |
B 張曉岩 An SDP randomized approximation algorithm for max hypergraph partition problems (p.113) | |
C 李喬良 Zero-one law for connectivity in superposition of random key graphs on random geometric graphs (p.55) | |
10:00~10:30 | Tea Break |
10:30-11:00 | A 高金美 Equipartite gregarious bull systems (p.26) |
B 梁家顯 Equation of the form XX-1=m over a group ring Z[G] (p.51) | |
C 周三明 Cyclotomic graphs and perfect codes (p.117) | |
11:00~11:30 | A 黃明輝 Strong balanced bull-designs (p.40) |
B 吳佃華 Optimal variable-weight OOCs with unequal auto- and cross-correlation constraints (p.99) | |
C 高玉斌 The generalized competition indices of primitive digraphs (p.29) | |
11:30~12:00 | A 賴春暉 Some problems on graphs (p.49) |
B 李建平 Approximation algorithms for solving the constrained arc routing problem in mixed graphs (p.52) | |
C 徐守軍 The complete forcing numbers of graphs (p.100) | |
12:00-13:30 | Lunch |
13:30- | 半日參訪行程 |
08:30-09:30 | A符麥克Applications of analytic combinatorics in mathematical biology(p.03) |
09:30-10:00 | A 李學良 The matching energy of random graphs (p.60) |
B 晏衛根 Enumeration of spanning trees of graphs (p.104) | |
C 黃國卿 Near-factor-critical graphs (p.39) | |
10:00~10:30 | Tea Break |
10:30-11:00 | A 翁志文 Degree pairs of a graph (p.97) |
B 張勝元 The linear complexities of several classes of generalized cyclotomic sequences (p.111) | |
C 劉俊宏 Erdȍs-Pósa property for topological minors (p.68) | |
11:00~11:30 | A 陳秋媛 A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (p.17) |
B 祝寶宣 Unimodality results of combinatorial sequences (p.118) | |
C 林麗双 Ramanujan type congruences modulo 5 for overpartitions (p.64) | |
11:30~12:00 | A 毛 華 The application of matroids in the concept lattices (p.77) |
B 王也州 The reciprocal sums of the Fibonacci numbers (p.89) | |
C 楊勝良 Combinatorics of Riordan arrays (p.106) | |
12:00-13:30 | Lunch |
13:30-14:00 | A 賴欣豪 Results on global secure number of graphs (p.50) |
B 楊大慶 Decomposing a graph into forests: the Nine Dragon Tree Conjecture is true (p.105) | |
C 黃皜文 The Galois closure of a graph cover (p.38) | |
14:00-14:30 | A 董立大 Neighborhood sequences of graphs (p.88) |
B 林承潁 Finding k-clubs in undirected graphs (p.65) | |
C 黃 鵬 The signless Laplacian spectral radius of k-connected irregular graphs (p.41) | |
14:30-15:00 | A 劉晉宇 The game Grundy arboricity of graphs (p.71) |