The careful introduction of cut inferences can be used to structure and possibly compress formal sequent calculus proofs. This pa- per presents CIRes, an algorithm for the introduction of atomic cuts based on various modifications and improvements of the CERes method, which was originally devised for efficient cut-elimination. It is also demonstrated that CIRes is capable of compressing proofs, and the amount of compres- sion is shown to be exponential in the length of proofs.