H. Fan, Yu-Liang Wu, Ray C. C. Cheung: Design Automation
Framework for Reconfigurable Interconnection Networks. Comput. J.
56(2): 258-269 (2013)
H. Fan, Brian Moore, and Y.L. Wu, "Structured Overlay
Network for File Distribution," to appear Discrete Mathematics,
Algorithms and Applications. Vol. 4, No. 2 (2012) June 2012.
F. S. Chim, T. K. Lam, Y.L. Wu, and H. Fan,
"On Structural Analysis and Efficiency for Graph-Based Rewiring
Techniques," IEICE Transactions on Fundamentals of Electronics, Communications and
Computer Sciences, Vol. E94, No. 12, pp. 2853-2865, Dec. 2011
H. Fan, G. Liu, J. Liu, H. Long, The Existence of Even Regular Factors of Regular Graphs
on the Number of Cut Edges, Acta Mathematica Sinica, Vol.26, No.12, pp.2305-2312, 2010.
H. Fan, J. Liu, Y.L. Wu, and C.C. Cheung, “The Exact Channel Density
Bound and Compound Design for Generic Universal Switch Blocks”, ACM
Transactions on Design Automation of Electronic Systems, Vol.12, no.2, April, 2007.
H. Fan, Y. L. Wu and C.C. Cheung, and J. Liu, “Decomposition
Design Theory and Methodology for Arbitrary-Shaped Switch Boxes,” IEEE
Transactions on Computers, vol.55, no.4, pp.373-384, Apr. 2006.
H. Fan, G. Liu, and J. Liu, “Minimal Regular 2-Graphs and
Applications”, Science in China Ser. A. Mathematics. vol. 49, no. 2,
158-172, 2006.
J. Alber, H. Fan, M. Fellow, H. Fernau, R.
Niedermeier, F. Rosamond and U. Stege, “Refined Search Tree
Technique for Dominating Set on Planar Graphs”, Journal
of Computer and System Sciences, vol.71, no.4, 385-405, 2005.
H. Fan, G. Liu, and J. Liu, “Minimal Regular 2-Graphs and
Applications”, Science in China Ser. A. Mathematics. vol.35,
no. 11, 1219-1235, Nov., 2005 (Chinese version)
J. Ellis, H. Fan and M. Fellows, “The Dominating Set Problem
is Fixed Parameter Tractable for Graphs of Bounded Genu”, Journal
of Algorithms, vol. 52, no. 2, pp. 152-168, Aug. 2004.
H. Fan, J. Liu, Y. L. Wu and C.C. Cheung, “On Optimal Hyper
Universal and Rearrageable Switch Box Designs,” IEEE
Transactions on Computer Aided Designs, vol.22, no.12, pp.1637-1649, Dec. 2003.
H. Fan, J. Liu and Y. L. Wu, “General Models
and a Reduction Design Technique for FPGA Switch Box Designs,” IEEE
Transactions on Computers. vol. 52, no.
1, pp.21-30, Jan. 2003.
J. Liu, H. Fan, D. Porto, and Y. L. Wu, “An Efficient Exact
Router for Hyper-Universal Switching Box,” IEICE Transactions
on Fundamentals of Electronics, Communications and Computer Sciences,
vol. E86-A, no. 6, pp. 1430-1436, June 2003.
H. Fan, J. Liu, Y. L. Wu, and C. K. Wong, “Reduction Design for
Generic Universal Switch Blocks,” ACM Transactions
on Design Automation of Electronic Systems, vol. 7,
no. 4, pp.526-546, Dec.2002.
Y. L. Wu, C.C. Cheung, D. I. Cheng, and H. Fan,
“Further Improve Circuit Partitioning using GBAW Logic
Perturbation Techniques,” IEEE Transactions on Very Large Scale
Integration Systems, vol. 11, no. 3, pp. 451-460, June. 2003.
H. Fan, Y.L. Wu, and Y. W. Chang, “Comment on General Universal
Switch Blocks,” IEEE Transactions on Computers, vol. 51, no. 1, pp. 93-95, 2002.
J. Ellis,H. Fan and J. Shallit, “Computing the Cycles in the
k-Way Shuffle,” Discrete Mathematics and Computer Science, vol. 5, no. 1, pp. 169-180, 2002.
H. Fan, Y. L. Wu, and C. K. Wong, “On Fixed Edges and
Edge-Reconstruction of Series-Parallel Networks,” Graphs
and Combinatorics, vol. 17, pp. 213-225, 2001.
J. Ellis, H. Fan and T. Krahn, “Computing the Cycles in the
Perfect Shuffle Permutation,” Information Processing Letters, vol. 75, pp. 217-224, 2000.
Y. Ma and H. Fan, Boolean graphs and their dimensions. (Chinese) Shandong
Daxue Xuebao Ziran Kexue Ban 35 (2000), no. 4, 381--386.
Y.L. Wu, H. Fan, M. Marek-Sadowska, and C. K. Wong, “OBDD
Minimization Based on Two-Level Representation of Boolean
Functions,” IEEE Transactions on Computers, vol.
49, no. 12, pp. 1371-1379, 2000.
Y.L. Wu, W. N. Long, and H. Fan, “A Fast Graph-Based
Alternative Wiring Scheme for Boolean Networks,” IEICE
Transactions on Fundamentals of Electronics, Communications and
Computer Sciences, vol. E83-A, no.6, pp. 1131-1137, 2000.
H. Fan, “Almost Every Graph Has Fixed Edge,” Chinese
Science Bulletin, vol. 43, no. 2, pp. 99-101, 1998.
H. Fan and X. Zhu, “Oriented Double Walk Covering and
Bidirectional Double Tracing,” Journal of Graph Theory,
vol. 28, no. 4, pp. 89-102, 1998.
L. Xie and H. Fan, “On the Reconstruction of Local
Graphs,” Advances in Mathematics, vol. 25, no.1, pp. 65-70, 1996.
L. Xie and H. Fan, “A New Result on Reconstructible Local
Graphs,” Advances in Mathematics, vol. 26, no. 5, pp. 428-444 , 1997.
B. Xu and H. Fan, “On fixed edge of planar graphs with
minimum degree five,” Discrete Mathematics, vol. 152, 325-328, 1996.
H. Fan, “The Edge Reconstruction of Planar Graphs with Minimum
Degree at Least Three--(I),” System Science and Mathematical Science, vol. 6, no.4, pp. 376-382, 1993.
H. Fan, “The Edge Reconstruction of Planar Graphs with Minimum
Degree at Least Three--(II),” System Science and Mathematical Science, vol. 7, no. 1, pp. 49-55, 1994.
H. Fan, “The Edge Reconstruction of Planar Graphs with Minimum
Degree at Least Three--(III),” System Science and Mathematical Science, vol. 7, no. 2, pp. 115-120,
1994.
H. Fan, “The Edge Reconstruction of Planar Graphs with Minimum
Degree at Least T hree--(IV),” System
Science and Mathematical Science, vol. 7, no. 3, pp. 218-222, 1994.
B. Xu and H. Fan, “The Fixed Edge of Maximal Planar and Outplanar Planar
Graphs,” Journal of SDU, vol. 28, no. 2, pp. 156-169, 1996. (in Chinese)
H. Fan and B. Liu, “A Note on the Similar Edge of Trees,” Journal
of SDU, vol. 30, no. 3, pp. 345-348, 1995. (in Chinese)
B. Xu and H. Fan, “On Reconstructible Local-Nuclei Subgraphs,”
Combinatorics and Graph Theory, World Science Press, 1995.
H. Fan, “The 5-Flow Theorem on Klein Bottle and Torus,” Acta
Mathematica Scientia, vol. 10, no.3, pp. 337-342, 1990. (in Chinese)
H. Fan, “The Condition of Two Triple Points Which Can Be Passed
by an Involute of a Circle,” Journal of SDU, vol. 26, no. 1, pp. 10-18,
1991. (in Chinese)
H. Fan, “On the Evaluation of the Curve with Monotone Curvature
and Passing Two Triple Points,” Journal of SDU, vol. 26, no. 1, pp.
154-163, 1991. (in Chinese)
H. Fan and B. Xu, “On the Fixed Edge of Graphs," Journal
of SDU, vol.28, no. 3, pp. 269-273, 1993. (in Chinese)
T. Wang, H. Fan et al., “On Alternating Sequences Relation
to a C-matching of Hypergraphs,” Advances in Mathematics, vol.
6, no. 2, pp.216-217, 1987.
Refereed Conference Proceedings
H. Fan, Y.A. Chen and Y.L. Wu, "R-NoC: An Efficient Packet-Switched
Reconfigurable Networks-on-Chip," Proc. Internatinal Symposium on Applied Reconfighurable Computing (ARC), pp.
365-371, March. 2012, Hong Kong
H.
Fan and Y.A. Chen, Steiner Tree for Data Distribution (AMMCS), AIP
conference processing 1368, pp.255-258, July 2011.
H. Fan and Y-L Wu,
Structured Overlay Network for File Distribution. COCOA (2)
2010, LNCS6509,292-302.
H. Fan, Y.L. Wu, and C.C. Cheung, "Design Automation for Reconfigurable
Interconnection Networks", 6th International Symposium on
Reconfigurable Computing: Architectures, Tools and Applications (ARC
2010), LNCS 5992, 244-256.
H. Fan and Y.L. Wu, A new combinatorial design approach for rearrangeable multicast switching
networks, COCOA 2009, LNCS5573, pp.384-394.
H. Fan, Y.L. Wu and J. Ernst, "Customized Reconfigurable Interconnection Networks for Multiple Application SoCs",
Proc. International Conference on Field Programmable Logic and Applications
(FPL), pp.491-494,Sept. 2008.
H. Fan, C. Hundt, Y.L. Wu, J. Ernst, "Algorithms and
Implementation for Interconnection Graph Problem," COCOA 2008,
LNCS5165, pp. 201-210, Aug. 2008.
H. Fan and Y.L. Wu, "Interconnection Graph Problem", Proceeding of
International Conference on Foundations of Computer Science, pp. 51-55, July, a2008.
H. Fan and R. Kalbfleisch, "An Edge Ordering Problem of
Regular Hypergraphs", COCOON 2006, LNCS4112, pp. 368-377, 2006.
H. Fan and Y.L. Wu, "Crossbar Based Design Schemes for Optimal Switch
Boxes and Programmable Interconnection Networks," Proc. ASP-DAC,
2005. pp. 910-915. 2005.
H. Fan and Y.L. Wu, "On Three-Stage Interconnection Networks for Group
Communications," (invited talk) Proc. IEEE Emerging Information
Technology Conference (EITC) 2005. Taipei.
H. Fan, Y.L. Wu, and L. Zhou, "Augmented Disjoint Switch Boxes for FPGAs," Proc. WISICT,
2005. pp. 129-134. 2005
H. Fan, Y.L. Wu, J. Liu, and C.C. Cheung, "On Optimal Irregular Switch Box
Designs," International Conference on Field Programmable Logic and
Applications (FPL), LNCS 3203, pp. 189-199, 2004.
Y. L. Wu, H. Fan, and C.C. Cheung, “On Strong Locality
Properties of Alternative Wires in Digital Circuits,” Proc.
SASIMI'03. pp. 244-250, 2003 Hiroshima.
J. Liu, H. Fan, and Y. L. Wu, “On Improving FPGA
Routability Applying Multi-level Switch Boxes,” Proc. IEEE
ASP-DAC'03, pp. 366-369, 2003 Kitakyushy.
J. Ellis, H. Fan and M. Fellows, “The Dominating Set
Problem is Fixed Parameter Tractable for Graphs of Bounded Genus,”
SWAT2002, LNCS 2368, pp. 180-189.
H. Fan, J. Liu, Y. L. Wu, and C.C. Cheung, “On Optimum
Designs of Universal Switch Blocks,” Proc. IEEE International
Conference on Field Programmable Logic and Applications (FPL). pp. 142-151, 2002
Montpellier.
J. Alber, H. Fan, M. Fellows, H. Fernau, R. Niedermeier, F.
Rosamond, U. Stege, “Refined Search Tree Technique for Dominating
Set on Planar Graphs,” MFCS 2001, LNCS 2136, pp. 111--122, 2001.
H. Fan, J. Liu, Y. L. Wu and C.C. Cheung,
“On Optimum Designs of Universal Switch Blocks,” FPL2002, pp.
142-151, 2002, Montpellier.
H. Fan, J. Liu, D. D. Porto, and Y. L. Wu, “A Detailed
Routing Algorithm for Switch Box of Optimum Routability,” Proc.
IEEE International Conference on Circuits/Systems Computers and
Communications (ITC-CSCC), 2002, Phuket.
H. Fan, J. Liu, Y. L. Wu, and Chak-Chung Cheung, “On
Optimum Switch Box Designs for 2-D FPGAs,” Proc.
IEEE/ACM Design Automation Conference (DAC), pp. 203-208, June
2001, Las Vegas.
H. Fan, J. Liu, and Y. L. Wu, “Combinational Routing
Analysis and Design of Universal Switch Blocks,” Proc.
IEEE ASPDAC'01, pp. 641-648, Jan. 2001, Yokohama.
H. Fan, J.P. Liu, and Y. L. Wu, “General Models for Optimum
Arbitrary-Dimension FPGA Switch
Box Designs,” Proc. IEEE International
Conference on Computer-Aided Design (ICCAD), pp. 93-98, Nov. 2000,
San Jose.
H. Fan, J. Liu, and Y. L. Wu, “A Global Routing Model for
Universal Switch Box Design,” Proc. IEEE
International Conference on Electronics, Circuits and Systems
(ICECS'00), pp. 78-81, Dec. 2000, Lebanon.
H. Fan, J. Liu, and Y. L. Wu, “A New FPGA Global Routing
Model - A Decomposition Theory and Its Application,” Proc.
the 11th VLSI Design/CAD Symposium, pp. 103-106, Aug. 2000.
Y.L. Wu, W. N. Long, and H. Fan, “A Fast Graph-Based
Alternative Wiring Scheme for Boolean Networks,” Proc.
IEEE/ACM International VLSI Design 2000, pp. 268-273, Jan. 2000,
Calcutta. (received Honorable Mention Award)
Y.L. Wu, H. Fan, and C. K. Wong, “On Thin Boolean
Functions and Related Optimal OBDD Ordering,” Proc.
IEEE International Conference on Computer Design (ICCD), pp.
216-218, Oct. 1998, Austin.