Penn State Harrisburg Faculty Details

Areas of Concentration and Expertise

• Sequential and Parallel Algorithms
• Computational Complexity
• Combinatorial Optimization
• Genetic Algorithms
• Evolutionary Computation
• Graph Theory

Education

• Massachusetts Institute of Technology, Cambridge, MA
  Ph.D. in Computer Science, 1986.
• Massachusetts Institute of Technology, Cambridge, MA
  S.M. Computer Science, 1983
• Carnegie-Mellon University, Pittsburgh, PA.
  B.S. Mathematics (with Honors), 1980
  B.S. Electrical Engineering (with Honors), 1980

Research Experience

• Sequential and Parallel Algorithms
• Probabilistic analysis of Algorithms
• Computational Complexity
• Combinatorial Optimization
• Genetic Algorithms
• Evolutionary Computation
• Graph Theory

Teaching Experience

1992 - present Associate Professor of Computer Science/ Program Chair, Pennsylvania State University Middletown, PA. For more information consult my home page.

Major Subjects:

• Artificial Intelligence
• Numerical Analysis
• Ordinary Differential Equations
• Structured Programming with Pascal
• Object-Oriented Programming with C++
• Object-Oriented Design with Ada and C++
• Unix and C
• Data Structures
• Algorithms Design and Analysis
• Theory of Computation
• Evolutionary Computation

1986 - 1992 Assistant Professor of Computer Science , Pennsylvania State University University Park,PA.

Major Subjects:

• Data Structures and Algorithms
• Theory of Automata, Languages and Computability
• Algorithm Design and Analysis
• Theory of Graphs and Networks
• Parallel Algorithms
• Computer Aided Design in VLSI
• Computational Complexity Lower Bounds

Publications

• Bui, T. N., S. Chaudhuri, F. T. Leighton, and M. Sipser, "Graph Bisection Algorithms with Good Average Case Behavior," Combinatorica, Vol. 7, No. 2, 1987, pp. 171-191.
• Bui, T. N. and S.-L. Lee, "On the Mincut Bipartite Arrangement Problem," Proceedings of the 1987 International Conference on Computer-Aided Design (ICCAD-87), pp. 466-469.
• Bui, T. N., C. Heigham, C. Jones, and T. Leighton, "Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms," Proceedings of the 26th Design Automation Conference (DAC’89), 1989, pp. 775-778.
• Bui, T. N. and C. Jones, "Parallel Algorithms for Partitioning Simple Classes of Graphs," Proceedings of the 1990 International Conference on Parallel Processing, Volume III, pp. 150-153.
• Bui, T. N. and A. Peck, "Partitioning Planar Graphs," SIAM Journal of Computing, 21(2), April 1992, pp. 203-215.
• Bui, T. N. and C. Jones, "Finding Good Approximate Vertex and Edge Partitions is NP-hard," Information Processing Letters, 42, May 1992, pp. 153-159.
• Bui, T. N., W. Hsu and S. L. Lee, "A 2.5 Approximation Algorithm for the Multi-Via Assignment Problem," IEEE Transactions on CAD of Integrated Circuits and Systems, 11(11), November 1992, pp. 1325-1333.
• Bui, T. N. and B. R. Moon, "Hyperplane Synthesis for Genetic Algorithms," Proc. of the Fifth International Conference on Genetic Algorithms (ICGA-93), July 1993, pp. 102-109.
• Bui, T. N. and B. R. Moon, "A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs," Proc. of the IEEE/ACM 31st Design Automation Conference, June 1994, pp. 664-669.
• Bui, T. N. and B. R. Moon, "A New Genetic Approach for the Traveling Salesman Problem," Proc. of the First IEEE Conference on Evolutionary Computation, June 1994, pp. 7-12.
• Bui, T. N. and B. R. Moon, "Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata," Proc. of the Third International Conference on Parallel ProblemSolving from Nature, Jerusalem, Lecture Notes in Computer Science #866, October 1994, pp. 108-118.
• 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. 99-116.
• Bui, T. N. and B. R. Moon, "On Multidimensional Encoding/Crossover," Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA6), July 1995, pp. 49-56.
• 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. 478-484.
• Bui, T. N. and B. R. Moon, "Genetic Algorithms and Graph Partitioning," IEEE Transactions on Computers, Volume 45, No. 7, July 1996, pp. 841-855.
• Bui, T. N. and B. R. Moon, "GRCA: A Hybrid Genetic Algorithm for Circuit Ratio-Cut Partitioning," IEEE Trans. on Computer Aided Design, Volume 17, No. 3, March 1998, pp. 193-204.
• Bui, T. N., "Graph Partitioning," invited paper (peer reviewed), Encyclopedia of Optimization, Edited by C. A. Floudas and P. M. Pardalos, Kluwer Academic Publishers, June 2001, Vol. 2, pp. 362-368.
• Bui, T. N. and L. C. Strite, "A Hybrid Ant Colony Optimization for Graph Bisection," Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), July 2002, pp. 43-51.
• Bui, T. N. and C. M. Patel, "An Ant System Algorithm for Coloring Graphs," Computational Symposium on Graph Coloring and Generalizations (COLOR02), Ithaca, NY, September 2002.
• Bui, T. N. and J. R. Rizzo, Jr., "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, Springer-Verlag Heidelberg, pp. 24-35.
• 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, Springer-Verlag Heidelberg, pp. 36-47.
• Bui, T. N. and W. A. Youssef, "An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors," (received the best paper award in the Real World Applications Track), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2004), Seattle, June 2004, Lecture Notes in Computer Science, Vol. 3103, Springer-Verlag Heidelberg, pp. 908-919.

Affiliations

• Member of ACM (Association for Computing Machinery)
• Member of SIGACT (Special Interest Group in Automata and Computing Theory)
• Member of MAA ( Mathematical Association of America)