1. A. A. Benczúr, On the structure of near-minimum edge cuts, Technical report MIT/LCS/TR-639 (1994).
2. A. A. Benczúr, A representation of cuts witihin 6/5 times the edge connectivity with applications, in: Proc. 34th Annual Symp. on Found. of Comp. Sci. (1995), pages 92–102.
3. A. A. Benczúr, Cut Structures and Randomized Algorithms in Edge-Connectivity Problems, Ph.D. Thesis, M.I.T. (1997).
4. Y. Dinitz E. A. Dinits, A. V. Karzanov and M. L. Lomonosov, On the Structure of a Family of MinimalWeighted Cuts in a Graph, in: Studies in Discrete Optimization (in Russian), A. A. Fridman (Ed), Nauka, Moscow (1976), pages 290–306.
5. Y. Dinitz and Z. Nutov, A 2-level cactus model for the minimum and minimum+1 edge-cuts in a graph and its incremental maintenance, in: Proc. of the 27th Symposium on Theory of Computing (1995), pages 509–518.