Narayan Vikas

Publication Activity (10 Years)

Years Active: 1996-2018
Publications (10 Years): 3

Top Topics

Undirected Graph

Maximum Cardinality

High Computational Complexity

Top Venues

J. Discrete Algorithms

Publications

Narayan Vikas
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction. J. Discrete Algorithms (2018)
Narayan Vikas
Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon. MFCS (2017)
Narayan Vikas
Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction. IWOCA (2017)
Narayan Vikas
Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction. Algorithmica 67 (2) (2013)
Narayan Vikas
Algorithms for Partition of Some Class of Graphs under Compaction. COCOON (2011)
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. J. Comput. Syst. Sci. 71 (4) (2005)
Narayan Vikas
Compaction, Retraction, and Constraint Satisfaction. SIAM J. Comput. 33 (4) (2004)
Narayan Vikas
Computational complexity of compaction to irreflexive cycles. J. Comput. Syst. Sci. 68 (3) (2004)
Narayan Vikas
Computational Complexity Classification of Partition under Compaction and Retraction. COCOON (2004)
Narayan Vikas
Computational Complexity of Compaction to Reflexive Cycles. SIAM J. Comput. 32 (1) (2002)
Narayan Vikas
Connected and Loosely Connected List Homomorphisms. WG (2002)
Narayan Vikas
Computational Complexity of Compaction to Cycles. SODA (1999)
Narayan Vikas
An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism. J. Comput. Syst. Sci. 53 (1) (1996)