Thang Nguyen Bui

30 papers A* 3A 7Journal 9Unranked 10
YearRankTypeTitle / Venue / Authors
2012 J jnl
An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
IEEE Trans. Evol. Comput.
Thang Nguyen Bui, Xianghua Deng, Catherine M. Zrncic
2009 A conf
Parallel shared memory strategies for ant-based optimization algorithms.
GECCO
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Rizzo
2008 J jnl
An ant-based algorithm for coloring graphs.
Discret. Appl. Math.
Thang Nguyen Bui, ThanhVu H. Nguyen, Chirag M. Patel, Kim-Anh T. Phan
2006 A conf
An agent-based algorithm for generalized graph colorings.
GECCO
Thang Nguyen Bui, ThanhVu H. Nguyen
2006 A conf
An ant-based algorithm for finding degree-constrained minimum spanning tree.
GECCO
Thang Nguyen Bui, Catherine M. Zrncic
2005 A conf
An efficient genetic algorithm for predicting protein tertiary structures in the 2D HP model.
GECCO
Thang Nguyen Bui, Gnanasekaran Sundarraj
2005 A conf
Solving geometric TSP with ants.
GECCO
Thang Nguyen Bui, Mufit Colpan
2004 — conf
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors.
GECCO (2)
Thang Nguyen Bui, Waleed A. Youssef
2004 — conf
Ant System for the k-Cardinality Tree Problem.
GECCO (1)
Thang Nguyen Bui, Gnanasekaran Sundarraj
2004 — conf
Finding Maximum Cliques with Distributed Ants.
GECCO (1)
Thang Nguyen Bui, Joseph R. Rizzo
2002 A conf
An Ant System Algorithm For Graph Bisection.
GECCO
Thang Nguyen Bui, Lisa C. Strite
1998 J jnl
GRCA: a hybrid genetic algorithm for circuit ratio-cut partitioning.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Thang Nguyen Bui, Byung Ro Moon
1996 J jnl
Genetic Algorithm and Graph Partitioning.
IEEE Trans. Computers
Thang Nguyen Bui, Byung Ro Moon
1995 — conf
A Hybrid Genetic Algorithm for the Maximum Clique Problem.
ICGA
Thang Nguyen Bui, Paul H. Eppley
1995 — conf
On Multi-Dimensional Encoding/Crossover.
ICGA
Thang Nguyen Bui, Byung Ro Moon
1994 A* conf
A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs.
DAC
Thang Nguyen Bui, Byung Ro Moon
1994 — conf
A New Genetic Approach for the Traveling Salesman Problem.
International Conference on Evolutionary Computation
Thang Nguyen Bui, Byung Ro Moon
1994 A conf
Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata.
PPSN
Thang Nguyen Bui, Byung Ro Moon
1993 — conf
A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem.
Quadratic Assignment and Related Problems
Thang Nguyen Bui, Byung Ro Moon
1993 — conf
A Heuristic for Reducing Fill-In in Sparse Matrix Factorization.
PPSC
Thang Nguyen Bui, Curt Jones
1993 — conf
Hyperplane Synthesis for Genetic Algorithms.
ICGA
Thang Nguyen Bui, Byung Ro Moon
1992 J jnl
A 2.5 approximation algorithm for the multi-via assignment problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Thang Nguyen Bui, Willie Hsu, SingLing Lee
1992 J jnl
Finding Good Approximate Vertex and Edge Partitions is NP-Hard.
Inf. Process. Lett.
Thang Nguyen Bui, Curt Jones
1992 J jnl
Partitioning Planar Graphs.
SIAM J. Comput.
Thang Nguyen Bui, Andrew Peck
1990 — conf
Parallel Algorithms for Partitioning Simple Classes of Graphs.
ICPP (3)
Thang Nguyen Bui, Curt Jones
1989 A* conf
Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms.
DAC
Thang Nguyen Bui, C. Heigham, Curt Jones, Frank Thomson Leighton
1987 J jnl
Graph bisection algorithms with good average case behavior.
Comb.
Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser
1986 — —
Graph bisection algorithms.
Thang Nguyen Bui
1984 A* conf
Graph Bisection Algorithms with Good Average Case Behavior
FOCS
Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser
1980 J jnl
A Note on an Improved Bisection Algorithm.
Inf. Process. Lett.
Thang Nguyen Bui