Journal Paper :
J. J. Liu(劉嘉傑), G. S. Huang(黃光璿), Y. L. Wang*(王有禮), and R.C.T. Lee(李家同), Edit Distance for a Run-Length-Encoded String and an Uncompressed String, Information Processing Letters, vol. 105 (2007) pp 12-16. (SCIE) (NSC 95-2221-E-260-025)
J. J. Liu(劉嘉傑), Y. L. Wang*(王有禮), and R.C.T. Lee(李家同), Finding a Longest Common Subsequence between a Run-Length-Encoded String and an Uncompressed String, Journal of Complexity, vol. 24 (2008) pp 173-184. (SCI) (NSC 95-2221-E-260-025)
G. S. Huang(黃光璿), J. J. Liu(劉嘉傑), and Y. L. Wang*(王有禮), Sequence Alignment Algorithms for Run-Length-Encoded Strings, Lecture Notes in Computer Science, vol. 5092, 2008, pp 319-330. (EI) (NSC 96-2221-E-260-018)
√ J. J. Liu(劉嘉傑), G. S. Huang(黃光璿), and Y. L. Wang*(王有禮), A Fast Algorithm for Finding the Positions of All Squares in a Run-Length Encoded String, Theoretical Computer Science, vol. 410, 2009, pp 3942-3948. (SCI) (NSC 96-2221-E-260-018)
√ M. T. Juan(阮明燦), J. J. Liu*(劉嘉傑), and Y. L. Wang(王有禮), Errata for "Faster Index for Property Matching", Information Processing Letters, vol. 109, 2009, pp 1027-1029. (SCIE) (NSC 97-2218-E-128-001 and NSC 97-2221-E-011-158-MY3)
√ Y. J. Chen(陳嬿如), J. J. Liu(劉嘉傑), and Y. L. Wang*(王有禮), An Optimal Rotation Distance Set, The Computer Journal, vol. 54(5), 2011, pp 824-830. (SCI) (NSC 98-2221-E-128-003- and NSC 97-2221-E-011-158-MY3)
√ C. H. Lin(林建宏), J. J. Liu(劉嘉傑), Y. L. Wang*(王有禮), and William C. K. Yen(顏重功), The Hub Number of Sierpinski-like Graphs, Theory of Computing Systems, vol. 49(3), 2011, pp 588-600. (SCI) (NSC 98-2221-E-128-003- and NSC 97-2221-E-011-158-MY3)
√ J. J. Liu*(劉嘉傑), Distinct Squares in Run-Length Encoded Strings, Theoretical Computer Science, vol.411, 2010, pp 4235-4241. (SCI) (NSC 97-2218-E-128-001)
√ J. J. Liu*(劉嘉傑), William C. K. Yen(顏重功), and Y. J. Chen(陳嬿如), An Optimal Algorithm for Untangling Binary Trees via Rotations, The Computer Journal, vol. 54(11), 2011, pp 1838-1844. (SCI) (NSC 98-2221-E-128-003-)
√ Y. L. Wang*(王有禮), C. J. Hsu(許呈如), J. J. Liu(劉嘉傑), M. T. Ko(高明達), and F. H. Wang(王福星), A New Subclass of Integer Linear Programming Problems and Its Applications, IEEE Transactions on Computers, vol. 61(12), 2012, pp 1813-1822. (SCI) (NSC 97-2218-E-128-001 and NSC 97-2221-E-011-158-MY3)
S. C. Chang(張舜傑), W.C.K. Yen(顏重功), Y.L. Wang*(王有禮), and J.J. Liu(劉嘉傑), The NP-completeness of the Connected p-Median Problem on Bipartite Graphs and Split Graphs, Chiang Mai Journal of Science, vol. 40(1), 2013, pp 83-88. (SCI)
√ C. H. Lin(林建宏), J. J. Liu(劉嘉傑), Y. L. Wang*(王有禮), Global Strong Defensive Alliances of Sierpinski-like Graphs, Theory of Computing Systems, vol. 53(3), 2013, pp 365-385. (SCI)
√ J. J. Liu*(劉嘉傑) and Y. L. Wang(王有禮), Hamiltonian Cycles in Hypercubes with Faulty Edges, Information Sciences, vol. 256, 2014, pp 225-233. (SCI)
√ W. Y. Huang(黃雯音), J. J. Liu(劉嘉傑), Jou-Ming Chang*(張肇明), and Ro-Yu Wu(吳若禹), Longest Fault-free Cycles in Folded Hypercubes with Conditional Faulty Elements, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E97-A, No. 6, 2014, pp. 1187-1191. (SCIE)
√ J. E. Go(郭至恩), Y. L. Wang*(王有禮), J. J. Liu(劉嘉傑), and M. T. Ko(高明達), Resequencing a Set of Strings Based on a Target String, Algorithmica, vol. 72(2), 2015, pp 430-449. (SCI) (NSC 97-2218-E-128-001 and NSC 97-2221-E-011-158-MY3)
√ J. J. Liu*(劉嘉傑), Y. L. Wang(王有禮), and Yu-Shan Chiu(邱羽姍), Constrained Longest Common Subsequences with Run-Length-Encoded Strings, The Computer Journal, vol. 58(5), 2015, pp. 1074-1084. (SCI)
√ J. J. Liu*(劉嘉傑), T. H. Wang(王子欣), Y.L. Wang(王有禮), and W.C.K. Yen(顏重功), The Hub Number of Co-comparbility Graphs, Theoretical Computer Science, vol. 570, 2015, pp 15-21. (SCI)
√ C.J. Lin(林秋君), J.J. Liu(劉嘉傑), and Y.L. Wang*(王有禮), Finding Outer-connected Dominating Sets in Interval Graphs, Information Processing Letters, vol. 115(12), 2015, pp. 917-922. (SCI)
√ S. C. Chang(張舜傑), J.J. Liu(劉嘉傑), and Y.L. Wang*(王有禮), The Outer-connected Domination Number of Sierpinski-like Graphs, Theory of Computing Systems, 58(2), 2016, pp 345–356. (SCI)
S. C. Chang(張舜傑), W.C.K. Yen(顏重功), Y.L. Wang*(王有禮), and J.J. Liu(劉嘉傑), The Connected p-Median Problem on Block Graphs, Optimization Letters, 10(6), 2016, pp 1191–1201. (SCI)
√ J. J. Liu*(劉嘉傑), C. J. Hsu(許呈如), and C. H. Lin(林建宏), Computing global secure set on trees, The Computer Journal, 59(5), 2016, pp 616-629. (SCI) (MOST 103-2221-E-128-002-)
√ J. J. Liu*(劉嘉傑), S. C. Chang(張舜傑), and C.J. Lin(林秋君), The 2-rainbow domination of Sierpinski graphs and extended Sierpinski graphs, Theory of Computing Systems, 61(3), 2017, 893-906. (SCI) (MOST 105-2221-E-128-004-)
√ K. H. Wu(吳國華), J. J. Liu(劉嘉傑), Y.L. Wang*(王有禮) and C.C. Hsu(徐俊傑), The 2-Rainbow Bondage Number in Generalized Petersen Graphs, COGENT MATHEMATICS, 2017, 4: 1326203. (ESCI)
√Y. H. Zou(鄒雲豪), J. J. Liu*(劉嘉傑), C.C. Hsu(徐俊傑) and Y.L. Wang(王有禮), A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics, 260, 2019, pp 289-293. (SCI)
√Y. H. Zou(鄒雲豪), J. J. Liu*(劉嘉傑), S. C. Chang(張舜傑) and C.C. Hsu(徐俊傑), The co-secure domination in proper interval graphs, Discrete Applied Mathematics, 311, 2022, pp 68-71. (SCI)
√C.Y. Lin(林志遠), J.J. Liu(劉嘉傑), Y.L. Wang*(王有禮), William C.K. Yen(顏重功), and C.C. Hsu(徐俊傑), The Outer-paired Domination of Graphs, International Journal of Foundations of Computer Science, 33(2), 2022, pp 141-148. (SCI)
√J.J. Liu*(劉嘉傑), The Orbits of Folded Crossed Cubes, The Computer Journal, 67(5), 2024, pp 1719-1726. (SCI)
√J.J. Liu*(劉嘉傑), The Orbits of Twisted Crossed Cubes, Mathematics 2024, Volume 12, Issue 24, 3928. (SCI)
J.J. Liu*(劉嘉傑), The Orbits of Twisted Cubes, Discrete Applied Mathematics 379C 2026, pp. 170-176 . (SCI)
Conference Papers:
S. C. Chang(張舜傑), J. J. Liu(劉嘉傑), and Y.L. Wang(王有禮), The Weighted Independent Domination Problem in Series-Parallel Graphs, International Computer Symposium (ICS) 2014.
Y.L. Wang(王有禮), M. H. Ko(柯孟豪), and J. J. Liu(劉嘉傑), Rainbow Domination in Generalized De Brujin Digraphs, The 31th Workshop on Combinatorial Mathematics and Computation Theory.
G. Y. Lin(林冠宇), J. J. Liu(劉嘉傑), and Y.L. Wang(王有禮), Finding a Longest Increasing Subsequence from the Paths in a Complete Bipartite Graph, The 29th Workshop on Combinatorial Mathematics and Computation Theory, pp 224-227.
William C. K. Yen(顏重功), J. J. Liu(劉嘉傑), and C. C. Shih(施朝正), The Weighted Minimum Tuple 2-Rainbow Domination on Graphs, International Conference on Computer Science and Applications (ICCSA 2012).
William C. K. Yen(顏重功), Samuel S. M. Chen(陳森淼), J. J. Liu(劉嘉傑), and S. C. Chang(張舜傑), Practical Variations of the p-Center Problem on Graphs, The 2011 International Computer Science and Engineering Conference (ICSEC 2011), Poster session.
J. J. Liu(劉嘉傑), Y. L. Wang(王有禮), C. J. Hsu(許呈如), and S. F. Yu(游順發), The Composition Problem, The 26th Workshop on Combinatorial Mathematics and Computation Theory, pp 27-35 Best Paper Award.
G. S. Huang(黃光璿), J. J. Liu(劉嘉傑), and Y. L. Wang(王有禮), Sequence Alignment Algorithms for Run-Length-Encoded Strings, the 14th Annual International Computing and Combinatorics Conference (COCOON08)
M. T. Juan(阮明燦), J. J. Liu(劉嘉傑), and Y. L. Wang(王有禮), An Improvement Faster Index for Property Matching Algorithm, The 26th Workshop on Combinatorial Mathematics and Computation Theory, pp 130-133.
Book :
J. J. Liu(劉嘉傑), G. S. Huang(黃光璿), and Y. L. Wang(王有禮), Solving Some Sequence Problems on Run-Length Encoded Strings, VDM Verlag Dr. Muller Aktiengesellschaft & Co. KG (16 May 2008)
研究計劃 :
國科會97學年度研究計劃: NSC 97-2218-E-128-001-「在行程長度編碼字串中重複序列問題之研究」
國科會98學年度研究計劃: NSC 98-2221-E-128-003-「在行程長度編碼字串中有限制的最長共同子序列問題之研究」
國科會100學年度研究計劃: NSC 100-2221-E-128-003-「二元樹之間的旋轉距離」
國科會102學年度研究計劃: NSC 102-2221-E-128-002-「用固定參數演算法在總覆蓋問題上之研究」
科技部103學年度研究計劃: MOST 103-2221-E-128-002-「外連通支配問題之研究」
科技部105學年度研究計劃: MOST 105-2221-E-128-004 -「在連結網路上軌道數問題之研究」
科技部106學年度研究計劃: MOST 106-2221-E-128-003 -「在行程長度編碼上限制子字串長度為k的最大共同子序列問題之研究」
世新大學106學年度重點學門計畫: 「雲端環境下的資訊應用發展架構」
科技部107學年度研究計劃: MOST 107-2221-E-128-001 -「調度派遣問題之研究」
科技部111學年度研究計劃: MOST 111-2221-E-128-002 -「特殊圖形上的安全支配集之研究與衍生變化應用」協同研究員
國科會112學年度研究計劃: NSTC 112-2221-E-128-001- 「基於安全支配集網路的可解釋性AI特洛伊木馬檢驗框架」共同主持人