N. Vikas

发表

Computational complexity of graph compaction

P. Hell, N. Vikas, 1997 .

Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction

Narayan Vikas, N. Vikas, 2017, IWOCA.

Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction

N. Vikas, 2013, Algorithmica.

Compaction, Retraction, and Constraint Satisfaction

Narayan Vikas, N. Vikas, 2004, SIAM J. Comput..

Connected and Loosely Connected List Homomorphisms

Narayan Vikas, N. Vikas, 2002, WG.

Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon

Narayan Vikas, N. Vikas, 2017, MFCS.

Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction

Narayan Vikas, N. Vikas, 2011, Algorithmica.

A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

Narayan Vikas, N. Vikas, 2005, J. Comput. Syst. Sci..

Computational Complexity Classification of Partition under Compaction and Retraction

Narayan Vikas, N. Vikas, 2004, COCOON.

Computational complexity of compaction to irreflexive cycles

Narayan Vikas, N. Vikas, 2004, J. Comput. Syst. Sci..

Computational Complexity of Compaction to Reflexive Cycles

NARAYAN VIKAS, N. Vikas, 2002, SIAM J. Comput..

Computational complexity of compaction to cycles

Narayan Vikas, N. Vikas, 1999, SODA '99.