Turtlegons: generating simple polygons for sequences of angles. - Joseph C. Culberson; Gregory J. E. Rawlins (SCG, 1985)

The Effect of Updates in Binary Search Trees - Joseph C. Culberson (STOC, 1985)

Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. - Robert A. Reckhow; Joseph C. Culberson (SCG, 1987)

Covering Polygons Is Hard (Preliminary Abstract) - Joseph C. Culberson; Robert A. Reckhow (FOCS, 1988)

Searching with Uncertainty (Extended Abstract). - Ricardo A. Baeza-Yates; Joseph C. Culberson; Gregory J. E. Rawlins (SWAT, 1988)

Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. - Joseph C. Culberson; J. Ian Munro (Comput. J., 1989)

A Fast Algorithm for Constructing Trees from Distance Matrices. - Joseph C. Culberson; Piotr Rudnicki (Inf. Process. Lett., 1989)

Orthogonally Convex Coverings of Orthogonal Polygons without Holes. - Joseph C. Culberson; Robert A. Reckhow (J. Comput. Syst. Sci., 1989)

Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees. - Joseph C. Culberson; J. Ian Munro (Algorithmica, 1990)

A World Championship Caliber Checkers Program. - Jonathan Schaeffer 001; Joseph C. Culberson; Norman Treloar; Brent Knight; Paul Lu; Duane Szafron (Artif. Intell., 1992)

Camouflaging independent sets in quasi-random graphs. - Mark Brockington; Joseph C. Culberson (Cliques, Coloring, and Satisfiability, 1993)

Exploring the k-colorable landscape with Iterated Greedy. - Joseph C. Culberson; Feng Luo (Cliques, Coloring, and Satisfiability, 1993)

Crossover versus Mutation: Fueling the Debate: TGA versus GIGA. - Joseph C. Culberson (ICGA, 1993)

Searching in the Plane - Ricardo A. Baeza-Yates; Joseph C. Culberson; Gregory J. E. Rawlins (Inf. Comput., 1993)

Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions. - Joseph C. Culberson (Evol. Comput., 1994)

Covering Polygons Is Hard. - Joseph C. Culberson; Robert A. Reckhow (J. Algorithms, 1994)

Multicommodity flows in simple multistage networks. - Ehab S. Elmallah; Joseph C. Culberson (Networks, 1995)

Searching with Pattern Databases. - Joseph C. Culberson; Jonathan Schaeffer 001 (AI, 1996)

On Searching alpha-ary Hypercubes and Related Graphs. - Joseph C. Culberson; Jonathan Lichtner (FOGA, 1996)

Pattern Databases. - Joseph C. Culberson; Jonathan Schaeffer 001 (Comput. Intell., 1998)

On the Futility of Blind Search: An Algorithmic View of "No Free Lunch". - Joseph C. Culberson (Evol. Comput., 1998)

The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem. - Basil Vandegriend; Joseph C. Culberson (J. Artif. Intell. Res., 1998)

Frozen development in graph coloring. - Joseph C. Culberson; Ian P. Gent (Theor. Comput. Sci., 2001)

An Analysis of Phase Transition in NK Landscapes. - Yong Gao 001; Joseph C. Culberson (J. Artif. Intell. Res., 2002)

On the Treewidth of NK Landscapes. - Yong Gao 001; Joseph C. Culberson (GECCO, 2003)

Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness. - Yong Gao 001; Joseph C. Culberson (CP, 2004)

The Resolution Complexity of Random Graph k-Colorability - Paul Beame; Joseph C. Culberson; David G. Mitchell; Cristopher Moore (Electron. Colloquium Comput. Complex., 2004)

Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. - Joseph C. Culberson; Yong Gao 001; Calin Anton (IJCAI, 2005)

On the complexity of unfrozen problems. - Adam Beacham; Joseph C. Culberson (Discret. Appl. Math., 2005)

The resolution complexity of random graph k-colorability. - Paul Beame; Joseph C. Culberson; David G. Mitchell; Cristopher Moore (Discret. Appl. Math., 2005)

Resolution complexity of random constraint satisfaction problems: Another half of the story. - Yong Gao 001; Joseph C. Culberson (Discret. Appl. Math., 2005)

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. - Nesrine Abbas; Joseph C. Culberson; Lorna Stewart (Discret. Math. Theor. Comput. Sci., 2005)

Space Complexity of Estimation of Distribution Algorithms. - Yong Gao 001; Joseph C. Culberson (Evol. Comput., 2005)

Using Infeasibility to Improve Abstraction-Based Heuristics. - Fan Yang; Joseph C. Culberson; Robert Holte (SARA, 2007)

Consistency and Random Constraint Satisfaction Models. - Yong Gao 001; Joseph C. Culberson (J. Artif. Intell. Res., 2007)

A General Theory of Additive State Space Abstractions. - Fan Yang; Joseph C. Culberson; Robert Holte; Uzi Zahavi; Ariel Felner (J. Artif. Intell. Res., 2008)

DP-Complete Problems Derived from Extremal NP-Complete Properties. - Yi Cao; Joseph C. Culberson; Lorna Stewart (MFCS, 2009)

Data Caching in Next Generation Mobile Cloud Services, Online vs. Off-Line. - Yang Wang 006; Shuibing He; Xiaopeng Fan; Chengzhong Xu 001; Joseph C. Culberson; Joseph Horton (ICPP, 2017)

Cost-Driven Data Caching in the Cloud: An Algorithmic Approach. - Yang Wang 006; Yong Zhang 001; Xinxin Han; Pengfei Wang; Chengzhong Xu 001; Joseph Horton; Joseph C. Culberson (INFOCOM, 2021)