Constantine N. K. Osiakwan

According to our database, Constantine N. K. Osiakwan authored at least 6 papers between 1989 and 1995.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1995

The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs Is in Pc*.

Constantine N. K. Osiakwan, Selim G. Akl

Parallel Algorithms Appl., 1995

1994

An Efficient Parallel Algorithm for the Assignment Problem on the Plane.

Constantine N. K. Osiakwan, Selim G. Akl

Parallel Algorithms Appl., 1994

An <i>EP</i> 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

1991

Parallel computation of matchings in trees.

Constantine N. K. Osiakwan, Selim G. Akl

Parallel Comput., 1991

1990

A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs.

Constantine N. K. Osiakwan, Selim G. Akl

Proceedings of the Parallel Architectures (Postconference PARBASE-90)., 1990

1989

Optimal Parallel Algorithms for b-Matchings in Trees.

Constantine N. K. Osiakwan, Selim G. Akl

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989