1. Agrawal, A., Klein, P.N., and Ravi, R., 1993. “Cutting down on fill using nested dissection: Provably good elimination orderings,” in Graph Theory and Sparse Matrix Computation, A. George, J.R. Gilbert, and J.W.H. Liu, eds., IMA Volumes in Mathematics and its Applications 56, Springer Verlag, Berlin, pp. 31–55.
2. Alon, N. and Milman, V., 1985. “λ1, isoperimetric inequalities for graphs, and superconcentrators,” J. of Combin. Theory, Series B 38, pp. 73–88.
3. Alpert, C.J. and Kahng, A., 1995. “Recent directions in netlist partitioning: A survey,” Integration: The VLSI Journal 19, pp. 1–81.
4. Arun, K.S. and Rao, V.B., 1993. “Constructive heuristics and lower bounds for graph partitioning based on a principal components approximation,” SIAM J. Matrix Anal. Appl. 14, pp. 991–1015.
5. Ashcraft, C. and Liu, J.W.H., 1995. “Using domain decomposition to find graph bisectors,” Tech. Report CS-95-08, Department of Computer Science, York University, North York, Ontario, Canada, M3J 1P3.