A neural algorithm to solve the Hamiltonian cycle problem. - Shashank K. Mehta; Laszlo Fulop (IJCNN, 1990)

Constrained Integer Approximation to Planar Line Intersection. - Shashank K. Mehta; Maharaj Mukherjee; George Nagy (Inf. Process. Lett., 1991)

An analog neural network to solve the hamiltonian cycle problem. - Shashank K. Mehta; Laszlo Fulop (Neural Networks, 1993)

Synthesis for Testability by Two-Clock Control. - Shashank K. Mehta; Kent L. Einspahr; Sharad C. Seth (VLSI Design, 1997)

Synthesis of Sequential Circuits with Clock Control to Improve Testability. - Kent L. Einspahr; Shashank K. Mehta; Sharad C. Seth (Asian Test Symposium, 1998)

Empirical Computation of Reject Ratio in VLSI Testing. - Shashank K. Mehta; Sharad C. Seth (VLSI Design, 1999)

A synthesis for testability scheme for finite state machines using clock control. - Kent L. Einspahr; Shashank K. Mehta; Sharad C. Seth (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999)

Exploiting don't cares to enhance functional tests. - Mark W. Weiss; Sharad C. Seth; Shashank K. Mehta; Kent L. Einspahr (ITC, 2000)

Design Verification and Functional Testing of FiniteState Machines. - Mark W. Weiss; Sharad C. Seth; Shashank K. Mehta; Kent L. Einspahr (VLSI Design, 2001)

A Novel Method to Improve the Test Efficiency of VLSI Tests. - Hailong Cui; Sharad C. Seth; Shashank K. Mehta (ASP-DAC/VLSI Design, 2002)

Indirect Symbolic Correlation Approach to Unsegmented Text Recognition. - George Nagy; Sharad C. Seth; Shashank K. Mehta; Yu Lin (CVPR Workshops, 2003)

Modeling Fault Coverage of Random Test Patterns. - Hailong Cui; Sharad C. Seth; Shashank K. Mehta (J. Electron. Test., 2003)

Broadband Optical Wireless Internet: Delay Optimization. - Ahmed M. Mahdy; Jitender S. Deogun; Shashank K. Mehta (BROADNETS, 2004)

A nonparametric classifier for unsegmented text. - George Nagy; Ashutosh Joshi; Mukkai S. Krishnamoorthy; Yu Lin; Daniel P. Lopresti; Shashank K. Mehta; Sharad C. Seth (DRR, 2004)

End-to-End Delay Heuristics for Adaptive Optical Wireless Networks. - Ahmed M. Mahdy; Jitender S. Deogun; Shashank K. Mehta (MASCOTS, 2004)

Conditionally Critical Indecomposable Graphs. - Chandan K. Dubey; Shashank K. Mehta; Jitender S. Deogun (COCOON, 2005)

Domination Search on Graphs with Low Dominating-Target-Number. - Divesh Aggarwal; Shashank K. Mehta; Jitender S. Deogun (WG, 2005)

Some Algorithms on Conditionally Critical Indecomposable Graphs. - Chandan K. Dubey; Shashank K. Mehta (Electron. Notes Discret. Math., 2005)

On Indecomposability Preserving Elimination Sequences. - Chandan K. Dubey; Shashank K. Mehta (COCOON, 2006)

Algorithms on Graphs with Small Dominating Targets. - Divesh Aggarwal; Chandan K. Dubey; Shashank K. Mehta (ISAAC, 2006)

Symbolic Path Sensitization Analysis and Applications. - Jian Kang; Sharad C. Seth; Shashank K. Mehta (ATS, 2007)

Implied Set Closure and Its Application to Memory Consistency Verification. - Surender Baswana; Shashank K. Mehta; Vishal Powar (CAV, 2008)

Polynomial irreducibility testing through Minkowski summand computation. - Deepanjan Kesh; Shashank K. Mehta (CCCG, 2008)

Critically indecomposable graphs. - Chandan K. Dubey; Shashank K. Mehta (Discret. Appl. Math., 2009)

Generalized Reduction to Compute toric ideals. - Deepanjan Kesh; Shashank K. Mehta (Discret. Math. Algorithms Appl., 2010)

A saturation algorithm for homogeneous binomial ideals. - Deepanjan Kesh; Shashank K. Mehta (ACM Commun. Comput. Algebra, 2011)

Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. - Pawan Aurora; Sumit Singh 002; Shashank K. Mehta (FAW-AAIM, 2013)

Completely Positive formulation of the Graph Isomorphism Problem - Shashank K. Mehta; Pawan Aurora (CoRR, 2013)

A Geometric Approach to Graph Isomorphism. - Pawan Aurora; Shashank K. Mehta (ISAAC, 2014)

A Divide and Conquer Method to Compute Binomial Ideals. - Deepanjan Kesh; Shashank K. Mehta (LATIN, 2014)

Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs. - Pawan Aurora; Sumit Singh 002; Shashank K. Mehta (J. Comb. Optim., 2016)

Maximum Distance Sub-Lattice Problem. - Shashank K. Mehta; Mahesh Sreekumar Rajasree; Rajendra Kumar 002 (CoRR, 2018)

The QAP-polytope and the graph isomorphism problem. - Pawan Aurora; Shashank K. Mehta (J. Comb. Optim., 2018)

Depth First Search in the Semi-streaming Model. - Shahbaz Khan 004; Shashank K. Mehta (STACS, 2019)

A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation. - Pawan Aurora; Shashank K. Mehta (J. Comb. Optim., 2020)

On the bases of Zn lattice. - Shashank K. Mehta; Mahesh Sreekumar Rajasree (SYNASC, 2022)

On the Maximum Distance Sublattice Problem and Closest Vector Problem. - Rajendra Kumar 002; Shashank K. Mehta; Mahesh Sreekumar Rajasree (SYNASC, 2024)