An Improved Upper Bound for the Subarray Partial Concentrators. - Xiao-Dong Hu 001; Frank K. Hwang (Discret. Appl. Math., 1992)

Reliabilities of chordal rings. - Xiao-Dong Hu 001; Frank Kwang-Ming Hwang (Networks, 1992)

Most reliable double loop networks in survival reliability. - Xiao-Dong Hu 001; Frank K. Hwang; Wen-Ch'ing Winnie Li (Networks, 1993)

Cutting Numbers for the Forward Loop Backward Hop Network. - Xiao-Dong Hu 001; Frank K. Hwang (Discret. Appl. Math., 1994)

A New Competitive Algorithm for the Counterfeit Coin Problem. - Xiao-Dong Hu 001; P. D. Chen; Frank K. Hwang (Inf. Process. Lett., 1994)

Exact reliabilities of most reliable double-loop networks. - Frank K. Hwang; Paul E. Wright; Xiao-Dong Hu 001 (Networks, 1997)

On shortest two-connected Steiner networks with Euclidean distance. - D. Frank Hsu; Xiao-Dong Hu 001 (Networks, 1998)

The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables. - Sui-Xiang Gao; Weili Wu 001; Ding-Zhu Du; Xiao-Dong Hu 001 (J. Complex., 1999)

On Rearrangeability of Multirate Clos Networks. - Guo-Hui Lin; Ding-Zhu Du; Xiao-Dong Hu 001; Guoliang Xue (SIAM J. Comput., 1999)

Nontrivial Monotone Weakly Symmetric Boolean Functions with Six Variables are Elusive. - Sui-Xiang Gao; Xiao-Dong Hu 001; Weili Wu 001 (Theor. Comput. Sci., 1999)

A new wavelength assignment method for minimal wavelength conversions in WDM networks. - Xiaohua Jia; Ding-Zhu Du; Xiao-Dong Hu 001; Hejiao Huang; Deying Li 001 (ICCCN, 2000)

Optimal Placement of Proxies of Replicated Web Servers in the Internet. - Xiaohua Jia; Deying Li 001; Xiao-Dong Hu 001; Hejiao Huang; Ding-Zhu Du (WISE, 2000)

On shortest three-edge-connected Steiner networks with Euclidean distance. - D. Frank Hsu; Xiao-Dong Hu 001 (Discret. Appl. Math., 2000)

On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces. - D. Frank Hsu; Xiao-Dong Hu 001; Guo-Hui Lin (Graphs Comb., 2000)

On Shortest k-Edge-Connected Steiner Networks in Metric Spaces. - Xiufeng Du; Xiao-Dong Hu 001; Xiaohua Jia (J. Comb. Optim., 2000)

Minimizing number of wavelengths in multicast routing trees in WDM networks. - Deying Li 001; Xiufeng Du; Xiao-Dong Hu 001; Lu Ruan 001; Xiaohua Jia (Networks, 2000)

Placement of Read-Write Web Proxies in the Internet. - Xiaohua Jia; Deying Li 001; Xiao-Dong Hu 001; Ding-Zhu Du (ICDCS, 2001)

Optimal Placement of Web Proxies for Replicated Web Servers in the Internet. - Xiaohua Jia; Deying Li 001; Xiao-Dong Hu 001; Ding-Zhu Du (Comput. J., 2001)

Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks. - Xiaohua Jia; Ding-Zhu Du; Xiao-Dong Hu 001 (Comput. Commun., 2001)

Monotone Routing in Multirate Rearrangeable Clos Networks. - Xiao-Dong Hu 001; Xiaohua Jia; Ding-Zhu Du; Frank K. Hwang (J. Parallel Distributed Comput., 2001)

Placement of Data Replicas for Optimal Data Availability in Ring Networks. - Xiao-Dong Hu 001; Xiaohua Jia; Ding-Zhu Du; Deying Li 001; Hejiao Huang (J. Parallel Distributed Comput., 2001)

Converter Placement Supporting Broadcast in WDM Optical Networks. - Lu Ruan 001; Ding-Zhu Du; Xiao-Dong Hu 001; Xiaohua Jia; Deying Li 001; Zheng Sun (IEEE Trans. Computers, 2001)

Optimization of wavelength assignment for QoS multicast in WDM networks. - Xiaohua Jia; Ding-Zhu Du; Xiao-Dong Hu 001; Man-Kei Lee; Jun Gu (IEEE Trans. Commun., 2001)

Approximations for Steiner trees with minimum number of Steiner points. - Donghui Chen; Ding-Zhu Du; Xiao-Dong Hu 001; Guo-Hui Lin; Lusheng Wang 001; Guoliang Xue (Theor. Comput. Sci., 2001)

Wire segmenting for buffer insertion based on RSTP-MSP. - Bing Lu; Jun Gu; Xiao-Dong Hu 001; Eugene Shragowitz (Theor. Comput. Sci., 2001)

Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks. - Xiaohua Jia; Ding-Zhu Du; Xiao-Dong Hu 001; Hejiao Huang; Deying Li 001 (INFOCOM, 2002)

Rivest-Vuillemin conjecture is true for monotone boolean functions with twelve variables. - Sui-Xiang Gao; Ding-Zhu Du; Xiao-Dong Hu 001; Xiaohua Jia (Discret. Math., 2002)

Multicast routing, load balancing, and wavelength assignment on tree of rings. - Xiaohua Jia; Xiao-Dong Hu 001; Lu Ruan 001; Jianhua Sun (IEEE Commun. Lett., 2002)

Algorithms for multicast connection under multi-path routing model. - Jun Gu; Xiao-Dong Hu 001; Mu-Hong Zhang (Inf. Process. Lett., 2002)

Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet. - Xiaohua Jia; Deying Li 001; Xiao-Dong Hu 001; Weili Wu 001; Ding-Zhu Du (Comput. J., 2003)

On the optimal placement of wavelength converters in WDM networks. - Xiaohua Jia; Ding-Zhu Du; Xiao-Dong Hu 001; Hejiao Huang; Deying Li 001 (Comput. Commun., 2003)

Multicast Routing and Wavelength Assignment in WDM Networks with Limited Drop-offs. - Xiao-Dong Hu 001; Xiaohua Jia; Tianping Shuai; Mu-Hong Zhang (INFOCOM, 2004)

Optimal Data Replica Placements in Linear Bus Networks. - D. Frank Hsu; Xiao-Dong Hu 001; Hejiao Huang; Xiaohua Jia (ISPAN, 2004)

An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design. - Yin Wang; Xianlong Hong; Tong Jing; Yang Yang 040; Xiaodong Hu 001; Guiying Yan (PATMOS, 2004)

Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks. - Xiaohua Jia; David Hongwei Du; Xiao-Dong Hu 001; Deying Li 001 (Comput. Commun., 2004)

Routing algorithm for multicast under multi-tree model in optical networks. - Jun Gu; Xiao-Dong Hu 001; Xiaohua Jia; Mu-Hong Zhang (Theor. Comput. Sci., 2004)

Complexity of Minimal Tree Routing and Coloring. - Xujin Chen; Xiao-Dong Hu 001; Xiaohua Jia (AAIM, 2005)

Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks. - Xiao-Dong Hu 001; Tianping Shuai (AAIM, 2005)

Via-Aware Global Routing for Good VLSI Manufacturability and High Yield. - Yang Yang 040; Tong Jing; Xianlong Hong; Yu Hu 002; Qi Zhu 002; Xiaodong Hu 001; Guiying Yan (ASAP, 2005)

An-OARSMan: obstacle-avoiding routing tree construction with good length performance. - Yu Hu 002; Tong Jing; Xianlong Hong; Zhe Feng 002; Xiaodong Hu 001; Guiying Yan (ASP-DAC, 2005)

The polygonal contraction heuristic for rectilinear Steiner tree construction. - Yin Wang; Xianlong Hong; Tong Jing; Yang Yang 040; Xiaodong Hu 001; Guiying Yan (ASP-DAC, 2005)

Rotational Steiner Ratio Problem Under Uniform Orientation Metrics. - Songpu Shang; Xiaodong Hu 001; Tong Jing (CJCDGCGT, 2005)

Routing and Coloring for Maximal Number of Trees. - Xujin Chen; Xiao-Dong Hu 001; Tianping Shuai (COCOON, 2005)

Minimum Data Aggregation Time Problem in Wireless Sensor Networks. - Xujin Chen; Xiaodong Hu 001; Jianming Zhu (MSN, 2005)

A Routing Paradigm with Novel Resources Estimation and Routability Models for X-Architecture Based Physical Design. - Yu Hu 002; Tong Jing; Xianlong Hong; Xiaodong Hu 001; Guiying Yan (SAMOS, 2005)

Connected Set Cover Problem and Its Applications. - Tianping Shuai; Xiao-Dong Hu 001 (AAIM, 2006)

Energy Efficient Protocols for Information Dissemination in Wireless Sensor Networks. - Dandan Liu; Xiaodong Hu 001; Xiaohua Jia (APWeb Workshops, 2006)

DraXRouter: global routing in X-Architecture with dynamic resource assignment. - Zhen Cao; Tong Jing; Yu Hu 002; Yiyu Shi 001; Xianlong Hong; Xiaodong Hu 001; Guiying Yan (ASP-DAC, 2006)

Average lengths of wire routing under M-architecture and X-architecture. - S. P. Shang; Xiaodong Hu 001; Tong Jing (ISCAS, 2006)

An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane. - Zhe Feng 002; Yu Hu 002; Tong Jing; Xianlong Hong; Xiaodong Hu 001; Guiying Yan (ISPD, 2006)

Minimum Multicast Time Problem in Wireless Sensor Networks. - Jianming Zhu; Xujin Chen; Xiaodong Hu 001 (WASA, 2006)

Edge-bipancyclicity of star graphs under edge-fault tolerant. - Min Xu 005; Xiao-Dong Hu 001; Qiang Zhu 003 (Appl. Math. Comput., 2006)

Energy efficient routing and scheduling for real-time data aggregation in WSNs. - Hongwei Du 001; Xiaodong Hu 001; Xiaohua Jia (Comput. Commun., 2006)

Energy efficient information dissemination protocols by negotiation for wireless sensor networks. - Dandan Liu; Xiaodong Hu 001; Xiaohua Jia (Comput. Commun., 2006)

Inapproximability and approximability of maximal tree routing and coloring. - Xujin Chen; Xiaodong Hu 001; Tianping Shuai (J. Comb. Optim., 2006)

ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm. - Yu Hu 002; Tong Jing; Zhe Feng 002; Xianlong Hong; Xiaodong Hu 001; Guiying Yan (J. Comput. Sci. Technol., 2006)

A Min-Max Relation on Packing Feedback Vertex Sets. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (Math. Oper. Res., 2006)

The Minimum Risk Spanning Tree Problem. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (COCOA, 2007)

Algorithms for Minimum m -Connected k -Dominating Set Problem. - Weiping Shang; F. Frances Yao; Peng-Jun Wan; Xiaodong Hu 001 (COCOA, 2007)

On the Minimum Risk-Sum Path Problem. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (ESCAPE, 2007)

The Roman Domination Problem in Unit Disk Graphs. - Weiping Shang; Xiaodong Hu 001 (International Conference on Computational Science (3), 2007)

New Algorithm for Minimum Multicast Time Problem in Wireless Sensor Networks. - Jianming Zhu; Weiping Shang; Xiaodong Hu 001 (WCNC, 2007)

Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes. - Min Xu 005; Xiao-Dong Hu 001; Jun-Ming Xu 001 (Appl. Math. Comput., 2007)

On the restricted forwarding index problem in communication networks. - Min Xu 005; Xujin Chen; Xiaodong Hu 001 (Comput. Math. Appl., 2007)

Energy efficient multicast routing in ad hoc wireless networks. - Deying Li 001; Qin Liu 003; Xiaodong Hu 001; Xiaohua Jia (Comput. Commun., 2007)

A Min-Max Theorem on Tournaments. - Xujin Chen; Xiaodong Hu 001; Wenan Zang (SIAM J. Comput., 2007)

lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity. - Tom Tong Jing; Zhe Feng 002; Yu Hu 002; Xianlong Hong; Xiaodong Hu 001; Guiying Yan (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007)

Algorithms for minimum m-connected k-tuple dominating set problem. - Weiping Shang; Peng-Jun Wan; F. Frances Yao; Xiaodong Hu 001 (Theor. Comput. Sci., 2007)

Steiner tree problems in computer communication networks. - Ding-Zhu Du; Xiaodong Hu 001 (World Scientific, 2008)

Identifying codes of cycles with odd orders. - Min Xu 005; Krishnaiyan Thulasiraman; Xiao-Dong Hu 001 (Eur. J. Comb., 2008)

A full-scale solution to the rectilinear obstacle-avoiding Steiner problem. - Tom Tong Jing; Yu Hu 002; Zhe Feng 002; Xianlong Hong; Xiaodong Hu 001; Guiying Yan (Integr., 2008)

On minimum m -connected k -dominating set problem in unit disc graphs. - Weiping Shang; F. Frances Yao; Peng-Jun Wan; Xiaodong Hu 001 (J. Comb. Optim., 2008)

Inapproximability and approximability of minimal tree routing and coloring. - Xujin Chen; Xiaodong Hu 001; Xiaohua Jia (J. Discrete Algorithms, 2008)

Improved Algorithm for Minimum Data Aggregation Time Problem in Wireless Sensor Networks. - Jianming Zhu; Xiaodong Hu 001 (J. Syst. Sci. Complex., 2008)

A new model for path planning with interval data. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (Comput. Oper. Res., 2009)

A polynomial solvable minimum risk spanning tree problem with interval data. - Xujin Chen; Jie Hu 009; Xiaodong Hu 001 (Eur. J. Oper. Res., 2009)

Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks. - Xujin Chen; Xiaodong Hu 001; Jianming Zhu (Int. J. Distributed Sens. Networks, 2009)

Conditional Diagnosability of Matching Composition Networks Under the PMC Model. - Min Xu 005; Krishnaiyan Thulasiraman; Xiao-Dong Hu 001 (IEEE Trans. Circuits Syst. II Express Briefs, 2009)

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. - Eduardo Álvarez-Miranda; Alfredo Candia-Véjar; Xujin Chen; Xiaodong Hu 001; Bi Li 004 (AAIM, 2010)

Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations. - Xujin Chen; Xiaodong Hu 001; Weidong Ma (COCOA (2), 2010)

Recent Advances in Computation and Combinatorial Optimization. - Xiaodong Hu 001; Jie Wang (Algorithmica, 2010)

Roman domination and its Variants in Unit Disk Graphs. - Weiping Shang; Xiumei Wang; Xiaodong Hu 001 (Discret. Math. Algorithms Appl., 2010)

The price of atomic selfish ring routing. - Bo Chen 002; Xujin Chen; Xiaodong Hu 001 (J. Comb. Optim., 2010)

The conditional diagnosability of shuffle-cubes. - Min Xu 005; Xiaodong Hu 001; Songpu Shang (J. Syst. Sci. Complex., 2010)

Approximation algorithm for minimal convergecast time problem in wireless sensor networks. - Weiping Shang; Peng-Jun Wan; Xiaodong Hu 001 (Wirel. Networks, 2010)

Preface. - Xiaodong Hu 001; Jie Wang (J. Comb. Optim., 2011)

Deterministic risk control for cost-effective network connections. - Eduardo Álvarez-Miranda; Xujin Chen; Jie Hu 009; Xiaodong Hu 001; Alfredo Candia-Véjar (Theor. Comput. Sci., 2011)

Preface. - Ding-Zhu Du; Xiaodong Hu 001; Panos M. Pardalos (Theor. Comput. Sci., 2011)

Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines. - Xujin Chen; Xiaodong Hu 001; Weidong Ma; Changjun Wang (COCOA, 2012)

A New Proof for Zassenhaus-Groemer-Oler inequality. - Qinghai Liu; Xiang Li 010; Lidong Wu; Hai Du; Zhao Zhang 002; Weili Wu 001; Xiaodong Hu 001; Yinfeng Xu (Discret. Math. Algorithms Appl., 2012)

The Maximum-Weight Stable Matching Problem: Duality and Efficiency. - Xujin Chen; Guoli Ding; Xiaodong Hu 001; Wenan Zang (SIAM J. Discret. Math., 2012)

Pairwise cooperations in selfish ring routing for minimax linear latency. - Xujin Chen; Xiaodong Hu 001; Weidong Ma (Theor. Comput. Sci., 2012)

On the union of intermediate nodes of shortest paths. - Xiang Li 010; Xiaodong Hu 001; Wonjun Lee 001 (J. Comb. Optim., 2013)

Reducing price of anarchy of selfish task allocation with more selfishness. - Xujin Chen; Xiaodong Hu 001; Weidong Ma; Changjun Wang (Theor. Comput. Sci., 2013)

Approximability of the Minimum Weighted Doubly Resolving Set Problem. - Xujin Chen; Xiaodong Hu 001; Changjun Wang (CoRR, 2014)

Enumeration of digraph embeddings. - Yichao Chen; Jonathan L. Gross; Xiaodong Hu 001 (Eur. J. Comb., 2014)

The Price of Anarchy for Selfish Ring Routing is Two. - Xujin Chen; Benjamin Doerr; Carola Doerr; Xiaodong Hu 001; Weidong Ma; Rob van Stee (ACM Trans. Economics and Comput., 2014)

New Mechanism for Reservation in Cloud Computing. - Changjun Wang; Weidong Ma; Tao Qin 001; Feidiao Yang; Tie-Yan Liu; Xujin Chen; Xiao-Dong Hu 001 (AAMAS, 2015)

Pricing in Social Networks with Negative Externalities. - Zhigang Cao 002; Xujin Chen; Xiaodong Hu 001; Changjun Wang (CSoNet, 2015)

Selling Reserved Instances in Cloud Computing. - Changjun Wang; Weidong Ma; Tao Qin 001; Xujin Chen; Xiaodong Hu 001; Tie-Yan Liu (IJCAI, 2015)

Excluding Braess's Paradox in Nonatomic Selfish Routing. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001 (SAGT, 2015)

Finding Connected Dense k -Subgraphs. - Xujin Chen; Xiao-Dong Hu 001; Changjun Wang (TAMC, 2015)

Balancing Load via Small Coalitions in Selfish Ring Routing Games. - Xujin Chen; Xiao-Dong Hu 001; Weidong Ma (Asia Pac. J. Oper. Res., 2015)

Total Dual Integrality of Triangle Covering. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001; Zhongzheng Tang (COCOA, 2016)

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001; Zhongzheng Tang (IWOCA, 2016)

Efficient Mechanism Design for Online Scheduling. - Xujin Chen; Xiaodong Hu 001; Tie-Yan Liu; Weidong Ma; Tao Qin 001; Pingzhong Tang; Changjun Wang; Bo Zheng (J. Artif. Intell. Res., 2016)

Network Characterizations for Excluding Braess's Paradox. - Xujin Chen; Zhuo Diao; Xiaodong Hu 001 (Theory Comput. Syst., 2016)

Approximation for the minimum cost doubly resolving set problem. - Xujin Chen; Xiao-Dong Hu 001; Changjun Wang (Theor. Comput. Sci., 2016)

Algorithms for the Ring Star Problem. - Xujin Chen; Xiaodong Hu 001; Zhongzheng Tang; Chenhao Wang 001; Ying Zhang (COCOA (2), 2017)

Efficient Mechanism Design for Online Scheduling (Extended Abstract). - Xujin Chen; Xiaodong Hu 001; Tie-Yan Liu; Weidong Ma; Tao Qin 001; Pingzhong Tang; Changjun Wang; Bo Zheng (IJCAI, 2017)

Continuous Firefighting on Infinite Square Grids. - Xujin Chen; Xiaodong Hu 001; Changjun Wang; Ying Zhang (TAMC, 2017)

Finding connected k-subgraphs with high density. - Xujin Chen; Xiaodong Hu 001; Changjun Wang (Inf. Comput., 2017)

A novel feed-forward segmented digital automatic gain control algorithm for long-term evolution digital radio-over-fibre systems. - Jie Wang; Xiao-Dong Hu 001; Enyi Guan; Tongyun Li; ZhuShun Ding; Yidong Yao (IET Commun., 2017)

Approximation algorithms for pricing with negative network externalities. - Zhigang Cao 002; Xujin Chen; Xiaodong Hu 001; Changjun Wang (J. Comb. Optim., 2017)

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance. - Xujin Chen; Xiaodong Hu 001; Xiaohua Jia; Minming Li; Zhongzheng Tang; Chenhao Wang 001 (SAGT, 2018)

The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty. - Xujin Chen; Xiaodong Hu 001; Chenhao Wang 001 (SAGT, 2018)

Covering Triangles in Edge-Weighted Graphs. - Xujin Chen; Zhuo Diao; Xiaodong Hu 001; Zhongzheng Tang (Theory Comput. Syst., 2018)

The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler. - Xujin Chen; Xiaodong Hu 001; Xiaoying Wu (COCOA, 2019)

2-Level Station Location for Bike Sharing. - Fengmin Wang; Xiaodong Hu 001; Chenchen Wu (AAIM, 2020)

Sequential Location Game on Continuous Directional Star Networks. - Xujin Chen; Xiaodong Hu 001; Mengqi Zhang (Complexity and Approximation, 2020)

The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler. - Xujin Chen; Xiaodong Hu 001; Chenhao Wang 001; Xiaoying Wu (Theor. Comput. Sci., 2020)

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. - Xujin Chen; Xiaodong Hu 001; Zhongzheng Tang; Chenhao Wang 001 (Inf. Process. Lett., 2021)

Algorithms for the metric ring star problem with fixed edge-cost ratio. - Xujin Chen; Xiao-Dong Hu 001; Xiaohua Jia; Zhongzheng Tang; Chenhao Wang 001; Ying Zhang (J. Comb. Optim., 2021)

On weak Pareto optimality of nonatomic routing networks. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001 (J. Comb. Optim., 2022)

Data Placement and Transmission Scheduling for coded multicast in mobile edge networks. - Zhongzheng Tang; Nuo Yu; Xiaohua Jia; Xiaodong Hu 001 (Comput. Commun., 2023)

When does additional information lead to longer travel time in multi-origin-destination networks? - Xujin Chen; Xiaodong Hu 001; Xinqi Jing; Zhongzheng Tang (CoRR, 2024)

Algorithms for maximum social welfare of online random trading. - Xujin Chen; Xiaodong Hu 001; Chenhao Wang 001; Xiaoying Wu; Mengqi Zhang (Discret. Appl. Math., 2024)

Mixed Graph Covering with Target Constraints. - Xujin Chen; Xiyuan Deng; Xiao-Dong Hu 001; Changjun Wang (IJTCS-FAW, 2025)