I recently read the book: "The Algorithm Design Manual" by Skiena. Chapter 11 is a good resource for this line of inquiry concerning reductions/translations between problems and NP-Completeness.

I'm glad you got something out of 'The Algorithm Design Manual'. Alas, I found that book exceedingly fluffy.

Compare http://jeffe.cs.illinois.edu/teaching/algorithms/ perhaps for something more meaty.

Check out the course 6.042J from MIT (Mathematics for Computer Science).

https://ocw.mit.edu/courses/electrical-engineering-and-compu...

https://ccrma.stanford.edu/~jos https://www.dspguide.com https://www.willpirkle.com/about/books Musimathics Volumes 1 and 2