default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThang Nguyen Bui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1986
[b1]Thang Nguyen Bui:
Graph bisection algorithms. Massachusetts Institute of Technology, Cambridge, MA, USA, 1986
Journal Articles
- 2012
- [j9]Thang Nguyen Bui, Xianghua Deng, Catherine M. Zrncic:
An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. IEEE Trans. Evol. Comput. 16(2): 266-278 (2012) - 2008
- [j8]Thang Nguyen Bui, ThanhVu H. Nguyen, Chirag M. Patel, Kim-Anh T. Phan:
An ant-based algorithm for coloring graphs. Discret. Appl. Math. 156(2): 190-200 (2008) - 1998
- [j7]Thang Nguyen Bui, Byung Ro Moon:
GRCA: a hybrid genetic algorithm for circuit ratio-cut partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(3): 193-204 (1998) - 1996
- [j6]Thang Nguyen Bui, Byung Ro Moon:
Genetic Algorithm and Graph Partitioning. IEEE Trans. Computers 45(7): 841-855 (1996) - 1992
- [j5]Thang Nguyen Bui, Curt Jones:
Finding Good Approximate Vertex and Edge Partitions is NP-Hard. Inf. Process. Lett. 42(3): 153-159 (1992) - [j4]Thang Nguyen Bui, Andrew Peck:
Partitioning Planar Graphs. SIAM J. Comput. 21(2): 203-215 (1992) - [j3]Thang Nguyen Bui, Willie Hsu, SingLing Lee:
A 2.5 approximation algorithm for the multi-via assignment problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(11): 1325-1333 (1992) - 1987
- [j2]Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph bisection algorithms with good average case behavior. Comb. 7(2): 171-191 (1987) - 1980
- [j1]Thang Nguyen Bui:
A Note on an Improved Bisection Algorithm. Inf. Process. Lett. 10(1): 35-36 (1980)
Conference and Workshop Papers
- 2009
- [c20]Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Rizzo:
Parallel shared memory strategies for ant-based optimization algorithms. GECCO 2009: 1-8 - 2006
- [c19]Thang Nguyen Bui, Catherine M. Zrncic:
An ant-based algorithm for finding degree-constrained minimum spanning tree. GECCO 2006: 11-18 - [c18]Thang Nguyen Bui, ThanhVu H. Nguyen:
An agent-based algorithm for generalized graph colorings. GECCO 2006: 19-26 - 2005
- [c17]Thang Nguyen Bui, Mufit Colpan:
Solving geometric TSP with ants. GECCO 2005: 271-272 - [c16]Thang Nguyen Bui, Gnanasekaran Sundarraj:
An efficient genetic algorithm for predicting protein tertiary structures in the 2D HP model. GECCO 2005: 385-392 - 2004
- [c15]Thang Nguyen Bui, Joseph R. Rizzo:
Finding Maximum Cliques with Distributed Ants. GECCO (1) 2004: 24-35 - [c14]Thang Nguyen Bui, Gnanasekaran Sundarraj:
Ant System for the k-Cardinality Tree Problem. GECCO (1) 2004: 36-47 - [c13]Thang Nguyen Bui, Waleed A. Youssef:
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors. GECCO (2) 2004: 908-919 - 2002
- [c12]Thang Nguyen Bui, Lisa C. Strite:
An Ant System Algorithm For Graph Bisection. GECCO 2002: 43-51 - 1995
- [c11]Thang Nguyen Bui, Byung Ro Moon:
On Multi-Dimensional Encoding/Crossover. ICGA 1995: 49-56 - [c10]Thang Nguyen Bui, Paul H. Eppley:
A Hybrid Genetic Algorithm for the Maximum Clique Problem. ICGA 1995: 478-484 - 1994
- [c9]Thang Nguyen Bui, Byung Ro Moon:
A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs. DAC 1994: 664-669 - [c8]Thang Nguyen Bui, Byung Ro Moon:
A New Genetic Approach for the Traveling Salesman Problem. International Conference on Evolutionary Computation 1994: 7-12 - [c7]Thang Nguyen Bui, Byung Ro Moon:
Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata. PPSN 1994: 108-118 - 1993
- [c6]Thang Nguyen Bui, Byung Ro Moon:
A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 99-116 - [c5]Thang Nguyen Bui, Byung Ro Moon:
Hyperplane Synthesis for Genetic Algorithms. ICGA 1993: 102-109 - [c4]Thang Nguyen Bui, Curt Jones:
A Heuristic for Reducing Fill-In in Sparse Matrix Factorization. PPSC 1993: 445-452 - 1990
- [c3]Thang Nguyen Bui, Curt Jones:
Parallel Algorithms for Partitioning Simple Classes of Graphs. ICPP (3) 1990: 150-153 - 1989
- [c2]Thang Nguyen Bui, C. Heigham, Curt Jones, Frank Thomson Leighton:
Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms. DAC 1989: 775-778 - 1984
- [c1]Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph Bisection Algorithms with Good Average Case Behavior. FOCS 1984: 181-192
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
