| Solving geometric TSP with ants | 2 | 0.42 | 2005 |
| An Ant System Algorithm For Graph Bisection | 3 | 0.40 | 2002 |
| GRCA: a hybrid genetic algorithm for circuit ratio-cut partitioning | 9 | 0.56 | 1998 |
| Genetic Algorithm and Graph Partitioning | 136 | 7.41 | 1996 |
| On Multi-Dimensional Encoding/Crossover | 23 | 1.35 | 1995 |
| A Hybrid Genetic Algorithm for the Maximum Clique Problem | 19 | 1.86 | 1995 |
| A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs | 13 | 2.31 | 1994 |
| Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata | 12 | 1.23 | 1994 |
| A new genetic approach for the traveling salesman problem | 25 | 1.90 | 1994 |
| Hyperplane Synthesis for Genetic Algorithms | 18 | 2.27 | 1993 |
| A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem. | 8 | 1.05 | 1993 |
| A Heuristic for Reducing Fill-In in Sparse Matrix Factorization | 108 | 20.04 | 1993 |
| Partitioning planar graphs | 23 | 5.78 | 1992 |
| Finding good approximate vertex and edge partitions is NP-hard | 140 | 8.39 | 1992 |
| Parallel Algorithms for Partitioning Simple Classes of Graphs | 2 | 1.16 | 1990 |
| Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms | 62 | 12.50 | 1989 |
| Graph bisection algorithms with good average case behavior | 166 | 60.82 | 1987 |
| A note on an improved bisection algorithm | 0 | 0.34 | 1980 |
