Narayan Vikas - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2018

Computational Complexity Relationship between Compaction, Vertex-Compaction, and RetractionNarayan Vikas. jda, 52:168-181, 2018. [doi]

2017

Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive HexagonNarayan Vikas. mfcs 2017: [doi]

Computational Complexity Relationship between Compaction, Vertex-Compaction, and RetractionNarayan Vikas. iwoca 2018: 154-166 [doi]

2013

Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-CompactionNarayan Vikas. algorithmica, 67(2):180-206, 2013. [doi]

2011

Algorithms for Partition of Some Class of Graphs under CompactionNarayan Vikas. cocoon 2011: 319-330 [doi]

2005

A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general resultsNarayan Vikas. jcss, 71(4):406-439, 2005. [doi]

2004

Computational complexity of compaction to irreflexive cyclesNarayan Vikas. jcss, 68(3):473-496, 2004. [doi]

Computational Complexity Classification of Partition under Compaction and RetractionNarayan Vikas. cocoon 2004: 380-391 [doi]

Compaction, Retraction, and Constraint SatisfactionNarayan Vikas. SICOMP, 33(4):761-782, 2004. [doi]

2002

Connected and Loosely Connected List HomomorphismsNarayan Vikas. criwg 2002: 399-412 [doi]

Computational Complexity of Compaction to Reflexive CyclesNarayan Vikas. SICOMP, 32(1):253-280, 2002. [doi]

1999

Computational Complexity of Compaction to CyclesNarayan Vikas. soda 1999: 977-978 [doi]

1996

An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group IsomorphismNarayan Vikas. jcss, 53(1):1-9, 1996.

Sign in or sign up to see more results.

runs on WebDSL