Shashank K. Mehta

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 7

Top Topics

Packing Problem

Graph Isomorphism

Arbitrary Shaped

Top Venues

J. Comb. Optim.

Publications

Shashank K. Mehta, Mahesh Sreekumar Rajasree
lattice. SYNASC (2022)
Pawan Aurora, Shashank K. Mehta
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation. J. Comb. Optim. 40 (3) (2020)
Shahbaz Khan, Shashank K. Mehta
Depth First Search in the Semi-streaming Model. STACS (2019)
Shahbaz Khan, Shashank K. Mehta
Depth First Search in the Semi-streaming Model. CoRR (2019)
Pawan Aurora, Shashank K. Mehta
The QAP-polytope and the graph isomorphism problem. J. Comb. Optim. 36 (3) (2018)
Shashank K. Mehta, Mahesh Sreekumar Rajasree, Rajendra Kumar
Maximum Distance Sub-Lattice Problem. CoRR (2018)
Pawan Aurora, Sumit Singh, Shashank K. Mehta
Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs. J. Comb. Optim. 32 (1) (2016)
Pawan Aurora, Shashank K. Mehta
A Geometric Approach to Graph Isomorphism. ISAAC (2014)
Deepanjan Kesh, Shashank K. Mehta
A Divide and Conquer Method to Compute Binomial Ideals. LATIN (2014)
Pawan Aurora, Sumit Singh, Shashank K. Mehta
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. FAW-AAIM (2013)
Shashank K. Mehta, Pawan Aurora
Completely Positive formulation of the Graph Isomorphism Problem CoRR (2013)
Pawan Aurora, Sumit Singh, Shashank K. Mehta
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds CoRR (2012)
Deepanjan Kesh, Shashank K. Mehta
A saturation algorithm for homogeneous binomial ideals. ACM Commun. Comput. Algebra 45 (1/2) (2011)
Deepanjan Kesh, Shashank K. Mehta
A Saturation Algorithm for Homogeneous Binomial Ideals. COCOA (2011)
Deepanjan Kesh, Shashank K. Mehta
Generalized Reduction to Compute toric ideals. Discret. Math. Algorithms Appl. 2 (1) (2010)
Chandan K. Dubey, Shashank K. Mehta
Critically indecomposable graphs. Discret. Appl. Math. 157 (1) (2009)
Deepanjan Kesh, Shashank K. Mehta
Generalized Reduction to Compute Toric Ideals. ISAAC (2009)
Surender Baswana, Shashank K. Mehta, Vishal Powar
Implied Set Closure and Its Application to Memory Consistency Verification. CAV (2008)
Deepanjan Kesh, Shashank K. Mehta
Polynomial irreducibility testing through Minkowski summand computation. CCCG (2008)
Jian Kang, Sharad C. Seth, Shashank K. Mehta
Symbolic Path Sensitization Analysis and Applications. ATS (2007)
Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta
Algorithms on Graphs with Small Dominating Targets. ISAAC (2006)
Chandan K. Dubey, Shashank K. Mehta
On Indecomposability Preserving Elimination Sequences. COCOON (2006)
Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
Domination Search on Graphs with Low Dominating-Target-Number. WG (2005)
Chandan K. Dubey, Shashank K. Mehta, Jitender S. Deogun
Conditionally Critical Indecomposable Graphs. COCOON (2005)
Chandan K. Dubey, Shashank K. Mehta
Some Algorithms on Conditionally Critical Indecomposable Graphs. Electron. Notes Discret. Math. 22 (2005)
George Nagy, Ashutosh Joshi, Mukkai S. Krishnamoorthy, Yu Lin, Daniel P. Lopresti, Shashank K. Mehta, Sharad C. Seth
A nonparametric classifier for unsegmented text. DRR (2004)
Ahmed M. Mahdy, Jitender S. Deogun, Shashank K. Mehta
Broadband Optical Wireless Internet: Delay Optimization. BROADNETS (2004)
Ahmed M. Mahdy, Jitender S. Deogun, Shashank K. Mehta
End-to-End Delay Heuristics for Adaptive Optical Wireless Networks. MASCOTS (2004)
George Nagy, Sharad C. Seth, Shashank K. Mehta, Yu Lin
Indirect Symbolic Correlation Approach to Unsegmented Text Recognition. CVPR Workshops (2003)
Hailong Cui, Sharad C. Seth, Shashank K. Mehta
Modeling Fault Coverage of Random Test Patterns. J. Electron. Test. 19 (3) (2003)
Hailong Cui, Sharad C. Seth, Shashank K. Mehta
A Novel Method to Improve the Test Efficiency of VLSI Tests. VLSI Design (2002)
Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr
Design Verification and Functional Testing of FiniteState Machines. VLSI Design (2001)
Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr
Exploiting don't cares to enhance functional tests. ITC (2000)
Kent L. Einspahr, Shashank K. Mehta, Sharad C. Seth
A synthesis for testability scheme for finite state machines using clock control. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18 (12) (1999)
Shashank K. Mehta, Sharad C. Seth
Empirical Computation of Reject Ratio in VLSI Testing. VLSI Design (1999)
Kent L. Einspahr, Shashank K. Mehta, Sharad C. Seth
Synthesis of Sequential Circuits with Clock Control to Improve Testability. Asian Test Symposium (1998)
Shashank K. Mehta, Kent L. Einspahr, Sharad C. Seth
Synthesis for Testability by Two-Clock Control. VLSI Design (1997)
Shashank K. Mehta, Laszlo Fulop
An analog neural network to solve the hamiltonian cycle problem. Neural Networks 6 (6) (1993)
Shashank K. Mehta, Maharaj Mukherjee, George Nagy
Constrained Integer Approximation to Planar Line Intersection. Inf. Process. Lett. 40 (3) (1991)
Shashank K. Mehta, Laszlo Fulop
A neural algorithm to solve the Hamiltonian cycle problem. IJCNN (1990)