Optimal Parallel Algorithms for b-Matchings in Trees. - Constantine N. K. Osiakwan; Selim G. Akl (Optimal Algorithms, 1989)

A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs. - Constantine N. K. Osiakwan; Selim G. Akl (PARBASE / Architectures, 1990)

Parallel computation of matchings in trees. - Constantine N. K. Osiakwan; Selim G. Akl (Parallel Comput., 1991)

An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane. - Constantine N. K. Osiakwan; Selim G. Akl (INFORMS J. Comput., 1994)

An Efficient Parallel Algorithm for the Assignment Problem on the Plane. - Constantine N. K. Osiakwan; Selim G. Akl (Parallel Algorithms Appl., 1994)

The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs Is in Pc*. - Constantine N. K. Osiakwan; Selim G. Akl (Parallel Algorithms Appl., 1995)