Thang Nguyen Bui

发表

Partitioning Planar Graphs

Andrew M. Peck, Thang Nguyen Bui, Andrew Peck, 1992, SIAM J. Comput..

Finding Good Approximate Vertex and Edge Partitions is NP-Hard

Curt Jones, Thang Nguyen Bui, T. N. Bui, 1992, Inf. Process. Lett..

An Ant System Algorithm For Graph Bisection

Thang Nguyen Bui, Lisa C. Strite, 2002, GECCO.

GRCA: a hybrid genetic algorithm for circuit ratio-cut partitioning

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Hyperplane Synthesis for Genetic Algorithms

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1993, ICGA.

An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors

Waleed A. Youssef, Thang Nguyen Bui, T. N. Bui, 2004, GECCO.

Graph Bisection Algorithms with Good Average Case Behavior

Frank Thomson Leighton, Soma Chaudhuri, Michael Sipser, 1984, FOCS.

A Note on an Improved Bisection Algorithm

Thang Nguyen Bui, 1980, Inf. Process. Lett..

Graph bisection algorithms with good average case behavior

Frank Thomson Leighton, Soma Chaudhuri, Michael Sipser, 1984, Comb..

Graph bisection algorithms

Thang Nguyen Bui, 1986 .

Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1994, PPSN.

On Multi-Dimensional Encoding/Crossover

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1995, ICGA.

Genetic Algorithm and Graph Partitioning

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1996, IEEE Trans. Computers.

Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms

Frank Thomson Leighton, Curt Jones, Thang Nguyen Bui, 1989, 26th ACM/IEEE Design Automation Conference.

A Hybrid Genetic Algorithm for the Maximum Clique Problem

Thang Nguyen Bui, Paul H. Eppley, T. N. Bui, 1995, ICGA.

A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1994, 31st Design Automation Conference.

An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

Xianghua Deng, Thang Nguyen Bui, Catherine M. Zrncic, 2012, IEEE Transactions on Evolutionary Computation.

A 2.5 approximation algorithm for the multi-via assignment problem

SingLing Lee, Thang Nguyen Bui, Willie Hsu, 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Ant System for the k-Cardinality Tree Problem

Gnanasekaran Sundarraj, Thang Nguyen Bui, T. N. Bui, 2004, GECCO.

A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1993, Quadratic Assignment and Related Problems.

A new genetic approach for the traveling salesman problem

Byung Ro Moon, Thang Nguyen Bui, T. N. Bui, 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

A Heuristic for Reducing Fill-In in Sparse Matrix Factorization

Curt Jones, Thang Nguyen Bui, T. N. Bui, 1993, PPSC.

An efficient genetic algorithm for predicting protein tertiary structures in the 2D HP model

Gnanasekaran Sundarraj, Thang Nguyen Bui, T. N. Bui, 2005, GECCO '05.

An agent-based algorithm for generalized graph colorings

ThanhVu Nguyen, Thang Nguyen Bui, T. N. Bui, 2006, GECCO.

Solving geometric TSP with ants

Thang Nguyen Bui, Mufit Colpan, 2005, GECCO '05.

Parallel shared memory strategies for ant-based optimization algorithms

ThanhVu Nguyen, Thang Nguyen Bui, Joseph R. Rizzo, 2009, GECCO '09.

An ant-based algorithm for coloring graphs

Chirag M. Patel, ThanhVu Nguyen, Thang Nguyen Bui, 2008, Discret. Appl. Math..

An ant-based algorithm for finding degree-constrained minimum spanning tree

Thang Nguyen Bui, Catherine M. Zrncic, T. N. Bui, 2006, GECCO.

Finding Maximum Cliques with Distributed Ants

Thang Nguyen Bui, Joseph R. Rizzo, T. N. Bui, 2004, GECCO.

Parallel Algorithms for Partitioning Simple Classes of Graphs

Curt Jones, Thang Nguyen Bui, T. N. Bui, 1990, ICPP.