The Rotation Graph of Binary Trees is Hamiltonian. - Joan M. Lucas (J. Algorithms, 1987)

Postorder Disjoint Set Union is Linear. - Joan M. Lucas (SIAM J. Comput., 1990)

On the Competitiveness of Splay Trees: Relations to the Union-Find Problem. - Joan M. Lucas (On-Line Algorithms, 1991)

Efficient Parallel Algorithms for Path Problems in Directed Graphs. - Joan M. Lucas; Marian Gunsher Sackrowitz (Algorithmica, 1992)

On Rotations and the Generation of Binary Trees. - Joan M. Lucas; Dominique Roelants van Baronaigien; Frank Ruskey (J. Algorithms, 1993)

Untangling Binary Trees via Rotations. - Joan M. Lucas (Comput. J., 2004)

A direct algorithm for restricted rotation distance. - Joan M. Lucas (Inf. Process. Lett., 2004)

Mock trials and role-playing in computer ethics courses. - Roxanne L. Canosa; Joan M. Lucas (SIGCSE, 2008)

Incorporating transformations into jflap for enhanced understanding of automata. - Joan M. Lucas; Jonathan Jarvis (SIGCSE, 2008)

Effective splaying with restricted rotations. - Joan M. Lucas (Int. J. Comput. Math., 2008)

Understanding the Universal Turing Machine: an implementation in JFLAP. - Jonathan Jarvis; Joan M. Lucas (J. Comput. Sci. Coll., 2008)

K-6 outreach using "Computer Science Unplugged". - Joan M. Lucas (J. Comput. Sci. Coll., 2009)

An improved kernel size for rotation distance in binary trees. - Joan M. Lucas (Inf. Process. Lett., 2010)

Illustrating the Interaction of Algorithms and Data Structures Using the Matching Problem. - Joan M. Lucas (SIGCSE, 2015)

Teaching greedy algorithms using a single problem domain. - Joan M. Lucas (J. Comput. Sci. Coll., 2015)