  This paper shows how to derive nested calculi from labelled calculi for
propositional intuitionistic logic and first-order intuitionistic logic with
constant domains, thus connecting the general results for labelled calculi with
the more refined formalism of nested sequents. The extraction of nested calculi
from labelled calculi obtains via considerations pertaining to the elimination
of structural rules in labelled derivations. Each aspect of the extraction
process is motivated and detailed, showing that each nested calculus inherits
favorable proof-theoretic properties from its associated labelled calculus.
