Memorial page for Professor Li-Da Tong

Professor Li-Da Tong (1969 – 2022) was a professor in the Department of Applied Mathematics and a jointly appointed professor in the Institute of Precision Medicine at National Sun Yat-sen University (NSYSU). obtained his Ph.D. in 1998 from National Chiao Tung University, under the supervision of Gerard Jennhwa Chang. His research focus on combinatorics, interconnection networks, and artificial intelligence. Professor Tong retired from NSYSU and established the company algoCORE, LTD in 2022.

• Department page
• MATHSCINET
• Math Genealogy

Photos

• Google Photos: Li-Da Tong
• 董老師退休留言版（2022 年組合新苗研討會贈送）
• 2023 組合數學與圖論紀念研討會
• 中山新聞 客製化AI瞄準企業痛點　中山大學榮退教授創業簽約
• 中山新聞 期許精彩下半場　中山大學歡送111年下半年退休人員
• 中山新聞 與中鋼產學鏈結　中山大學成立「人工智慧研究暨產業推廣中心」
• 中山新聞 深耕越南 應數系與河內第二師範大學締約

Please contact Jephian Lin <jephianlin [at] gmail [dot] com> if you could provide photos.

Education

• 1998 Ph.D., Mathematics, National Chiao Tung University
• 1993 M.S., Mathematics, National Chiao Tung University

Employment

• 2020–2023 Jointly Appointed Professor, Institute of Precision Medicine, NSYSU (institute preparation committee member since 2019)
• 2008–2022 Professor, Department of Applied Mathematics, NSYSU
• 2019–2020 Center CEO, Artificial Intelligence Reserach and Promotion Center, NSYSU
• 2016–2019 Department chair, Department of Applied Mathematics, NSYSU
• 2003–2008 Associate professor, Department of Applied Mathematics, NSYSU
• 2001–2003 Assistant professor, Department of Applied Mathematics, NSYSU
• 1998–2001 Assistant professor, Department of Applied Mathematics, Tunghai University

Honors

• 2006–2007 Excellent Teaching Award

Professional services

• 2017–2019 Review committee member, Ministry of Science and Technology

Publications

[35]	Fujita, Shinya; Kitaev, Sergey; Sato, Shizuka; Tong, Li-Da. On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 38(3):515-525, 2021.
[34]	Tong, Li-Da; Yang, Hao-Yu; Zhu, Xuding. Hamiltonian spectra of graphs. GRAPHS AND COMBINATORICS, 35(4):827-836, 2019.
[33]	Tong, Li-Da; Yang, Hao-Yu. Hamiltonian numbers in oriented graphs. JOURNAL OF COMBINATORIAL OPTIMIZATION, 34(4):1210-1217, 2017.
[32]	Chang, Ting-Pang; Tong, Li-Da. The Hamiltonian numbers in graphs. ARS COMBINATORIA, 123:151-158, 2015.
[31]	Tong, Li-Da. Automorphisms of neighborhood sequence of a graph. TAIWANESE JOURNAL OF MATHEMATICS, 19(4):1085-1096, 2015.
[30]	T.-P. Chang and L.-D. Tong. Choice identification of a graph. DISCRETE APPLIED MATHEMATICS, 167:61–71, 2014.
[29]	T.-P. Chang and L.-D. Tong. The hamiltonian numbers in digraphs. JOURNAL OF COMBINATORIAL OPTIMIZATION, 5(4):694–701, 2013.
[28]	A. Raspaud and L.-D. Tong. Minimum identifying code graphs. DISCRETE APPLIED MATHEMATICS, 160(9): 1385–1389, 2012.
[27]	G. J. Chang, T.-P. Chang, and L.-D. Tong. The hamiltonian numbers of Möbius double loop networks. JOURNAL OF COMBINATORIAL OPTIMIZATION, 23:462–470, 2012.
[26]	T.-P. Chang and L.-D. Tong. The hamiltonian numbers of graphs. Ars Combinatoria, acceped, 2011.
[25]	Y.-P. Chen, Y.-M. Huang, and L.-D. Tong. Rearrangeable nonblocking optical interconnection network fabrics with crosstalk constraints. IEEE/ACM TRANSACTIONS ON NETWORKING, 18(5):1413–1421, 2010.
[24]	L.-D. Tong. Full orientability of graphs. ELECTRONIC NOTES ON DISCRETE MATHEMATICS, 34:669–672, 2009.
[23]	Hsin-Hao Lai, K. W. Lih, C.-Y. Lin, and L.-D. Tong. When is the direct product of generalized mycielski graphs a cover graph. ARS COMBINATORIA, ACCEPTED, 2009.
[22]	H.-H. Lai, K. W. Lih, and L.-D. Tong. Full orientability of graphs with at most one dependent arc. DISCRETE APPLIED MATHEMATICS, 157(13):2969–2972, 2009.
[21]	G. J. Chang, C.-Y. Lin, and L.-D. Tong. Independent arcs of acyclic orientations of complete r-partite graphs. DISCRETE MATHEMATICS, 309:4280–4286, 2009.
[20]	L.-D. Tong. Geodetic sets and steiner sets in graphs. DISCRETE MATHEMATICS, 309:4205–4207, 2009.
[19]	J. T. Hung, L.-D. Tong, and H. T. Wang. The hull and geodetic numbers of orientations of graphs. DISCRETE MATHEMATICS, 309:2134–2139, 2009.
[18]	L.-D. Tong. The forcing hull and forcing geodetic numbers of graphs. DISCRETE APPLIED MATHEMATICS, 157:1159–1163, 2009.
[17]	L.-D. Tong. The (a, b)-forcing geodetic graphs. DISCRETE MATHEMATICS, 309:1623–1628, 2009.
[16]	L.-D. Tongand H. T. Wang. Eccentric spectrum of a graph. TAIWANESE JOURNAL OF MATHEMATICS, 12:969– 977, 2008.
[15]	L.-D. Tong, P. L. Yen, and A. Farrugia. The convexity spectra of graphs. DISCRETE APPLIED MATHEMATICS, 156:1838–1845, 2008.
[14]	K. W. Lih, C. Y. Lin, and L.-D. Tong. Non-cover generalized Mycielskian, Kneser, and Schrijver graphs. DISCRETE MATHEMATICS, 308:4653–4659, 2008.
[13]	D. Kral, L.-D. Tong, and X. Zhu. Upper Hamiltonian numbers and Hamiltonian spectra of graphs. AUSTRALASIAN JOURNAL OF COMBINATORICS, 35:329–340, 2006.
[12]	K. W. Lih, C. Y. Lin, and L.-D. Tong. On an interpolation property of outerplanar graphs. DISCRETE APPLIED MATHEMATICS, 154(1):166–172, 2006.
[11]	K. W. Lih, L.-D. Tong, and W. F. Wang. The linear 2-arboricity of outerplanar graphs. ARS COMBINATORIA, 73:13–22, 2004.
[10]	G. J. Chang, L.-D. Tong, and H.-T. Wang. Geodetic spectra of graphs. EUROPEAN JOURNAL OF COMBINATORICS, 25(3):383–391, 2004.
[9]	F.K. Hwang, S. C. Liaw, and L.-D. Tong. Strictly nonblocking 3-stage clos networks with some rearrangeable multicast capability. IEEE TRANSACTIONS ON COMMUNICATIONS, 51(11):1765–1767, 2003.
[8]	K. W. Lih, L.-D. Tong, and W. Wang. The linear 2-arboricity of planar graphs. GRAPHS AND COMBINATORICS, 19:241–248, 2003.
[7]	G. J. Chang, L.-D. Tong, J. H. Yan, and H. G. Yeh. A note on Gallai-Roy-Vitaver theorem. DISCRETE MATHEMATICS, 256:441–444, 2002.
[6]	L.-D. Tong, F. K. Hwang, and G. J. Chang. Channel graphs of bit permutation networks. THEORETICAL COMPUTER SCIENCE, 263:139–143, 2001.
[5]	K. W. Lih, L.-D. Tong, and J. H. Yan. On cycle sequences. GRAPHS AND COMBINATORICS, 17:129–133, 2001.
[4]	S.-C. Liu, L.-D. Tong, and Y.N. Yeh. Trees with the minimum Wiener numbers. INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 78:331–340, 2000.
[3]	G. J. Chang, F. K. Hwang, and L.-D. Tong. The consecutive-4 digraphs are hamiltonian. J. of Graph Theory, 31-1:1–6, 1999.
[2]	G. J. Chang, F. K. Hwang, and L.-D. Tong. Characterizing bit permutation networks. NETWORKS, 33:261– 267, 1999.
[1]	G. J. Chang, F. K. Hwang, and L.-D. Tong. The Hamiltonian properties of consecutive-3 digraphs. Math. Computer Modeling, 25:83–88, 1997.

Organized events

• International Conference on Graph Theory, Combinatorics and Applications (圖論與組合學國際研討會暨第八屆海峽兩岸圖論與組合學研討會), June 17–21, 2019.
• Taiwan-Vietnam Workshop on Mathematics, May 9–11, 2017.
• International Conference on Graph Theory and Combinatorics & Eighth Cross-strait Conference on Graph Theory and Combinatorics, June 26–30, 2015.
• 南區組合數學研討會, May 11, 2013.
• Workshop on Graph Theory and Combinatorics & 2012 Symposium for Young Combiantorialists (圖論及組合研討會暨組合數學新苗研討會), August 10–12, 2012.
• 西子灣組合數學系列研討會, January 20, 2011.
• Seminar on Graph Theory (圖論研討會), March 19–21, 2010.
• XiZhiWan Combinatorics Conference (西子灣組合數學系列研討會), May 1–8, 2009.
• Workshop on Graph Theory, January 10–14, 2009.
• South Taiwan Workshop on Combinatorics (南區組合數學研討會), March 30, 2008.
• Seminar in Coloring (著色研討會), January 26–27, 2008.
• Combinatorics Conference (組合數學(新苗)研討會), August 10–11, 2007.
• Seminar in Coloring-Edge Colorings and Graph Decomposition (著色研討會-邊著色與圖的剖分), August 5–6, 2005.

Related events

• The 2nd Sizihwan Combinatorics Conference (第 2 屆西子灣組合數學研討會), February 10, 2025.
• The 1st Sizihwan Combinatorics Memorial Conference (第 1 屆西子灣組合數學紀念研討會), January 26, 2024.
• 組合數學與圖論紀念研討會, February 17, 2023.

Please contact Jephian Lin <jephianlin [at] gmail [dot] com> if you have any suggestions or find any mistakes on this page.