Efficient parallel algorithms for some graph theory problems. - Jun Ma 001; Shaohan Ma (J. Comput. Sci. Technol., 1993)

Two Notes on Low-Density Subset Sum Algorithms. - Daxing Li; Shaohan Ma (ISAAC, 1994)

Analysis of the Convergency of Topology Preserving Neural Networks on Learning. - Daming Zhu; Shaohan Ma; Hongze Qiu (ISAAC, 1994)

An O(k 2n2) algorithm to find a k -partition in a k -connected graph. - Jun Ma 001; Shaohan Ma (J. Comput. Sci. Technol., 1994)

A practical propositional knowledge base revision algorithm. - Xuehong Tao; Wei Sun; Shaohan Ma (J. Comput. Sci. Technol., 1997)

An efficient parallel graph edge matching algorithm and its applications. - Jun Ma 001; Shaohan Ma (J. Comput. Sci. Technol., 1999)

A Practical Algorithm for the Minimum Rectilinear Steiner Tree. - Jun Ma 001; Bo Yang 005; Shaohan Ma (J. Comput. Sci. Technol., 2000)

Efficient Mining of Association Rules by Reducing the Number of Passes over the Database. - Qingzhong Li; Haiyang Wang; Zhongmin Yan; Shaohan Ma (J. Comput. Sci. Technol., 2001)

Hardness and Methods to Solve CLIQUE. - Daming Zhu; Junfeng Luan; Shaohan Ma (J. Comput. Sci. Technol., 2001)

An O(N2) algorithm for signed translocation problem. - Lusheng Wang 001; Daming Zhu; Xiaowen Liu; Shaohan Ma (APBC, 2005)

An O(n2) algorithm for signed translocation. - Lusheng Wang 001; Daming Zhu; Xiaowen Liu; Shaohan Ma (J. Comput. Syst. Sci., 2005)

A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem. - Guohui Yao; Daming Zhu; Hengwu Li; Shaohan Ma (Discret. Math., 2008)

Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems. - Daming Zhu; Shaohan Ma; Pingping Zhang (COCOON, 2011)

Identification of a G-protein coupled receptor-related gene signature through bioinformatics analysis to construct a risk model for ovarian cancer prognosis. - Shaohan Ma; Ruyue Li; Guangqi Li; Meng Wei; Bowei Li; Yongmei Li; Chunfang Ha (Comput. Biol. Medicine, 2024)