Hung-Lin Fu

According to our database, Hung-Lin Fu authored at least 122 papers between 1987 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

The undirected optical indices of trees.

Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong

J. Comb. Optim., March, 2025

2024

Total colorings of some classes of four regular circulant graphs.

R. Navaneeth, Jayabalan Geetha, Kanagasabapathi Somasundaram, Hung-Lin Fu

AKCE Int. J. Graphs Comb., 2024

2022

Epidemic Source Detection in Contact Tracing Networks: Epidemic Centrality in Graphs and Message-Passing Algorithms.

Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu

IEEE J. Sel. Top. Signal Process., 2022

Adjacent vertex distinguishing total coloring in split graphs.

Shaily Verma, Hung-Lin Fu, B. S. Panda

Discret. Math., 2022

2021

Quaternary splitting algorithm in group testing.

Jinn Lu, Hung-Lin Fu

J. Comb. Optim., 2021

Hamiltonicity in Prime Sum Graphs.

Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo

Graphs Comb., 2021

Total colorings of circulant graphs.

J. Geetha, K. Somasundaram, Hung-Lin Fu

Discret. Math. Algorithms Appl., 2021

Strongly separable matrices for nonadaptive combinatorial group testing.

Jinping Fan, Hung-Lin Fu, Yujie Gu, Ying Miao, Maiko Shigeno

Discret. Appl. Math., 2021

2020

The integer {k}-domination number of circulant graphs.

Yen-Jen Cheng, Hung-Lin Fu, Chia-An Liu

Discret. Math. Algorithms Appl., 2020

The undirected optical indices of complete m-ary trees.

Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong

Discret. Appl. Math., 2020

2019

Rumor Source Detection in Finite Graphs with Boundary Effects by Message-Passing Algorithms.

Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu

Proceedings of the Influence and Behavior Analysis in Social Networks and Social Media, 2019

2018

Learning a hidden uniform hypergraph.

Huilan Chang, Hung-Lin Fu, Chih-Huai Shih

Optim. Lett., 2018

Averting Cascading Failures in Networked Infrastructures: Poset-Constrained Graph Algorithms.

Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu

IEEE J. Sel. Top. Signal Process., 2018

On the number of rainbow spanning trees in edge-colored complete graphs.

Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry, C. A. Rodger

Discret. Math., 2018

Graph algorithms for preventing cascading failures in networks.

Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu

Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

2017

The Global Packing Number of a Fat-Tree Network.

Yuan-Hsun Lo, Yijin Zhang, Yi Chen, Hung-Lin Fu, Wing Shing Wong

IEEE Trans. Inf. Theory, 2017

New bounds on the decycling number of generalized de Bruijn digraphs.

Jyhmin Kuo, Hung-Lin Fu

Discret. Math. Algorithms Appl., 2017

Codes with the identifiable parent property for multimedia fingerprinting.

Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao

Des. Codes Cryptogr., 2017

The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs.

Hui-Chuan Lu, Hung-Lin Fu

Discret. Appl. Math., 2017

Rainbow Cycle Designs.

Hung-Lin Fu

Bull. ICA, 2017

Rumor source detection in unicyclic graphs.

Pei-Duo Yu, Chee-Wei Tan, Hung-Lin Fu

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Rumor Source Detection in Finite Graphs with Boundary Effects by Message-passing Algorithms.

Pei-Duo Yu, Chee Wei Tan, Hung-Lin Fu

Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016

The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors.

Hongchuan Lei, Hung-Lin Fu

Graphs Comb., 2016

Partially user-irrepressible sequence sets and conflict-avoiding codes.

Yuan-Hsun Lo, Wing Shing Wong, Hung-Lin Fu

Des. Codes Cryptogr., 2016

Optimal detection of influential spreaders in online social networks.

Chee Wei Tan, Pei-Duo Yu, Chun-Kiu Lai, Wenyi Zhang, Hung-Lin Fu

Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

2015

On the decycling number of generalized Kautz digraphs.

Min-Yun Lien, Jyhmin Kuo, Hung-Lin Fu

Inf. Process. Lett., 2015

Weighted maximum matchings and optimal equi-difference conflict-avoiding codes.

Yuan-Hsun Lo, Hung-Lin Fu, Yi-Hean Lin

Des. Codes Cryptogr., 2015

New bounds on 2-separable codes of length 2.

Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao

Des. Codes Cryptogr., 2015

The Global Packing Number for an Optical Network.

Yuan-Hsun Lo, Yijin Zhang, Wing Shing Wong, Hung-Lin Fu

CoRR, 2015

The Absorbant Number of Generalized de Bruijn Digraphs.

Jyhmin Kuo, Hung-Lin Fu

Ars Comb., 2015

Multicolored Isomorphic Spanning Trees in Complete Graphs.

Hung-Lin Fu, Yuan-Hsun Lo

Ars Comb., 2015

2014

Learning a hidden graph.

Huilan Chang, Hung-Lin Fu, Chih-Huai Shih

Optim. Lett., 2014

The decycling number of.

Min-Yun Lien, Hung-Lin Fu, Chie-Huai Shih

Discret. Math. Algorithms Appl., 2014

The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures.

Hui-Chuan Lu, Hung-Lin Fu

Des. Codes Cryptogr., 2014

Optimal conflict-avoiding codes of odd length and weight three.

Hung-Lin Fu, Yuan-Hsun Lo, Kenneth W. Shum

Des. Codes Cryptogr., 2014

2013

A note on optimal pebbling of hypercubes.

Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue

J. Comb. Optim., 2013

The decycling number of outerplanar graphs.

Huilan Chang, Hung-Lin Fu, Min-Yun Lien

J. Comb. Optim., 2013

Threshold Group Testing on Inhibitor Model.

Huilan Chang, Hung-Lin Fu, Chih-Huai Shih

J. Comput. Biol., 2013

New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures.

Hui-Chuan Lu, Hung-Lin Fu

Inf. Sci., 2013

Group Testing with Multiple Mutually-Obscuring Positives.

Hong-Bin Chen, Hung-Lin Fu

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

On the Diameter of the Generalized Undirected De Bruijn Graphs.

Jyhmin Kuo, Hung-Lin Fu

Ars Comb., 2012

2011

Errata to "Optimal Conflict-Avoiding Codes of Even Length and Weight 3".

Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima

IEEE Trans. Inf. Theory, 2011

Reconstruction of hidden graphs and threshold group testing.

Huilan Chang, Hong-Bin Chen, Hung-Lin Fu, Chie-Huai Shi

J. Comb. Optim., 2011

Embeddings of Maximum Packings of Triples.

Renwang Su, Hung-Lin Fu

Ars Comb., 2011

2010

Optimal Conflict-Avoiding Codes of Even Length and Weight 3.

Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima

IEEE Trans. Inf. Theory, 2010

Identification and Classification Problems on Pooling Designs for Inhibitor Models.

Huilan Chang, Hong-Bin Chen, Hung-Lin Fu

J. Comput. Biol., 2010

Covering graphs with matchings of fixed size.

David Cariolaro, Hung-Lin Fu

Discret. Math., 2010

2009

The Existence of r^×4 Grid-Block Designs with r=3, 4.

Rucong Zhang, Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, Yukiyasu Mutoh

SIAM J. Discret. Math., 2009

Directed 3-cycle decompositions of complete directed graphs with quadratic leaves.

Liqun Pu, Hung-Lin Fu, Hao Shen

Discret. Math., 2009

Multicolored parallelisms of Hamiltonian cycles.

Hung-Lin Fu, Yuan-Hsun Lo

Discret. Math., 2009

Excessive near 1-factorizations.

David Cariolaro, Hung-Lin Fu

Discret. Math., 2009

Optimal conflict-avoiding codes of length <i>n</i> = 0 (mod 16) and weight 3.

Miwako Mishima, Hung-Lin Fu, Shoichi Uruno

Des. Codes Cryptogr., 2009

Nonadaptive algorithms for threshold group testing.

Hong-Bin Chen, Hung-Lin Fu

Discret. Appl. Math., 2009

The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks.

F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin

Discret. Appl. Math., 2009

The Excessive [3]-Index of All Graphs.

David Cariolaro, Hung-Lin Fu

Electron. J. Comb., 2009

Maximum Packing of Dt - P and Dt U P with Mendelsohn Triples.

Liqun Pu, Hung-Lin Fu, Hao Shen

Ars Comb., 2009

Some Results on 4-cycle Packings.

Hung-Lin Fu

Ars Comb., 2009

2008

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.

Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu

SIAM J. Discret. Math., 2008

An upper bound of the number of tests in pooling designs for the error-tolerant complex model.

Hong-Bin Chen, Hung-Lin Fu, Frank K. Hwang

Optim. Lett., 2008

On the diameter of the generalized undirected de Bruijn graphs <i>UG</i>_<i>B</i>(<i>n</i>, <i>m</i>), <i>n</i>² < <i>m</i> <= <i>n</i>³.

Jyhmin Kuo, Hung-Lin Fu

Networks, 2008

On minimum sets of 1-factors covering a complete multipartite graph.

David Cariolaro, Hung-Lin Fu

J. Graph Theory, 2008

Maximal sets of Hamilton cycles in D_n.

Liqun Pu, Hung-Lin Fu, Hao Shen

Discret. Math., 2008

Maximal sets of hamilton cycles in K_2p-F.

Hung-Lin Fu, S. L. Logan, Christopher A. Rodger

Discret. Math., 2008

The linear 3-arboricity of K_{n, n} and K_n.

Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen

Discret. Math., 2008

All graphs with maximum degree three whose complements have 4-cycle decompositions.

Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith

Discret. Math., 2008

Near automorphisms of cycles.

Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu

Discret. Math., 2008

A new construction of <i>I</i>-separable matrices via an improved decoding of Macula's construction.

Hung-Lin Fu, Frank K. Hwang

Discret. Optim., 2008

The IC-Indices of Complete Bipartite Graphs.

Chin-Lin Shiue, Hung-Lin Fu

Electron. J. Comb., 2008

2007

Maximum cyclic 4-cycle packings of the complete multipartite graph.

Shung-Liang Wu, Hung-Lin Fu

J. Comb. Optim., 2007

Wide diameters of de Bruijn graphs.

Jyhmin Kuo, Hung-Lin Fu

J. Comb. Optim., 2007

Packing 5-cycles into balanced complete <i>m</i> -partite graphs for odd <i>m</i>.

Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu

J. Comb. Optim., 2007

Editorial note.

Gerard J. Chang, Hung-Lin Fu, Xuding Zhu

J. Comb. Optim., 2007

Near automorphisms of trees with small total relative displacements.

Chia-Fen Chang, Hung-Lin Fu

J. Comb. Optim., 2007

2006

Multicolored Parallelisms of Isomorphic Spanning Trees.

Saieed Akbari, Alireza Alipour, Hung-Lin Fu, Yuan-Hsun Lo

SIAM J. Discret. Math., 2006

A Note on Cyclic <i>m</i>-cycle Systems of <i>K</i>_<i>r(m)</i>.

Shung-Liang Wu, Hung-Lin Fu

Graphs Comb., 2006

-Decompositions of and <i>D</i>_<i>v</i> UNION <i>P</i> where <i>P</i> is a 2-Regular Subgraph of <i>D</i>_<i>v</i>.

Liqun Pu, Hung-Lin Fu, Hao Shen

Graphs Comb., 2006

alpha-labeling number of trees.

Chin-Lin Shiue, Hung-Lin Fu

Discret. Math., 2006

A novel use of t-packings to construct d-disjunct matrices.

Hung-Lin Fu, Frank K. Hwang

Discret. Appl. Math., 2006

2005

On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls.

Hung-Lin Fu, Frank K. Hwang

J. Comb. Optim., 2005

Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles.

Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger

Graphs Comb., 2005

All 2-Regular Leaves of Partial 6-cycle Systems.

David James Ashe, Christopher A. Rodger, Hung-Lin Fu

Ars Comb., 2005

Balanced bipartite 4-cycle designs.

Hung-Lin Fu

Australas. J Comb., 2005

2004

Embeddings of maximum packings in triple systems.

Renwang Su, Hung-Lin Fu, Hao Shen

Discret. Math., 2004

Cyclically decomposing the complete graph into cycles.

Hung-Lin Fu, Shung-Liang Wu

Discret. Math., 2004

Decomposing <i>K_n</i>cup<i>P</i> into triangles.

Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger

Discret. Math., 2004

A solution to the forest leave problem for partial 6-cycle systems.

David James Ashe, Hung-Lin Fu, Christopher A. Rodger

Discret. Math., 2004

Packing Balanced Complete Multipartite Graph with Hexagons.

Hung-Lin Fu, Ming-Hway Huang

Ars Comb., 2004

The Edge-Coloring of Graphs with Small Genus.

Hui-Lan Fan, Hung-Lin Fu

Ars Comb., 2004

Edge Number of 3-Connected Diameter 3 Graphs.

Ming-Chun Tsai, Hung-Lin Fu

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

2003

The Existence of 2x4 Grid-Block Designs and Their Applications.

Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu

SIAM J. Discret. Math., 2003

2002

The Maximum Genus of a Graph with Given Diameter and Connectivity.

Hung-Lin Fu, Ming-Chun Tsai

Electron. Notes Discret. Math., 2002

The typenumber of trees.

Hung-Lin Fu, I-Fan Sun

Discret. Math., 2002

Ascending subgraph decompositions of regular graphs.

Hung-Lin Fu, Wei-Hsin Hu

Discret. Math., 2002

<i>C</i>₄-saturated bipartite graphs.

Darryn E. Bryant, Hung-Lin Fu

Discret. Math., 2002

A Study of Typenumber in Book-Embedding.

Yen-Chi Chen, Hung-Lin Fu, I-Fan Sun

Ars Comb., 2002

2001

Four-Cycle Systems with Two-Regular Leaves.

H. L. Fu, Christopher A. Rodger

Graphs Comb., 2001

The decay number and the maximum genus of diameter 2 graphs.

Hung-Lin Fu, Ming-Chun Tsai, N. H. Xuong

Discret. Math., 2001

A note on ascending subgraph decompositions of complete multipartite graphs.

Hung-Lin Fu, Wei-Hsin Hu

Discret. Math., 2001

4-Cycle Group-Divisible Designs with Two Associate Classes.

H. L. Fu, C. A. Rodger

Comb. Probab. Comput., 2001

2000

Forest leaves and four-cycles.

Hung-Lin Fu, Christopher A. Rodger

J. Graph Theory, 2000

The optimal pebbling number of the complete <i>m</i>-ary tree.

Hung-Lin Fu, Chin-Lin Shiue

Discret. Math., 2000

On the alpha-labeling number of bipartite graphs.

Saad I. El-Zanati, Hung-Lin Fu, Chin-Lin Shiue

Discret. Math., 2000

Linear k-arboricities on trees.

Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang

Discret. Appl. Math., 2000

A Study of the Genus of a Group.

Hung-Lin Fu, I-Fan Sun

Ars Comb., 2000

1999

The existence of group divisible designs with first and second associates, having block size 3.

Hung-Lin Fu, Christopher A. Rodger, Dinesh G. Sarvate

Ars Comb., 1999

Almost Resolvable Directed m-cycle systems: m = 3 (mod 6).

Hung-Lin Fu, Christopher A. Rodger

Ars Comb., 1999

1998

Group Divisible Designs with Two Associate Classes: n=2 orm=2.

Hung-Lin Fu, Christopher A. Rodger

J. Comb. Theory A, 1998

Two Doyen-Wilson theorems for maximum packings with triples.

H. L. Fu, Charles C. Lindner, C. A. Rodger

Discret. Math., 1998

The Doyen-Wilson theorem for maximum packings of K_n with 4-cycles.

H. L. Fu, Charles C. Lindner

Discret. Math., 1998

A study of the total chromatic number of equibipartite graphs.

Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang

Discret. Math., 1998

1997

Connectivity of cages.

Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger

J. Graph Theory, 1997

On upper bounds for the pseudo-achromatic index.

Nam-Po Chiang, Hung-Lin Fu

Discret. Math., 1997

1996

The maximum genus of diameter three graphs.

Hung-Lin Fu, Ming-Chun Tsai

Australas. J Comb., 1996

1995

The achromatic indices of the regular complete multipartite graphs.

Nam-Po Chiang, Hung-Lin Fu

Discret. Math., 1995

1994

Disjoint odd integer subsets having a constant odd sum.

Hung-Lin Fu, Wei-Hsin Hu

Discret. Math., 1994

On prime labellings.

Hung-Lin Fu, Kuo-Ching Huang

Discret. Math., 1994

Edge domination in complete partite graphs.

Bor-Liang Chen, Hung-Lin Fu

Discret. Math., 1994

1992

Total colorings of graphs of order 2<i>n</i> having maximum degree 2<i>n</i>-2.

Bor-Liang Chen, Hung-Lin Fu

Graphs Comb., 1992

On the achromatic number of the Cartesian product G₁×G₂.

Nam-Po Chiang, Hung-Lin Fu

Australas. J Comb., 1992

1991

Decomposing graphs into forests of paths with size less than three.

Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang

Australas. J Comb., 1991

1990

A note on the ascending subgraph decomposition problem.

Hung-Lin Fu

Discret. Math., 1990

1987

Intersection problem of Steiner systems S(3, 4, 2nu).

Hung-Lin Fu

Discret. Math., 1987