Constantine N. K. Osiakwan

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

Collaborative distances:

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

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

1992

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

Constantine N. K. Osiakwan, Selim G. Akl

Proceedings of the Computing and Information, 1992

1991

Parallel computation of matchings in trees.

Constantine N. K. Osiakwan, Selim G. Akl

Parallel Comput., 1991

1990

The maximum weight perfect matching problem for complete weighted graphs is in PC.

Constantine N. K. Osiakwan, Selim G. Akl

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 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