Hung-Lin Fu

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 24

Top Venues

Des. Codes Cryptogr.

CoRR

Discret. Math. Algorithms Appl.

Discret. Appl. Math.

Publications

R. Navaneeth, Jayabalan Geetha, Kanagasabapathi Somasundaram, Hung-Lin Fu
Total colorings of some classes of four regular circulant graphs. AKCE Int. J. Graphs Comb. 21 (1) (2024)
Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms. IEEE J. Sel. Top. Signal Process. 16 (2) (2022)
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms. CoRR (2022)
Shaily Verma, Hung-Lin Fu, B. S. Panda
Adjacent vertex distinguishing total coloring in split graphs. Discret. Math. 345 (11) (2022)
J. Geetha, K. Somasundaram, Hung-Lin Fu
Total colorings of circulant graphs. Discret. Math. Algorithms Appl. 13 (5) (2021)
Jinn Lu, Hung-Lin Fu
Quaternary splitting algorithm in group testing. J. Comb. Optim. 41 (1) (2021)
Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno
Strongly separable matrices for nonadaptive combinatorial group testing. Discret. Appl. Math. 291 (2021)
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
Hamiltonicity in Prime Sum Graphs. Graphs Comb. 37 (1) (2021)
Yen-Jen Cheng, Hung-Lin Fu, Chia-An Liu
The integer {k}-domination number of circulant graphs. Discret. Math. Algorithms Appl. 12 (4) (2020)
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong
The undirected optical indices of complete m-ary trees. Discret. Appl. Math. 285 (2020)
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih
Learning a hidden uniform hypergraph. Optim. Lett. 12 (1) (2018)
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
Graph algorithms for preventing cascading failures in networks. CISS (2018)
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
Averting Cascading Failures in Networked Infrastructures: Poset-Constrained Graph Algorithms. IEEE J. Sel. Top. Signal Process. 12 (4) (2018)
Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry, C. A. Rodger
On the number of rainbow spanning trees in edge-colored complete graphs. Discret. Math. 341 (8) (2018)
Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu
Rumor source detection in unicyclic graphs. ITW (2017)
Jyhmin Kuo, Hung-Lin Fu
New bounds on the decycling number of generalized de Bruijn digraphs. Discret. Math. Algorithms Appl. 9 (5) (2017)
Hung-Lin Fu
Rainbow Cycle Designs. Bull. ICA 81 (2017)
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao
Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 83 (1) (2017)
Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu
Rumor Source Detection in Finite Graphs with Boundary Effects by Message-passing Algorithms. ASONAM (2017)
Hui-Chuan Lu, Hung-Lin Fu
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs. Discret. Appl. Math. 233 (2017)
Yuan-Hsun Lo, Yijin Zhang, Yi Chen, Hung-Lin Fu, Wing Shing Wong
The Global Packing Number of a Fat-Tree Network. IEEE Trans. Inf. Theory 63 (8) (2017)
Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu
Partially user-irrepressible sequence sets and conflict-avoiding codes. Des. Codes Cryptogr. 78 (3) (2016)
Chee Wei Tan, Pei-Duo Yu, Chun-Kiu Lai, Wenyi Zhang, Hung-Lin Fu
Optimal detection of influential spreaders in online social networks. CISS (2016)
Hongchuan Lei, Hung-Lin Fu
The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors. Graphs Comb. 32 (1) (2016)
Min-Yun Lien, Jyhmin Kuo, Hung-Lin Fu
On the decycling number of generalized Kautz digraphs. Inf. Process. Lett. 115 (2) (2015)
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao
New bounds on 2-separable codes of length 2. Des. Codes Cryptogr. 74 (1) (2015)
Jyhmin Kuo, Hung-Lin Fu
The Absorbant Number of Generalized de Bruijn Digraphs. Ars Comb. 118 (2015)
Hung-Lin Fu, Yuan-Hsun Lo
Multicolored Isomorphic Spanning Trees in Complete Graphs. Ars Comb. 122 (2015)
Yuan-Hsun Lo, Yijin Zhang, Wing Shing Wong, Hung-Lin Fu
The Global Packing Number for an Optical Network. CoRR (2015)
Yuan-Hsun Lo, Hung-Lin Fu, Yi-Hean Lin
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes. Des. Codes Cryptogr. 76 (2) (2015)
Hung-Lin Fu, Yuan-Hsun Lo, Kenneth W. Shum
Optimal conflict-avoiding codes of odd length and weight three. Des. Codes Cryptogr. 72 (2) (2014)
Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu
Partially user-irrepressible sequence sets and conflict-avoiding codes. CoRR (2014)
Min-Yun Lien, Hung-Lin Fu, Chie-Huai Shih
The decycling number of. Discret. Math. Algorithms Appl. 6 (3) (2014)
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao
Codes with the Identifiable Parent Property for Multimedia Fingerprinting. CoRR (2014)
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih
Learning a hidden graph. Optim. Lett. 8 (8) (2014)
Hui-Chuan Lu, Hung-Lin Fu
The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures. Des. Codes Cryptogr. 73 (1) (2014)
Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue
A note on optimal pebbling of hypercubes. J. Comb. Optim. 25 (4) (2013)
Huilan Chang, Hung-Lin Fu, Min-Yun Lien
The decycling number of outerplanar graphs. J. Comb. Optim. 25 (4) (2013)
Hui-Chuan Lu, Hung-Lin Fu
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures. Inf. Sci. 240 (2013)
Huilan Chang, Hung-Lin Fu, Chih-Huai Shih
Threshold Group Testing on Inhibitor Model. J. Comput. Biol. 20 (6) (2013)
Hong-Bin Chen, Hung-Lin Fu
Group Testing with Multiple Mutually-Obscuring Positives. Information Theory, Combinatorics, and Search Theory (2013)
Jyhmin Kuo, Hung-Lin Fu
On the Diameter of the Generalized Undirected De Bruijn Graphs. Ars Comb. 106 (2012)
Huilan Chang, Hong-Bin Chen, Hung-Lin Fu, Chie-Huai Shi
Reconstruction of hidden graphs and threshold group testing. J. Comb. Optim. 22 (2) (2011)
Hung-Lin Fu, Y.-H. Lin, Miwako Mishima
Errata to "Optimal Conflict-Avoiding Codes of Even Length and Weight 3". IEEE Trans. Inf. Theory 57 (8) (2011)
Renwang Su, Hung-Lin Fu
Embeddings of Maximum Packings of Triples. Ars Comb. 98 (2011)
David Cariolaro, Hung-Lin Fu
Covering graphs with matchings of fixed size. Discret. Math. 310 (2) (2010)
Hung-Lin Fu, Y.-H. Lin, Miwako Mishima
Optimal Conflict-Avoiding Codes of Even Length and Weight 3. IEEE Trans. Inf. Theory 56 (11) (2010)
Huilan Chang, Hong-Bin Chen, Hung-Lin Fu
Identification and Classification Problems on Pooling Designs for Inhibitor Models. J. Comput. Biol. 17 (7) (2010)
David Cariolaro, Hung-Lin Fu
Excessive near 1-factorizations. Discret. Math. 309 (14) (2009)
Rucong Zhang, Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, Yukiyasu Mutoh
4 Grid-Block Designs with r=3, 4. SIAM J. Discret. Math. 23 (2) (2009)
Miwako Mishima, Hung-Lin Fu, Shoichi Uruno
= 0 (mod 16) and weight 3. Des. Codes Cryptogr. 52 (3) (2009)
Liqun Pu, Hung-Lin Fu, Hao Shen
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves. Discret. Math. 309 (14) (2009)
F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. Discret. Appl. Math. 157 (1) (2009)
Liqun Pu, Hung-Lin Fu, Hao Shen
Maximum Packing of Dt - P and Dt U P with Mendelsohn Triples. Ars Comb. 91 (2009)
Hung-Lin Fu
Some Results on 4-cycle Packings. Ars Comb. 93 (2009)
Hung-Lin Fu, Yuan-Hsun Lo
Multicolored parallelisms of Hamiltonian cycles. Discret. Math. 309 (14) (2009)
David Cariolaro, Hung-Lin Fu
The Excessive [3]-Index of All Graphs. Electron. J. Comb. 16 (1) (2009)
Hong-Bin Chen, Hung-Lin Fu
Nonadaptive algorithms for threshold group testing. Discret. Appl. Math. 157 (7) (2009)
Jyhmin Kuo, Hung-Lin Fu
. Networks 52 (4) (2008)
Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven. SIAM J. Discret. Math. 23 (1) (2008)
Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu
Near automorphisms of cycles. Discret. Math. 308 (7) (2008)
David Cariolaro, Hung-Lin Fu
On minimum sets of 1-factors covering a complete multipartite graph. J. Graph Theory 58 (3) (2008)
Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen
. Discret. Math. 308 (17) (2008)
Liqun Pu, Hung-Lin Fu, Hao Shen
. Discret. Math. 308 (16) (2008)
Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang
An upper bound of the number of tests in pooling designs for the error-tolerant complex model. Optim. Lett. 2 (3) (2008)
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith
All graphs with maximum degree three whose complements have 4-cycle decompositions. Discret. Math. 308 (13) (2008)
Hung-Lin Fu, S. L. Logan, Christopher A. Rodger
-F. Discret. Math. 308 (13) (2008)
Hung-Lin Fu, Frank K. Hwang
-separable matrices via an improved decoding of Macula's construction. Discret. Optim. 5 (4) (2008)
Chin-Lin Shiue, Hung-Lin Fu
The IC-Indices of Complete Bipartite Graphs. Electron. J. Comb. 15 (1) (2008)
Jyhmin Kuo, Hung-Lin Fu
Wide diameters of de Bruijn graphs. J. Comb. Optim. 14 (2-3) (2007)
Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu
. J. Comb. Optim. 14 (2-3) (2007)
Chia-Fen Chang, Hung-Lin Fu
Near automorphisms of trees with small total relative displacements. J. Comb. Optim. 14 (2-3) (2007)
Shung-Liang Wu, Hung-Lin Fu
Maximum cyclic 4-cycle packings of the complete multipartite graph. J. Comb. Optim. 14 (2-3) (2007)
Gerard J. Chang, Hung-Lin Fu, Xuding Zhu
Editorial note. J. Comb. Optim. 14 (2-3) (2007)
Chin-Lin Shiue, Hung-Lin Fu
alpha-labeling number of trees. Discret. Math. 306 (24) (2006)
Hung-Lin Fu, Frank K. Hwang
A novel use of t-packings to construct d-disjunct matrices. Discret. Appl. Math. 154 (12) (2006)
Shung-Liang Wu, Hung-Lin Fu
. Graphs Comb. 22 (3) (2006)
Saieed Akbari, Alireza Alipour, Hung-Lin Fu, Yuan-Hsun Lo
Multicolored Parallelisms of Isomorphic Spanning Trees. SIAM J. Discret. Math. 20 (3) (2006)
Liqun Pu, Hung-Lin Fu, Hao Shen
. Graphs Comb. 22 (4) (2006)
Hung-Lin Fu
Balanced bipartite 4-cycle designs. Australas. J Comb. 32 (2005)
Hung-Lin Fu, Frank K. Hwang
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. J. Comb. Optim. 9 (3) (2005)
David James Ashe, Christopher A. Rodger, Hung-Lin Fu
All 2-Regular Leaves of Partial 6-cycle Systems. Ars Comb. 76 (2005)
Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger
Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs Comb. 21 (2) (2005)
Renwang Su, Hung-Lin Fu, Hao Shen
Embeddings of maximum packings in triple systems. Discret. Math. 284 (1-3) (2004)
Hung-Lin Fu, Ming-Hway Huang
Packing Balanced Complete Multipartite Graph with Hexagons. Ars Comb. 71 (2004)
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger
into triangles. Discret. Math. 284 (1-3) (2004)
David James Ashe, Hung-Lin Fu, Christopher A. Rodger
A solution to the forest leave problem for partial 6-cycle systems. Discret. Math. 281 (1-3) (2004)
Hung-Lin Fu, Shung-Liang Wu
Cyclically decomposing the complete graph into cycles. Discret. Math. 282 (1-3) (2004)
Hui-Lan Fan, Hung-Lin Fu
The Edge-Coloring of Graphs with Small Genus. Ars Comb. 73 (2004)
Ming-Chun Tsai, Hung-Lin Fu
Edge Number of 3-Connected Diameter 3 Graphs. ISPAN (2004)
Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu
The Existence of 2x4 Grid-Block Designs and Their Applications. SIAM J. Discret. Math. 16 (2) (2003)
Hung-Lin Fu, Wei-Hsin Hu
Ascending subgraph decompositions of regular graphs. Discret. Math. 253 (1-3) (2002)
Yen-Chi Chen, Hung-Lin Fu, I-Fan Sun
A Study of Typenumber in Book-Embedding. Ars Comb. 62 (2002)
Hung-Lin Fu, Ming-Chun Tsai
The Maximum Genus of a Graph with Given Diameter and Connectivity. Electron. Notes Discret. Math. 11 (2002)
Hung-Lin Fu, I-Fan Sun
The typenumber of trees. Discret. Math. 253 (1-3) (2002)
Hung-Lin Fu, Ming-Chun Tsai
The Maximum Genus of a Graph with Given Diameter and Connectivity. Electron. Notes Discret. Math. 11 (2002)
Darryn E. Bryant, Hung-Lin Fu
-saturated bipartite graphs. Discret. Math. 259 (1-3) (2002)
Hung-Lin Fu, Ming-Chun Tsai, N. H. Xuong
The decay number and the maximum genus of diameter 2 graphs. Discret. Math. 226 (1-3) (2001)
Hung-Lin Fu, Wei-Hsin Hu
A note on ascending subgraph decompositions of complete multipartite graphs. Discret. Math. 226 (1-3) (2001)
Hung-Lin Fu, Chin-Lin Shiue
-ary tree. Discret. Math. 222 (1-3) (2000)

Hung-Lin Fu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hung-Lin Fu