| 2005 |
|---|
| 8 | EE | 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): 406-439 (2005) |
| 2004 |
|---|
| 7 | EE | Narayan Vikas:
Computational Complexity Classification of Partition under Compaction and Retraction.
COCOON 2004: 380-391 |
| 6 | EE | Narayan Vikas:
Computational complexity of compaction to irreflexive cycles.
J. Comput. Syst. Sci. 68(3): 473-496 (2004) |
| 5 | EE | Narayan Vikas:
Compaction, Retraction, and Constraint Satisfaction.
SIAM J. Comput. 33(4): 761-782 (2004) |
| 2002 |
|---|
| 4 | EE | Narayan Vikas:
Connected and Loosely Connected List Homomorphisms.
WG 2002: 399-412 |
| 3 | EE | Narayan Vikas:
Computational Complexity of Compaction to Reflexive Cycles.
SIAM J. Comput. 32(1): 253-280 (2002) |
| 1999 |
|---|
| 2 | EE | Narayan Vikas:
Computational Complexity of Compaction to Cycles.
SODA 1999: 977-978 |
| 1996 |
|---|
| 1 | | 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): 1-9 (1996) |
