Narayan Vikas

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon	2020-05-26	Paper
Computational complexity relationship between compaction, vertex-compaction, and retraction Journal of Discrete Algorithms	2019-01-18	Paper
Computational complexity relationship between compaction, vertex-compaction, and retraction Lecture Notes in Computer Science	2018-06-15	Paper
Algorithms for partition of some class of graphs under compaction and vertex-compaction Algorithmica	2013-11-11	Paper
Algorithms for partition of some class of graphs under compaction Lecture Notes in Computer Science	2011-08-17	Paper
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results Journal of Computer and System Sciences	2005-12-07	Paper
Computing and Combinatorics Lecture Notes in Computer Science	2005-06-15	Paper
Compaction, Retraction, and Constraint Satisfaction SIAM Journal on Computing	2005-02-21	Paper
Computational complexity of compaction to irreflexive cycles Journal of Computer and System Sciences	2004-08-10	Paper
scientific article; zbMATH DE number 1953111 (Why is no real title available?)	2003-07-25	Paper
Computational Complexity of Compaction to Reflexive Cycles SIAM Journal on Computing	2003-06-19	Paper
scientific article; zbMATH DE number 1305547 (Why is no real title available?)	2000-01-25	Paper
An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism Journal of Computer and System Sciences	1996-11-27	Paper

Research outcomes over time

This page was built for person: Narayan Vikas