Shaohan Ma

According to our database1, Shaohan Ma authored at least 13 papers between 1993 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2008
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem.
Discret. Math., 2008

2005
An <i>O</i>(<i>n</i><sup>2</sup>) algorithm for signed translocation.
J. Comput. Syst. Sci., 2005

An O(N<sup>2</sup>) algorithm for signed translocation problem.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2001
Hardness and Methods to Solve CLIQUE.
J. Comput. Sci. Technol., 2001

Efficient Mining of Association Rules by Reducing the Number of Passes over the Database.
J. Comput. Sci. Technol., 2001

2000
A Practical Algorithm for the Minimum Rectilinear Steiner Tree.
J. Comput. Sci. Technol., 2000

1999
An efficient parallel graph edge matching algorithm and its applications.
J. Comput. Sci. Technol., 1999

1997
A practical propositional knowledge base revision algorithm.
J. Comput. Sci. Technol., 1997

1994
An <i>O(k</i> <sup>2</sup>n<sup>2</sup>) algorithm to find a <i>k</i> -partition in a <i>k</i> -connected graph.
J. Comput. Sci. Technol., 1994

Analysis of the Convergency of Topology Preserving Neural Networks on Learning.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Two Notes on Low-Density Subset Sum Algorithms.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Efficient parallel algorithms for some graph theory problems.
J. Comput. Sci. Technol., 1993


  Loading...