Optimization theory with applications
Optimization theory with applications
Least-Squares Fitting of Two 3-D Point Sets
IEEE Transactions on Pattern Analysis and Machine Intelligence
An optimal algorithm for geometrical congruence
Journal of Algorithms
Congruence, similarity and symmetries of geometric objects
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Journal of Computational Chemistry
Conformational searching methods for small molecules I: study of the SYBYL SEARCH method
Journal of Computational Chemistry
Randomized algorithms
Random networks in configuration space for fast path planning
Random networks in configuration space for fast path planning
Combinatorial and experimental results for randomized point matching algorithms
Proceedings of the twelfth annual symposium on Computational geometry
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A perturbation scheme for spherical arrangements with application to molecular modeling
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Geometric Manipulation of Flexible Ligands
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
On the Approximation of Largest Common Subtrees and Largest Common Point Sets
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Approximation Algorithms for the Largest Common Subtree Problem.
Approximation Algorithms for the Largest Common Subtree Problem.
Algorithms for finding zeros and extrema of functions without calculatingderivatives
Algorithms for finding zeros and extrema of functions without calculatingderivatives
A perturbation scheme for spherical arrangements with application to molecular modeling
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Geometric pattern matching: a performance study
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximate congruence in nearly linear time
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximate congruence in nearly linear time
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Handbook of data mining and knowledge discovery
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Mining protein family specific residue packing patterns from protein structure graphs
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Efficient colored point set matching under noise
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Noisy colored point set matching
Discrete Applied Mathematics
Fast matching of large point sets under occlusions
Pattern Recognition
Improved approximation bounds for planar point pattern matching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
An efficient approximation algorithm for point pattern matching under noise
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |