Hongbing Fan

Hongbing Fan, Yu-Liang Wu, Ray C. C. Cheung: Design Automation Framework for Reconfigurable Interconnection Networks. Comput. J. 56(2): 258-269 (2013)

Hongbing Fan, Yue-Ang Chen, Yu-Liang Wu: R-NoC: An Efficient Packet-Switched Reconfigurable Networks-on-Chip. ARC 2012: 365-371

Fu-Shing Chim, Tak-Kei Lam, Yu-Liang Wu, Hongbing Fan: On Structural Analysis and Efficiency for Graph-Based Rewiring Techniques. IEICE Transactions 94-A(12): 2853-2865 (2011)

Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung: Design Automation for Reconfigurable Interconnection Networks. ARC 2010: 244-256

Hongbing Fan, Yu-Liang Wu: Structured Overlay Network for File Distribution. COCOA (2) 2010: 292-302

Hongbing Fan, Yu-Liang Wu: A New Approach for Rearrangeable Multicast Switching Networks. COCOA 2009: 384-394

Hongbing Fan, Christian Hundt, Yu-Liang Wu, Jason Ernst: Algorithms and Implementation for Interconnection Graph Problem. COCOA 2008: 201-210

Hongbing Fan, Yu-Liang Wu: Interconnection Graph Problem. FCS 2008: 51-55

Hongbing Fan, Jason Ernst, Yu-Liang Wu: Customized Reconfigurable Interconnection Networks for multiple application SOCS. FPL 2008: 491-494

Hongbing Fan, Jiping Liu, Yu-Liang Wu, Chak-Chung Cheung: The exact channel density and compound design for generic universal switch blocks. ACM Trans. Design Autom. Electr. Syst. 12(2) (2007)

Hongbing Fan, Yu-Liang Wu, Ray Chak-Chung Cheung, Jiping Liu: Decomposition Design Theory and Methodology for Arbitrary-Shaped Switch Boxes. IEEE Trans. Computers 55(4): 373-384 (2006)

Hongbing Fan, Robert Kalbfleisch: An Edge Ordering Problem of Regular Hypergraphs. COCOON 2006: 368-377

Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005)

Hongbing Fan, Yu-Liang Wu: Crossbar based design schemes for switch boxes and programmable interconnection networks. ASP-DAC 2005: 910-915

John A. Ellis, Hongbing Fan, Michael R. Fellows: The dominating set problem is fixed parameter tractable for graphs of bounded genus. J. Algorithms 52(2): 152-168 (2004)

Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jiping Liu: On Optimal Irregular Switch Box Designs. FPL 2004: 189-199

Hongbing Fan, Jiping Liu, Yu-Liang Wu: General Models and a Reduction Design Technique for FPGA Switch Box Designs. IEEE Trans. Computers 52(1): 21-30 (2003)

Hongbing Fan, Jiping Liu, Yu-Liang Wu, Chak-Chung Cheung: On optimal hyperuniversal and rearrangeable switch box designs. IEEE Trans. on CAD of Integrated Circuits and Systems 22(12): 1637-1649 (2003)

Yu-Liang Wu, Chak-Chung Cheung, David Ihsin Cheng, Hongbing Fan: Further improve circuit partitioning using GBAW logic perturbation techniques. IEEE Trans. VLSI Syst. 11(3): 451-460 (2003)

Jiping Liu, Hongbing Fan, Yu-Liang Wu: On improving FPGA routability applying multi-level switch boxes. ASP-DAC 2003: 366-369

John A. Ellis, Hongbing Fan, Jeffrey Shallit: The Cycles of the Multiway Perfect Shuffle Permutation. Discrete Mathematics & Theoretical Computer Science 5(1): 169-180 (2002)

Hongbing Fan, Yu-Liang Wu, Yao-Wen Chang: Comment on Generic Universal Switch Blocks. IEEE Trans. Computers 51(1): 93-96 (2002)

Hongbing Fan, Jiping Liu, Yu-Liang Wu, C. K. Wong: Reduction design for generic universal switch blocks. ACM Trans. Design Autom. Electr. Syst. 7(4): 526-546 (2002)

Hongbing Fan, Jiping Liu, Yu-Liang Wu, Chak-Chung Cheung: On Optimum Designs of Universal Switch Blocks. FPL 2002: 142-151

John A. Ellis, Hongbing Fan, Michael R. Fellows: The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. SWAT 2002: 180-189

Hongbing Fan, Yu-Liang Wu, C. K. Wong: On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks. Graphs and Combinatorics 17(2): 213-225 (2001)

Hongbing Fan, Jiping Liu, Yu-Liang Wu: Combinatorial routing analysis and design of universal switch blocks. ASP-DAC 2001: 641-644

Hongbing Fan, Jiping Liu, Yu-Liang Wu, Chak-Chung Cheung: On Optimum Switch Box Designs for 2-D FPGAs. DAC 2001: 203-208

Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege: Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122

John A. Ellis, Tobias Krahn, Hongbing Fan: Computing the cycles in the perfect shuffle permutation. Inf. Process. Lett. 75(5): 217-224 (2000)

Yu-Liang Wu, Hongbing Fan, Malgorzata Marek-Sadowska, C. K. Wong: OBDD Minimization Based on Two-Level Representation of Boolean Functions. IEEE Trans. Computers 49(12): 1371-1379 (2000)

Hongbing Fan, Jiping Liu, Yu-Liang Wu: General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs. ICCAD 2000: 93-98

Yu-Liang Wu, Wangning Long, Hongbing Fan: A Fast Graph-Based Alternative Wiring Scheme for Boolean Networks. VLSI Design 2000: 268-273

Hongbing Fan, Xuding Zhu: Oriented walk double covering and bidirectional double tracing. Journal of Graph Theory 29(2): 89-102 (1998)

Yu-Liang Wu, Hongbing Fan, C. K. Wong: On thin Boolean functions and related optimum OBDD ordering. ICCD 1998: 216-218

Baogang Xu, Hongbing Fan: On the fixed edge of planar graphs with minimum degree five. Discrete Mathematics 152(1-3): 325-328 (1996)