Generalized reduction to compute toric ideals", (with Deepanjan Kesh), Discrete Mathematics, Algorithms and Applications, World Scientic Publishing Company, vol 2(1), pp 45-59, 2010.
Critically Indecomposable Graphs", (with Chandan Dubey) Discrete Applied Mathematics, Elsevier, 157, 149-163, 2009.
Polynomial Irreducibility Testing through Minkowski Summand Computation", (with Deepanjan Kesh), 20th Canadian Conference on Computational Geometry (CCCG'08), McGill University, Montreal, Canada, 13-15 August 2008.
Domination Search in Graphs with Low Dominating Target Number", (with Divesh Aggarwal and Jitender Singh Deogun) 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Metz, France, 23-25 June, 2005; LNCS 3787, pp 28-37.
A Synthesis for Testability Scheme for Finite State Machines Using Clock Control" (with S. Seth and K Einspahr), IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, Vol 18, No. 12, December 1999, pp 1780-1792.