Shashank K Mehta

Professor
Computer Science and Engineering Department
Indian Institute of Technology, Kanpur



My interest includes algorithms in graph theory, geometry, and commutative algebra.

Publications since 2005

• Deepanjan Kesh, S. K. Mehta, ``A Saturation Algorithm for Homogeneous Binomial Ideals", an extended abstract was presented in ISAAC2011 and published in ACM Comm. in Computer Algebra vol 45(1) Issue 176 June 2011. A complete version of the paper will be presented in COCOA2011, Zhangjiajie, China, 4-6 August 2011 which has appeared in LNCS 6831, pp 357-371.
• Deepanjan Kesh, S. K. Mehta, "Generalized Reduction to Compute Toric Ideals", ISAAC 2009, Honolulu, USA, 16-18 December 2009. An extended version is published in Discrete Mathematics, Algorithms and Applications, vol 2(1), pp 45-59, 2010.
• Chandan Dubey, S. K. Mehta, ``Critically Indecomposable Graphs", Discrete Applied Mathematics, Elsevier, 157 (2009), 149-163.
• Deepanjan Kesh, S. K. Mehta, "Polynomial Irreducibility Testing through Minkowski Summand Computation", 20th Canadian Conference on Computational Geometry (CCCG'08), McGill University, Montreal, Canada, 13-15 August 2008.
• S. Baswana, S. K. Mehta, Vishal Powar, "Implied Set Closure and Its Application to Memory Consistency Verification", 20th International Conference on Computer Aided Verification (CAV '08), Princeton NJ, USA, 9-12 July 2008; LNCS 5123 pp 94-106.
• Jian Kang, S. Seth, S. K. Mehta, "Symbolic Path Sensitization Analysis and Applications", Asian Test Symposium (ATS'07), 2007, Beijing, 8-11 October 2007.
• Divesh Aggarwal, Chandan Dubey, Shashank K. Mehta, "Algorithms on Graphs with Small Dominating Targets", ISAAC 2006, Kolkata, 18-20 December 2006; LNCS 4288 pp 141-152.
• C. K. Dubey, S. K. Mehta, "On Indecomposability Preserving Elimination Sequences", COCOON 2006, Taipei, Republic of China (Taiwan), 15-18 August 2006; LNCS 4112 pp 42-51.
• C. K. Dubey, S.K.Mehta, "Some Algorithms on Conditionally Critical Indecomposable Graphs", ICGT 2005; Electronic Notes in Discrete Mathematics Volume 22 pp 315-319.
• C. K. Dubey, S. K. Mehta, J. S. Deogun, "Conditionally Critical Indecomposable Graphs", COCOON 2005, Kunming, China, 16-19 August 2005; LNCS 3595 pp 690-700.
• D. Aggarwal, S. K. Mehta, J. S. Deogun, "Domination Search in Graphs with Low Dominating Target Number", WG2005, Metz, France, 23-25 June, 2005; LNCS 3787, pp 28-37.

To Faculty Page