default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShashank K. Mehta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c25]Shashank K. Mehta, Mahesh Sreekumar Rajasree:
On the bases of Zn lattice. SYNASC 2022: 100-107- 2020
- [j11]Pawan Aurora
, Shashank K. Mehta:
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation. J. Comb. Optim. 40(3): 590-609 (2020)
2010 – 2019
- 2019
- [c24]Shahbaz Khan, Shashank K. Mehta:
Depth First Search in the Semi-streaming Model. STACS 2019: 42:1-42:16 - [i4]Shahbaz Khan, Shashank K. Mehta:
Depth First Search in the Semi-streaming Model. CoRR abs/1901.03689 (2019) - 2018
- [j10]Pawan Aurora, Shashank K. Mehta:
The QAP-polytope and the graph isomorphism problem. J. Comb. Optim. 36(3): 965-1006 (2018) - [i3]Shashank K. Mehta, Mahesh Sreekumar Rajasree, Rajendra Kumar:
Maximum Distance Sub-Lattice Problem. CoRR abs/1811.03019 (2018) - 2016
- [j9]Pawan Aurora, Sumit Singh, Shashank K. Mehta:
Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs. J. Comb. Optim. 32(1): 159-173 (2016) - 2014
- [c23]Pawan Aurora, Shashank K. Mehta:
A Geometric Approach to Graph Isomorphism. ISAAC 2014: 674-685 - [c22]Deepanjan Kesh, Shashank K. Mehta:
A Divide and Conquer Method to Compute Binomial Ideals. LATIN 2014: 648-659 - 2013
- [c21]Pawan Aurora, Sumit Singh, Shashank K. Mehta:
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. FAW-AAIM 2013: 24-35 - [i2]Shashank K. Mehta, Pawan Aurora:
Completely Positive formulation of the Graph Isomorphism Problem. CoRR abs/1301.2390 (2013) - 2012
- [i1]Pawan Aurora, Sumit Singh, Shashank K. Mehta:
Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds. CoRR abs/1212.3889 (2012) - 2011
- [j8]Deepanjan Kesh, Shashank K. Mehta:
A saturation algorithm for homogeneous binomial ideals. ACM Commun. Comput. Algebra 45(1/2): 121-122 (2011) - [c20]Deepanjan Kesh, Shashank K. Mehta:
A Saturation Algorithm for Homogeneous Binomial Ideals. COCOA 2011: 357-371 - 2010
- [j7]Deepanjan Kesh, Shashank K. Mehta:
Generalized Reduction to Compute toric ideals. Discret. Math. Algorithms Appl. 2(1): 45-60 (2010)
2000 – 2009
- 2009
- [j6]Chandan K. Dubey, Shashank K. Mehta:
Critically indecomposable graphs. Discret. Appl. Math. 157(1): 149-163 (2009) - [c19]Deepanjan Kesh, Shashank K. Mehta:
Generalized Reduction to Compute Toric Ideals. ISAAC 2009: 483-492 - 2008
- [c18]Surender Baswana, Shashank K. Mehta, Vishal Powar:
Implied Set Closure and Its Application to Memory Consistency Verification. CAV 2008: 94-106 - [c17]Deepanjan Kesh, Shashank K. Mehta:
Polynomial irreducibility testing through Minkowski summand computation. CCCG 2008 - 2007
- [c16]Jian Kang, Sharad C. Seth, Shashank K. Mehta:
Symbolic Path Sensitization Analysis and Applications. ATS 2007: 439-444 - 2006
- [c15]Chandan K. Dubey, Shashank K. Mehta:
On Indecomposability Preserving Elimination Sequences. COCOON 2006: 42-51 - [c14]Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta:
Algorithms on Graphs with Small Dominating Targets. ISAAC 2006: 141-152 - 2005
- [j5]Chandan K. Dubey, Shashank K. Mehta:
Some Algorithms on Conditionally Critical Indecomposable Graphs. Electron. Notes Discret. Math. 22: 315-319 (2005) - [c13]Chandan K. Dubey, Shashank K. Mehta, Jitender S. Deogun:
Conditionally Critical Indecomposable Graphs. COCOON 2005: 690-700 - [c12]Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun:
Domination Search on Graphs with Low Dominating-Target-Number. WG 2005: 28-37 - 2004
- [c11]Ahmed M. Mahdy, Jitender S. Deogun, Shashank K. Mehta:
Broadband Optical Wireless Internet: Delay Optimization. BROADNETS 2004: 736-738 - [c10]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: 102-108 - [c9]Ahmed M. Mahdy, Jitender S. Deogun, Shashank K. Mehta:
End-to-End Delay Heuristics for Adaptive Optical Wireless Networks. MASCOTS 2004: 383-390 - 2003
- [j4]Hailong Cui, Sharad C. Seth, Shashank K. Mehta:
Modeling Fault Coverage of Random Test Patterns. J. Electron. Test. 19(3): 271-284 (2003) - [c8]George Nagy, Sharad C. Seth, Shashank K. Mehta, Yu Lin:
Indirect Symbolic Correlation Approach to Unsegmented Text Recognition. CVPR Workshops 2003: 22 - 2002
- [c7]Hailong Cui, Sharad C. Seth, Shashank K. Mehta:
A Novel Method to Improve the Test Efficiency of VLSI Tests. ASP-DAC/VLSI Design 2002: 499-504 - 2001
- [c6]Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr:
Design Verification and Functional Testing of FiniteState Machines. VLSI Design 2001: 189-195 - 2000
- [c5]Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr:
Exploiting don't cares to enhance functional tests. ITC 2000: 538-546
1990 – 1999
- 1999
- [j3]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): 1780-1792 (1999) - [c4]Shashank K. Mehta, Sharad C. Seth:
Empirical Computation of Reject Ratio in VLSI Testing. VLSI Design 1999: 506-511 - 1998
- [c3]Kent L. Einspahr, Shashank K. Mehta, Sharad C. Seth:
Synthesis of Sequential Circuits with Clock Control to Improve Testability. Asian Test Symposium 1998: 472- - 1997
- [c2]Shashank K. Mehta, Kent L. Einspahr, Sharad C. Seth:
Synthesis for Testability by Two-Clock Control. VLSI Design 1997: 279-283 - 1993
- [j2]Shashank K. Mehta, Laszlo Fulop:
An analog neural network to solve the hamiltonian cycle problem. Neural Networks 6(6): 869-881 (1993) - 1991
- [j1]Shashank K. Mehta, Maharaj Mukherjee, George Nagy:
Constrained Integer Approximation to Planar Line Intersection. Inf. Process. Lett. 40(3): 137-139 (1991) - 1990
- [c1]Shashank K. Mehta, Laszlo Fulop:
A neural algorithm to solve the Hamiltonian cycle problem. IJCNN 1990: 843-849
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
