Constantine N. K. Osiakwan

	1995
8		Constantine N. K. Osiakwan, Selim G. Akl: The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs Is in Pc*. Parallel Algorithms Appl. 6(2-3): 143-166 (1995)
	1994
7		Constantine N. K. Osiakwan, Selim G. Akl: An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane. INFORMS Journal on Computing 6(4): 436-444 (1994)
6		Constantine N. K. Osiakwan, Selim G. Akl: An Efficient Parallel Algorithm for the Assignment Problem on the Plane. Parallel Algorithms Appl. 4(3-4): 193-210 (1994)
	1992
5		Constantine N. K. Osiakwan, Selim G. Akl: An Efficient Parallel Algorithm for the Assignment Problem on the Plane. ICCI 1992: 110-113
	1991
4		Constantine N. K. Osiakwan, Selim G. Akl: Parallel computation of matchings in trees. Parallel Computing 17(6-7): 643-656 (1991)
	1990
3		Constantine N. K. Osiakwan, Selim G. Akl: A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs. PARBASE / Architectures 1990: 161-180
2		Constantine N. K. Osiakwan, Selim G. Akl: The maximum weight perfect matching problem for complete weighted graphs is in PC. SPDP 1990: 880-887
	1989
1		Constantine N. K. Osiakwan, Selim G. Akl: Optimal Parallel Algorithms for b-Matchings in Trees. Optimal Algorithms 1989: 274-308

Coauthor Index

1

Selim G. Akl

[1] [2] [3] [4] [5] [6] [7] [8]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page