Joseph (Joe) Culberson -- Research

Research Interests

My research tends to be a mixture of theoretical analysis and experimental simulation of algorithms and data structures. The goal is a deeper understanding of what makes hard problems hard, and under what conditions hard problems might be approximated. It currently focuses on randomized approaches to NP-complete problems, genetic algorithms, and related topics.

Current Work

• Graph Coloring See also the Graph Coloring page.

• Landscapes and Genetic Algorithms

• Other

  Older Work

  The following are research topics that I am no longer as actively engaged in, although they remain of interest.
• Binary Search Trees
• Computational Geometry
• Chinook the Checkers Program
• Real Cost Searching
• Partial Orders
• Miscellaneous

Experimental Algorithmics

Current Research with Students

Joseph Culberson

March 29, 1995