1. Recent directions in netlist partitioning: a survey;Alpert;Integr. VLSI J.,1995
2. Differential greedy for the 0–1 equicut problem;Battiti,1997
3. Greedy, prohibition, and reactive heuristics for graph-partitioning;Battiti;IEEE Trans. Comput.,1999
4. Randomized greedy algorithms for the hypergraph partitioning problem;Battiti,1998
5. S.L. Bezrukov, Edge isoperimetric problems on graphs, in: L. Lovász, A. Gyarfas, G.O.H. Katona, A. Recski, L. Szekely (Eds.), Graph Theory and Combinatorial Biology, Bolyai Society of Mathematical Studies, vol. 7, Budapest, 1999, pp. 157–197.