1. Alvarruiz Bermejo, F., Martínez Alzamora, F., Vidal Maciá, A.M.: Improving the efficiency of the loop method for the simulation of water distribution networks. J. Water Resour. Plan. Manag. 141(10), 1–10 (2015)
2. Benczúr, A.A., Karger, D.R.: Approximating $$s-t$$ minimum cuts in $$\tilde{O}(n^2)$$ time. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 47–55 (1996)
3. Bhatt, S., Chung, F., Leighton, T., Rosenberg, A.: Optimal simulations of tree machines. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 274–282 (1986)
4. Bodlaender, H., Fomin, F., Golovach, P., Otachi, Y., Leeuwen, E.: Parameterized complexity of the spanning tree congestion problem. Algorithmica 64, 1–27 (2012)
5. Bodlaender, H.L., Kozawa, K., Matsushima, T., Otachi, Y.: Spanning tree congestion of k-outerplanar graphs. Discret. Math. 311(12), 1040–1045 (2011)