Publications (dblp)

(A) Journal papers

• 1. Yu-Lun Wu, Hung-Lung Wang: Correcting matrix products over the ring of integers. Information Processing Letters 186 (2024), 106496. [SCI]

  2. Yun-Shan Lu, Hung-Lung Wang: A note on the Tuza constant $c_k$ for small $k$. Discrete Mathematics 347 (2024), 113756.  [SCI]

  3. Min-Shu Jao, Hung-Lung Wang, Jou-Ming Chang, Chia-Wen Wu: Determining the 2-tuple total domination number of a Harary graph under specific degree conditions. Journal of Information Science and Engineering, accepted.  [SCI]

  4. Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang: Complexity of paired domination in AT-free and planar graphs. Theoretical Computer Science 930 (2022), 53–62.  [SCI]

  5. Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, Yue-Li Wang: A note on the geodetic number and the Steiner number of AT-free graphs. Theoretical Computer Science 854 (2021), 131–135. [SCI]

  6. Jou-Ming Chang, Ton Kloks, Hung-Lung Wang: Gray codes for AT-free orders. Ars Combinatroia 155 (2021), 273–284. [SCI]

  7. Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kun-Jui Pai, Jinn-Shyong Yang: Completely independent spanning trees on 4-regular chordal rings. IEICE Transactions 100-A(9) (2017), 1932–1935. [SCI]

  8. Hung-Lung Wang: An optimal algorithm for the weighted backup 2-center problem on a tree. Algorithmica 77 (2017), 426–439. [SCI]

  9. Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, Jou-Ming Chang: A note on the degree condition of completely independent spanning trees. IEICE Transactions 98-A(10) (2015), 2191–2193. [SCI]

  10. Bang Ye Wu, Hung-Lung Wang: The next-to-shortest path problem on directed graphs with positive edge weights. Networks 65 (2015), 205–211. [SCI, EI]

  11. Hung-Lung Wang, Chun-Yu Tseng, Jou-Ming Chang: On the structure of locally outerplanar graphs. IEICE Transactions 98-A(6) (2015), 1212-1215. [SCI]

  12. Hung-Lung Wang: Maintaining centdians in a fully dynamic forest with top trees. Discrete Applied Mathematics 181 (2015), 310–315. [SCI, EI]

  13. Hung-Lung Wang, Kuan-Yu Chen: One dimensional approximate point set pattern matching with Lp-norm. Theoretical Computer Science 521 (2014), 42–50. [SCI]

  14. Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf: Finding all sorting tandem duplication random loss operations. Journal of Discrete Algorithms 9 (2011), 32–48. [EI]

  15. An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao: A tight bound on the min-ratio edge-partitioning problem of a tree. Discrete Applied Mathematics 158 (2010), 1471–1478. [SCI, EI]

  16. Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao: The backup 2-center and backup 2-median problems on trees. Networks 53 (2009), 39–49. [SCI, EI]

  17. Hung-Lung Wang, Kun-Mao Chao: The 2-radius and 2-radiian problems on trees. Theoretical Computer Science 407 (2008), 524–531. [SCI]

  18. Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao: On the uniform edge-partition of a tree. Discrete Applied Mathematics 155 (2007), 1213–1223. [SCI, EI]

(B) Conference papers

• 1. Pin-Hsian Lee, Meng-Tsung Tsai, Hung-Lung Wang: On the complexity of finding 1-center spanning trees. WADS 2025, 43:1–43:19

  2. Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang: Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs. WADS 2023, 507–520.

  3. Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang: Complexity of Paired Domination in AT-free and Planar Graphs. CALDAM 2022, 65–77.

  4. Tim A. Hartmann, Jan Dreier, Janosch Fuchs, Philipp Kuinke, Peter Rossmanith, Hung-Lung Wang, Bjoern Tauer: The Complexity of Packing Edge-Disjoint Paths. IPEC 2019.

  5. Si-Han Yang, Hung-Lung Wang: A note on the 2-tuple total domination problem in Harary graphs. ICS 2016. 

  6. Alber Jhih-Heng Huang, Hung-Lung Wang, Kun-Mao Chao: Computing the line-constrained k-center in the plane for small k. AAIM 2016, 197–208.

  7. Shao-Li Lu, Hung-Lung Wang, Jou-Ming Chang: Maximal singly connected digraphs, CMCT 2016, 30–33.

  8. Jou-Ming Chang, Ton Kloks, Hung-Lung Wang: Gray codes for AT-free orders via antimatroids, IWOCA 2015, 77–87.

  9. Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang: Rainbow domination and related problems on some classes of perfect graphs, TTCS 2015.

  10. Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao: Forming plurality at minimum cost, WALCOM 2015, 77–88.

  11. Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao: The generalized popular condensation problem, ISAAC 2014, 606–617.

  12. Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao: Computing plurality points and Condorcet points in Euclidean space, ISAAC 2013, 688–698.

  13. Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao: An optimal algorithm for the popular condensation problem, IWOCA 2013, 412–422.

  14. Jun-Jie Liu, Hung-Lung Wang, Jou-Ming Chang: Some results of antibandwidth on generalized prism graphs. Proc. 30th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, 2013, 1–5.

  15. Bang Ye Wu, Hung-Lung Wang: The next-to-shortest path problem on directed graphs with positive edge weights. Proc. 30th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, 2013, 6–12.

  16. Muly Yang, Hung-Lung Wang: The route-capturing game.  Proc. 30th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, 2013, 69–74.

  17. Hung-Lung Wang, Wei-Ho Chung: The generalized k-coverage under probabilistic sensing model in sensor networks. IEEE Wireless Communications and Networking Conference 2012 (WCNC'12), pp. 1737–1742.

  18. Chun-Yu Tseng, Hung-Lung Wang: A note on the structure of locally outerplanar graphs. Proc. 29th Workshop on Combinatorial Mathematics and Computation Theory (CMCT'12), Apr. 27-28, Taipei, Taiwan (2012), pp. 182–185.

  19. Yu-Wei Chang, Hung-Lung Wang: The 2-center problem in chordal graphs. Proc. 29th Workshop on Combinatorial Mathematics and Computation Theory (CMCT'12), Apr. 27-28, Taipei, Taiwan (2012), pp. 196–201.

  20. Hung-Lung Wang, Kuan-Yu Chen: Approximate point set pattern matching with Lp-norm. Proc. 18th International Symposium on String Processing and Information Retrieval (SPIRE'11), Oct. 17–21, Pisa, Italy (2011).

  21. Ro-Yu Wu, Hung-Lung Wang: A simple proof for the hamiltonian property on rotation graphs of binary trees. Proc. 27th Workshop on Combinatorial Mathematics and Computation Theory (CMCT'10), Apr. 30–May 1, Taichung, Taiwan (2010), pp. 249–253.

  22. Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf: Finding all sorting tandem duplication random loss operations. Proc. 20th Annual Symposium on Combinatorial Pattern Matching (CPM'09), Jun. 22-24, Lille, France (2009), pp 301–313.

  23. Hung-Lung Wang: Maintaining centdians in a fully dynamic forest. Proc. 25th Workshop on Combinatorial Mathematics and Computation Theory, 2008, Taiwan.

  24. Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao: On the uniform edge-partition of a tree. Proc. 21st Workshop on Combinatorial Mathematics and Computation Theory, 132–140, 2004, Taiwan.