1. Battiti R, Bertossi A (1998) Differential Greedy for the 0-1 equicut problem. In Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location. Princeton, NJ, pp 3–21
2. Battiti R, Bertossi A (1997) Greedy and prohibition-based heuristics for graph-partitioning. Dip. di Matematica, Univ. di Trento, Italy, Technical Report UTM 512
3. Battiti R, Bertossi A, Cappelleti A (1999) Multilevel Reactive Tabu Search for Graph Partitioning. Dip. di Matematica, Univ. Trento, Italy, Technical Report UTM 554
4. Bui T, Chaudhuri S, Leigthon F, Sipser M (1987) Graph bisection algorithms with good average case behavior. Combinatorica 7(2):122–125
5. Bui TN, Moon BR (1996) Genetic Algorithm and Graph Partitioning. IEEE Trans Comput 45:841–855