1. Graph bisection algorithms with good average case behavior;Bui;Combinatorica,1987
2. Improving the performance of the Kernighan–Lin and simulated annealing graph bisection algorithms;Bui;Proc. 26th Design Automation Conf.,1989
3. Parallel algorithms for partitioning simple classes of graphs;Bui;Proc. 1990 Internat. Conf. on Parallel Processing,1990
4. Partitioning planar graphs;Bui;SIAM J. Comput.,1992
5. Some simplified NP-complete graph problems;Garey;Theoret. Comput. Sci.,1976