Hung-Lin Fu

121 papers B 2Misc 2Journal 114Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
The undirected optical indices of trees.
J. Comb. Optim.
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong
2024 J jnl
Total colorings of some classes of four regular circulant graphs.
AKCE Int. J. Graphs Comb.
R. Navaneeth, Jayabalan Geetha, Kanagasabapathi Somasundaram, Hung-Lin Fu
2022 J jnl
Adjacent vertex distinguishing total coloring in split graphs.
Discret. Math.
Shaily Verma, Hung-Lin Fu, B. S. Panda
2022 J jnl
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms.
CoRR
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
2022 J jnl
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms.
IEEE J. Sel. Top. Signal Process.
Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu
2021 J jnl
Hamiltonicity in Prime Sum Graphs.
Graphs Comb.
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
2021 J jnl
Quaternary splitting algorithm in group testing.
J. Comb. Optim.
Jinn Lu, Hung-Lin Fu
2021 J jnl
Strongly separable matrices for nonadaptive combinatorial group testing.
Discret. Appl. Math.
Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno
2021 J jnl
Total colorings of circulant graphs.
Discret. Math. Algorithms Appl.
J. Geetha, K. Somasundaram, Hung-Lin Fu
2020 J jnl
The integer {k}-domination number of circulant graphs.
Discret. Math. Algorithms Appl.
Yen-Jen Cheng, Hung-Lin Fu, Chia-An Liu
2020 J jnl
The undirected optical indices of complete m-ary trees.
Discret. Appl. Math.
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong
2019 — ch.
Rumor Source Detection in Finite Graphs with Boundary Effects by Message-Passing Algorithms.
Influence and Behavior Analysis in Social Networks and Social Media
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
2018 J jnl
Averting Cascading Failures in Networked Infrastructures: Poset-Constrained Graph Algorithms.
IEEE J. Sel. Top. Signal Process.
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
2018 Misc conf
Graph algorithms for preventing cascading failures in networks.
CISS
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
2018 J jnl
Learning a hidden uniform hypergraph.
Optim. Lett.
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih
2018 J jnl
On the number of rainbow spanning trees in edge-colored complete graphs.
Discret. Math.
Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry, C. A. Rodger
2017 J jnl
Codes with the identifiable parent property for multimedia fingerprinting.
Des. Codes Cryptogr.
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao
2017 J jnl
New bounds on the decycling number of generalized de Bruijn digraphs.
Discret. Math. Algorithms Appl.
Jyhmin Kuo, Hung-Lin Fu
2017 J jnl
Rainbow Cycle Designs.
Bull. ICA
Hung-Lin Fu
2017 B conf
Rumor Source Detection in Finite Graphs with Boundary Effects by Message-passing Algorithms.
ASONAM
Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu
2017 B conf
Rumor source detection in unicyclic graphs.
ITW
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
2017 J jnl
The Global Packing Number of a Fat-Tree Network.
IEEE Trans. Inf. Theory
Yuan-Hsun Lo, Yijin Zhang, Yi Chen, Hung-Lin Fu, Wing Shing Wong
2017 J jnl
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs.
Discret. Appl. Math.
Hui-Chuan Lu, Hung-Lin Fu
2016 Misc conf
Optimal detection of influential spreaders in online social networks.
CISS
Chee Wei Tan, Pei-Duo Yu, Chun-Kiu Lai, Wenyi Zhang, Hung-Lin Fu
2016 J jnl
Partially user-irrepressible sequence sets and conflict-avoiding codes.
Des. Codes Cryptogr.
Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu
2016 J jnl
The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors.
Graphs Comb.
Hongchuan Lei, Hung-Lin Fu
2015 J jnl
Multicolored Isomorphic Spanning Trees in Complete Graphs.
Ars Comb.
Hung-Lin Fu, Yuan-Hsun Lo
2015 J jnl
New bounds on 2-separable codes of length 2.
Des. Codes Cryptogr.
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao
2015 J jnl
On the decycling number of generalized Kautz digraphs.
Inf. Process. Lett.
Min-Yun Lien, Jyhmin Kuo, Hung-Lin Fu
2015 J jnl
The Absorbant Number of Generalized de Bruijn Digraphs.
Ars Comb.
Jyhmin Kuo, Hung-Lin Fu
2015 J jnl
The Global Packing Number for an Optical Network.
CoRR
Yuan-Hsun Lo, Yijin Zhang, Wing Shing Wong, Hung-Lin Fu
2015 J jnl
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes.
Des. Codes Cryptogr.
Yuan-Hsun Lo, Hung-Lin Fu, Yi-Hean Lin
2014 J jnl
Codes with the Identifiable Parent Property for Multimedia Fingerprinting.
CoRR
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao
2014 J jnl
Learning a hidden graph.
Optim. Lett.
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih
2014 J jnl
Optimal conflict-avoiding codes of odd length and weight three.
Des. Codes Cryptogr.
Hung-Lin Fu, Yuan-Hsun Lo, Kenneth W. Shum
2014 J jnl
Partially user-irrepressible sequence sets and conflict-avoiding codes.
CoRR
Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu
2014 J jnl
The decycling number of.
Discret. Math. Algorithms Appl.
Min-Yun Lien, Hung-Lin Fu, Chie-Huai Shih
2014 J jnl
The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures.
Des. Codes Cryptogr.
Hui-Chuan Lu, Hung-Lin Fu
2013 J jnl
A note on optimal pebbling of hypercubes.
J. Comb. Optim.
Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue
2013 — conf
Group Testing with Multiple Mutually-Obscuring Positives.
Information Theory, Combinatorics, and Search Theory
Hong-Bin Chen, Hung-Lin Fu
2013 J jnl
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures.
Inf. Sci.
Hui-Chuan Lu, Hung-Lin Fu
2013 J jnl
The decycling number of outerplanar graphs.
J. Comb. Optim.
Huilan Chang, Hung-Lin Fu, Min-Yun Lien
2013 J jnl
Threshold Group Testing on Inhibitor Model.
J. Comput. Biol.
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih
2012 J jnl
On the Diameter of the Generalized Undirected De Bruijn Graphs.
Ars Comb.
Jyhmin Kuo, Hung-Lin Fu
2011 J jnl
Embeddings of Maximum Packings of Triples.
Ars Comb.
Renwang Su, Hung-Lin Fu
2011 J jnl
Errata to "Optimal Conflict-Avoiding Codes of Even Length and Weight 3".
IEEE Trans. Inf. Theory
Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima
2011 J jnl
Reconstruction of hidden graphs and threshold group testing.
J. Comb. Optim.
Huilan Chang, Hong-Bin Chen, Hung-Lin Fu, Chie-Huai Shi
2010 J jnl
Covering graphs with matchings of fixed size.
Discret. Math.
David Cariolaro, Hung-Lin Fu
2010 J jnl
Identification and Classification Problems on Pooling Designs for Inhibitor Models.
J. Comput. Biol.
Huilan Chang, Hong-Bin Chen, Hung-Lin Fu
2010 J jnl
Optimal Conflict-Avoiding Codes of Even Length and Weight 3.
IEEE Trans. Inf. Theory
Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima
2009 J jnl
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves.
Discret. Math.
Liqun Pu, Hung-Lin Fu, Hao Shen
2009 J jnl
Excessive near 1-factorizations.
Discret. Math.
David Cariolaro, Hung-Lin Fu
2009 J jnl
Maximum Packing of Dt - P and Dt U P with Mendelsohn Triples.
Ars Comb.
Liqun Pu, Hung-Lin Fu, Hao Shen
2009 J jnl
Multicolored parallelisms of Hamiltonian cycles.
Discret. Math.
Hung-Lin Fu, Yuan-Hsun Lo
2009 J jnl
Nonadaptive algorithms for threshold group testing.
Discret. Appl. Math.
Hong-Bin Chen, Hung-Lin Fu
2009 J jnl
Optimal conflict-avoiding codes of length
Des. Codes Cryptogr.
Miwako Mishima, Hung-Lin Fu, Shoichi Uruno
2009 J jnl
Some Results on 4-cycle Packings.
Ars Comb.
Hung-Lin Fu
2009 J jnl
The Excessive [3]-Index of All Graphs.
Electron. J. Comb.
David Cariolaro, Hung-Lin Fu
2009 J jnl
The Existence of r
SIAM J. Discret. Math.
Rucong Zhang, Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, Yukiyasu Mutoh
2009 J jnl
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks.
Discret. Appl. Math.
F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin
2008 J jnl
A new construction of
Discret. Optim.
Hung-Lin Fu, Frank K. Hwang
2008 J jnl
All graphs with maximum degree three whose complements have 4-cycle decompositions.
Discret. Math.
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith
2008 J jnl
An upper bound of the number of tests in pooling designs for the error-tolerant complex model.
Optim. Lett.
Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang
2008 J jnl
Maximal sets of Hamilton cycles in D
Discret. Math.
Liqun Pu, Hung-Lin Fu, Hao Shen
2008 J jnl
Maximal sets of hamilton cycles in K
Discret. Math.
Hung-Lin Fu, S. L. Logan, Christopher A. Rodger
2008 J jnl
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.
SIAM J. Discret. Math.
Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu
2008 J jnl
Near automorphisms of cycles.
Discret. Math.
Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu
2008 J jnl
On minimum sets of 1-factors covering a complete multipartite graph.
J. Graph Theory
David Cariolaro, Hung-Lin Fu
2008 J jnl
On the diameter of the generalized undirected de Bruijn graphs
Networks
Jyhmin Kuo, Hung-Lin Fu
2008 J jnl
The IC-Indices of Complete Bipartite Graphs.
Electron. J. Comb.
Chin-Lin Shiue, Hung-Lin Fu
2008 J jnl
The linear 3-arboricity of K
Discret. Math.
Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen
2007 J jnl
Editorial note.
J. Comb. Optim.
Gerard J. Chang, Hung-Lin Fu, Xuding Zhu
2007 J jnl
Maximum cyclic 4-cycle packings of the complete multipartite graph.
J. Comb. Optim.
Shung-Liang Wu, Hung-Lin Fu
2007 J jnl
Near automorphisms of trees with small total relative displacements.
J. Comb. Optim.
Chia-Fen Chang, Hung-Lin Fu
2007 J jnl
Packing 5-cycles into balanced complete
J. Comb. Optim.
Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu
2007 J jnl
Wide diameters of de Bruijn graphs.
J. Comb. Optim.
Jyhmin Kuo, Hung-Lin Fu
2006 J jnl
-Decompositions of and
Graphs Comb.
Liqun Pu, Hung-Lin Fu, Hao Shen
2006 J jnl
A Note on Cyclic
Graphs Comb.
Shung-Liang Wu, Hung-Lin Fu
2006 J jnl
A novel use of t-packings to construct d-disjunct matrices.
Discret. Appl. Math.
Hung-Lin Fu, Frank K. Hwang
2006 J jnl
Multicolored Parallelisms of Isomorphic Spanning Trees.
SIAM J. Discret. Math.
Saieed Akbari, Alireza Alipour, Hung-Lin Fu, Yuan-Hsun Lo
2006 J jnl
alpha-labeling number of trees.
Discret. Math.
Chin-Lin Shiue, Hung-Lin Fu
2005 J jnl
All 2-Regular Leaves of Partial 6-cycle Systems.
Ars Comb.
David James Ashe, Christopher A. Rodger, Hung-Lin Fu
2005 J jnl
Balanced bipartite 4-cycle designs.
Australas. J Comb.
Hung-Lin Fu
2005 J jnl
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls.
J. Comb. Optim.
Hung-Lin Fu, Frank K. Hwang
2005 J jnl
Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles.
Graphs Comb.
Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger
2004 J jnl
A solution to the forest leave problem for partial 6-cycle systems.
Discret. Math.
David James Ashe, Hung-Lin Fu, Christopher A. Rodger
2004 J jnl
Cyclically decomposing the complete graph into cycles.
Discret. Math.
Hung-Lin Fu, Shung-Liang Wu
2004 J jnl
Decomposing
Discret. Math.
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger
2004 — conf
Edge Number of 3-Connected Diameter 3 Graphs.
ISPAN
Ming-Chun Tsai, Hung-Lin Fu
2004 J jnl
Embeddings of maximum packings in triple systems.
Discret. Math.
Renwang Su, Hung-Lin Fu, Hao Shen
2004 J jnl
Packing Balanced Complete Multipartite Graph with Hexagons.
Ars Comb.
Hung-Lin Fu, Ming-Hway Huang
2004 J jnl
The Edge-Coloring of Graphs with Small Genus.
Ars Comb.
Hui-Lan Fan, Hung-Lin Fu
2003 J jnl
The Existence of 2x4 Grid-Block Designs and Their Applications.
SIAM J. Discret. Math.
Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu
2002 J jnl
A Study of Typenumber in Book-Embedding.
Ars Comb.
Yen-Chi Chen, Hung-Lin Fu, I-Fan Sun
2002 J jnl
Ascending subgraph decompositions of regular graphs.
Discret. Math.
Hung-Lin Fu, Wei-Hsin Hu
2002 J jnl
The Maximum Genus of a Graph with Given Diameter and Connectivity.
Electron. Notes Discret. Math.
Hung-Lin Fu, Ming-Chun Tsai
2002 J jnl
The Maximum Genus of a Graph with Given Diameter and Connectivity.
Electron. Notes Discret. Math.
Hung-Lin Fu, Ming-Chun Tsai
2002 J jnl
The typenumber of trees.
Discret. Math.
Hung-Lin Fu, I-Fan Sun
2001 J jnl
A note on ascending subgraph decompositions of complete multipartite graphs.
Discret. Math.
Hung-Lin Fu, Wei-Hsin Hu
2001 J jnl
The decay number and the maximum genus of diameter 2 graphs.
Discret. Math.
Hung-Lin Fu, Ming-Chun Tsai, N. H. Xuong
2000 J jnl
A Study of the Genus of a Group.
Ars Comb.
Hung-Lin Fu, I-Fan Sun
2000 J jnl
Forest leaves and four-cycles.
J. Graph Theory
Hung-Lin Fu, Christopher A. Rodger
2000 J jnl
Linear k-arboricities on trees.
Discret. Appl. Math.
Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang
2000 J jnl
On the alpha-labeling number of bipartite graphs.
Discret. Math.
Saad I. El-Zanati, Hung-Lin Fu, Chin-Lin Shiue
2000 J jnl
The optimal pebbling number of the complete
Discret. Math.
Hung-Lin Fu, Chin-Lin Shiue
1999 J jnl
Almost Resolvable Directed m-cycle systems: m = 3 (mod 6).
Ars Comb.
Hung-Lin Fu, Christopher A. Rodger
1999 J jnl
The existence of group divisible designs with first and second associates, having block size 3.
Ars Comb.
Hung-Lin Fu, Christopher A. Rodger, Dinesh G. Sarvate
1998 J jnl
A study of the total chromatic number of equibipartite graphs.
Discret. Math.
Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang
1998 J jnl
Group Divisible Designs with Two Associate Classes: n=2 orm=2.
J. Comb. Theory A
Hung-Lin Fu, Christopher A. Rodger
1997 J jnl
Connectivity of cages.
J. Graph Theory
Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger
1997 J jnl
On upper bounds for the pseudo-achromatic index.
Discret. Math.
Nam-Po Chiang, Hung-Lin Fu
1996 J jnl
The maximum genus of diameter three graphs.
Australas. J Comb.
Hung-Lin Fu, Ming-Chun Tsai
1995 J jnl
The achromatic indices of the regular complete multipartite graphs.
Discret. Math.
Nam-Po Chiang, Hung-Lin Fu
1994 J jnl
Disjoint odd integer subsets having a constant odd sum.
Discret. Math.
Hung-Lin Fu, Wei-Hsin Hu
1994 J jnl
Edge domination in complete partite graphs.
Discret. Math.
Bor-Liang Chen, Hung-Lin Fu
1994 J jnl
On prime labellings.
Discret. Math.
Hung-Lin Fu, Kuo-Ching Huang
1992 J jnl
On the achromatic number of the Cartesian product G
Australas. J Comb.
Nam-Po Chiang, Hung-Lin Fu
1992 J jnl
Total colorings of graphs of order 2
Graphs Comb.
Bor-Liang Chen, Hung-Lin Fu
1991 J jnl
Decomposing graphs into forests of paths with size less than three.
Australas. J Comb.
Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang
1990 J jnl
A note on the ascending subgraph decomposition problem.
Discret. Math.
Hung-Lin Fu
1987 J jnl
Intersection problem of Steiner systems S(3, 4, 2nu).
Discret. Math.
Hung-Lin Fu