Fringe analysis of binary search trees with miniml internal path length. - Faris N. Abuali; Roger L. Wainwright (ACM Conference on Computer Science, 1991)

ISA[ k ] Trees: a Class of Binary Search Trees with Minimal or Near Minimal Internal Path Length. - Faris N. Abuali; Roger L. Wainwright (Softw. Pract. Exp., 1993)

Terminal Assignment in a Communications Network Using Genetic Algorithms. - Faris N. Abuali; Dale A. Schoenefeld; Roger L. Wainwright (ACM Conference on Computer Science, 1994)

Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees. - Faris N. Abuali; Dale A. Schoenefeld; Roger L. Wainwright (SAC, 1994)

Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem. - Faris N. Abuali; Roger L. Wainwright; Dale A. Schoenefeld (ICGA, 1995)

Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs. - Faris N. Abuali; Roger L. Wainwright; Dale A. Schoenefeld (SAC, 1995)

Solving the three-star tree isomorphism problem using genetic algorithms. - Faris N. Abuali; Roger L. Wainwright; Dale A. Schoenefeld (SAC, 1995)

Solving the subset interconnection design problem using genetic algorithms. - Faris N. Abuali; Roger L. Wainwright; Dale A. Schoenefeld (SAC, 1996)