Applying a Hopfield-style network to degraded text recognition. - Arun Jagota (IJCNN, 1990)

Approximately solving Maximum Clique using neural network and related heuristics. - Arun Jagota; Laura A. Sanchis; Ravikanth Ganesan (Cliques, Coloring, and Satisfiability, 1993)

On the equivalence of two Hopfield-type networks. - Tal Grossman; Arun Jagota (ICNN, 1993)

Optimization by reduction to maximum clique. - Arun Jagota (ICNN, 1993)

Contextual word recognition with a Hopfield-style net. - Arun Jagota (Neural Parallel Sci. Comput., 1994)

Approximating maximum clique with a Hopfield network. - Arun Jagota (IEEE Trans. Neural Networks, 1995)

Good Rings in Grids with Bad Nodes. - Brenton Chapin; Arun Jagota (PDPTA, 1996)

Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem. - Laura A. Sanchis; Arun Jagota (INFORMS J. Comput., 1996)

A New Deterministic Annealing Algorithm for Maximum Clique. - Arun Jagota; Marcello Pelillo; Anand Rangarajan 001 (IJCNN (6), 2000)

Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique. - Arun Jagota; Laura A. Sanchis (J. Heuristics, 2001)

Energy function-based approaches to graph coloring. - Andrea Di Blas; Arun Jagota; Richard Hughey (IEEE Trans. Neural Networks, 2002)

A Range-Compaction Heuristic for Graph Coloring. - Andrea Di Blas; Arun Jagota; Richard Hughey (J. Heuristics, 2003)

Optimizing neural networks on SIMD parallel computers. - Andrea Di Blas; Arun Jagota; Richard Hughey (Parallel Comput., 2005)