Clustering with a Domain-Specific Distance Measure. - Steven Gold; Eric Mjolsness; Anand Rangarajan 001 (NIPS, 1993)

Softassign versus Softmax: Benchmarks in Combinatorial Optimization. - Steven Gold; Anand Rangarajan 001 (NIPS, 1995)

A Framework for Non-rigid Matching and Correspondence. - Suguna Pappu; Steven Gold; Anand Rangarajan 001 (NIPS, 1995)

Graph matching by graduated assignment. - Steven Gold; Anand Rangarajan 001 (CVPR, 1996)

Graduated assignment graph matching. - Steven Gold; Anand Rangarajan 001 (ICNN, 1996)

A Convergence Proof for the Softassign Quadratic Assignment Algorithm. - Anand Rangarajan 001; Alan L. Yuille; Steven Gold; Eric Mjolsness (NIPS, 1996)

A Novel Optimizing Network Architecture with Applications. - Anand Rangarajan 001; Steven Gold; Eric Mjolsness (Neural Comput., 1996)

Learning with Preknowledge: Clustering with Point and Graph Matching Distance Measures. - Steven Gold; Anand Rangarajan 001; Eric Mjolsness (Neural Comput., 1996)

A Graduated Assignment Algorithm for Graph Matching. - Steven Gold; Anand Rangarajan 001 (IEEE Trans. Pattern Anal. Mach. Intell., 1996)

New algorithms for 2D and 3D point matching: pose estimation and correspondence. - Steven Gold; Anand Rangarajan 001; Chien-Ping Lu; Suguna Pappu; Eric Mjolsness (Pattern Recognit., 1998)

Serious social games: Designing a business simulation game. - Matt Critelli; David I. Schwartz; Steven Gold (IGIC, 2012)