Focusing is a general technique for transforming a sequent proof system into one with a syntactic separation of non-deterministic choices without sacrificing completeness. This not only improves proof search, but also has the representational benefit of distilling sequent proofs into synthetic normal forms. We show how to apply the focusing technique to nested sequent calculi, a generalization of ordinary sequent calculi to tree-like instead of list-like structures. We thus improve the reach of focusing to the most commonly studied modal logics, the logics of the modal S5 cube. Among our key contributions is a focused cut-elimination theorem for focused nested sequents. This is an extended version of a paper with the same title and authors that appears in the Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Eindhoven, Netherlands, 2-4 April 2016. This version contains full proofs of all the important lemmas and theorems.