Literature around NP vs EXPTIME Even if it isn't a crucial point, I don't see any literature around this question. Are there relativisation results ?

Wouldn't it be quite straightforward to prove strict inclusion by adapting non-deterministic time hierarchy theorem by exploring all possible paths of the NP machine ?
The Complexity Zoo says: 

... There exist oracles relative to which $EXP=NP=ZPP$ [Hel84a], [Hel84b], [Kur85], [Hel86],....

See for example Two oracles that force a big crunch.

Perhaps the original oracle used by Dekhtyar is less powerful (and simpler): On the relativization of deterministic and nondeterministic complexity classes in Proc. Mathematical Foundations of CS 1977 ... but I don't have his paper.