Narayan Vikas Computational complexity of compaction to irreflexive cycles. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:68, n:3, pp:473-496 [Journal]

Narayan Vikas A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:4, pp:406-439 [Journal]

Narayan Vikas An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:53, n:1, pp:1-9 [Journal]

Narayan Vikas Computational Complexity of Compaction to Reflexive Cycles. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:32, n:1, pp:253-280 [Journal]