show that special case of NP-complete problem is also NP-complete?
"Are there any general guidelines for how to do this?"

Frequently, one does that by reducing from the general case to the special case.

Otherwise, being a special case of a known NP-complete problem isn't really helpful for that.

How would one go about showing this?

Due to dynamic programming, one would prove ​ P = NP .