Thang N. Bui
Information
Education
Current Research Interests
 Genetic Algorithms
 Ant Systems
 Evolutionary Computation
 Combinatorial Optimization
 Graph Algorithms
Selected Publications

Bui, T. N., X. Deng, C. M. Zrncic,

``An Improved AntBased Algorithm for the DegreeConstrained Minimum Spanning
Tree Problem,'' IEEE Transactions on Evolutionary Computation, Volume
16, Issue 2, 2012, pp. 266278

Bui, T. N., T. H. Nguyen, and J. R. Rizzo Jr.,

``Parallel Shared Memory Strategies for AntBased Optimization Algorithms,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2009), ACM Press, Seattle, July 2009, pp. 18.
(received the best paper award in the Ant Colony Optimization and Swarm Intelligence Track)

Bui, T. N., T. H. Nguyen, C. M. Patel, and K. T. Phan,

``An AntBased Algorithm for Coloring Graphs,''
Discrete Applied Mathematics, Volume 156, Issue 2, 15 January 2008, pp. 190200.

Bui, T. N. and T. H. Nguyen,

``An AgentBased Algorithm for Generalized Graph Colorings,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2006), ACM Press, Seattle, July 2006, pp. 1926.

Bui, T. N. and C. M. Zrncic,

``An AntBased Algorithm for Finding DegreeConstrained Minimum Spanning Tree,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2006), ACM Press, Seattle, July 2006, pp. 1118.
(received the best paper award in the Ant Colony Optimization and Swarm Intelligence Track)

Bui, T. N. and G. Sundarraj,

``An Efficient Genetic Algorithm for Predicting Protein Tertiary Structures in the 2D HP Model,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2005), ACM Press, Washington DC, June 2005, pp. 385392.

Bui, T. N. and M. Colpan

``Solving Geometric TSP with Ants,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2005), ACM Press, Washington DC, June 2005, pp. 271272.

Bui, T. N. and W. A. Youssef,

``An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with
Positive and Negative Errors,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2004), Seattle, June 2004,
Lecture Notes in Computer Science, Vol. 3103, SpringerVerlag Heidelberg, pp. 908919.
(received the best paper award in the Real World Applications Track)

Bui, T. N. and G. Sundarraj,

``Ant System for the $k$Cardinality Tree Problem,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2004), Seattle, June 2004,
Lecture Notes in Computer Science, Vol. 3102, SpringerVerlag Heidelberg, pp. 3647.

Bui, T. N. and J. R. Rizzo,

``Finding Maximum Cliques with Distributed Ants,''
Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO 2004), Seattle, June 2004,
Lecture Notes in Computer Science, Vol. 3102, SpringerVerlag Heidelberg, pp. 2435.

Bui, T. N. and L. C. Strite,

``An Ant System Algorithm for Graph Bisection,''
GECCO 2002: Proceedings of the Genetic and Evolutionary Computation
Conference, W. B. Langdon et al. (Eds.), pp. 4351, Morgan Kaufman
Publishers, 2002.

Bui, T. N.,

``Graph Partitioning,''
Encyclopedia of Optimization, edited by C. A. Floudas and
P. M. Pardalos, Kluwer Academic Publishers, June 2001,
Vol. 2, pp. 362368.

Bui, T. N. and B. R. Moon,

``GRCA: A Hybrid Genetic Algorithm for Circuit RatioCut Partitioning,''
IEEE Trans. on Computer Aided Design, Vol. 17, No. 3, March
1998, pp. 193204.

Bui, T. N. and B. R. Moon,

``Genetic Algorithms and Graph Partitioning,''
IEEE Transactions on Computers, Vol. 45, No. 7, July 1996, pp. 841855.

Bui, T. N. and B. R. Moon,

``On Multidimensional Encoding/Crossover,''
Proceedings of the Sixth International Conference on Genetic Algorithms
(ICGA6), July 1995, pp. 4956.

Bui, T. N. and P. H. Eppley,

``A Hybrid Genetic Algorithm for the Maximum Clique Problem,''
Proceedings of the Sixth International Conference on Genetic Algorithms
(ICGA6), July 1995, pp. 478484.

Bui, T. N. and B. R. Moon,

``Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered
Schemata,'' Proceedings of the Third International
Conference on Parallel Problem Solving from Nature, Lecture Notes in
Computer Science #866, October 1994, pp. 108118.

Bui, T. N. and B. R. Moon,

``A New Genetic Approach for the Traveling Salesman Problem,'' Proceedings of
the First IEEE Conference on Evolutionary Computation, June 1994, pp. 712.

Bui, T. N. and B. R. Moon,

``A Fast and Stable Hybrid Genetic Algorithm for the RatioCut
Partitioning Problem on Hypergraphs,'' Proceedings of the IEEE/ACM 31st Design
Automation Conference (DAC'94), June 1994, pp. 664669.

Bui, T. N. and B. R. Moon,
``Hyperplane Synthesis for Genetic Algorithms,'' Proc. of the Fifth

International Conference on Genetic Algorithms (ICGA93), July 1993, pp.
102109.

Bui, T. N. and B. R. Moon,

``Genetic Algorithms for a Special Class of Quadratic Assignment
Problem,'' invited paper, The Quadratic Assignment and
Related Problems, DIMACS (Center for Discrete Math and Computer Science)
Series in Discrete Mathematics and Theoretical Computer Science, Volume 16,
Edited by P. M. Pardalos and H. Wolkowicz, 1994, pp. 99116.

Bui, T. N. and C. Jones,

``A Heuristic for Reducing FillIn in Sparse Matrix Factorization,''
Proc. of the 6th Society for Industrial and Applied Mathematics (SIAM)
Conference on Parallel Processing for Scientific Computing, Norfolk,
Virginia, March 1993, pp. 445452.

Bui, T. N., W. Hsu and S. L. Lee,

``A 2.5 Approximation Algorithm for the MultiVia Assignment
Problem,''
IEEE Transactions on CAD of Integrated Circuits and Systems, 11(11),
Nov. 1992, pp. 13251333.

Bui, T. N. and C. Jones,

``Finding Good Approximate Vertex and Edge Partitions Is NPhard,''
Information Processing Letters, 42, May 1992, pp. 153159.

Bui, T. N. and A. Peck,

``Partitioning Planar Graphs,''
SIAM Journal of Computing, 21(2), April 1992, pp. 203215.

Bui, T. N. and U. Prabhu,

``Reconfigurable Embeddings of a MultiDimensional Mesh in a
Hypercube,''
Proceedings of the 28th Annual Allerton Conference on Communication,
Control and Computing, 1990, pp. 226235.

Bui, T. N. and C. Jones,

``Parallel Algorithms for Partitioning Simple Classes of Graphs,''
Proceedings of the 19th International Conference on Parallel
Processing, 1990, Volume III, pp. 150153.

Bui, T. N., S. Chaudhuri, F. T. Leighton, and M. Sipser,

``Graph Bisection Algorithms with Good Average Case Behavior,''
Combinatorica, 7(2), 1987, pp. 171191.