Khamis, Soheir

soheir_khamis@sci.asu.edu.eg

Internal ID: rp02945
  • 100 Scopus Citations

Loading... 2 0 20 0 false
 
Full Name
Khamis, Soheir
 

Refined By:
Date Issued:  [1003 TO 1999]

Results 1-13 of 13 (Search time: 0.0 seconds).

Issue DateTitleAuthor(s)
11997Algorithmic Counting of Types of UPO Graphs and PosetsBayoumi I. Bayoumi, Mohamed H. El-Zahar ; Khamis, Soheir 
21997An Algorithm for Computing the Reliability of Connected (1,2)or (2,1) out of (m,.n):F Lattice SystemN. Mokhlis ; Khamis, Soheir 
31997PRIMALITY TESTING AND COUNTING THE NUMBER OF UNLABELED PRIME POSETS ON THIRTEEN ELEMENTSS. M. Khamis ; Khamis, Soheir 
41996“Testing Isomorphism and Recognition of N-free Posets”Bayoumi I. Bayoumi, ; Khamis, Soheir 
512-Jan-1995ON RECOGNIZING THE DIMENSION OF A POSETB.I. BAYOUMI, M.H. EL-ZAHAR ; Khamis, Soheir 
65-Aug-1994Counting two-dimensional posetsBayoumi B. ; El-Zahar M. ; Khamis, Soheir 
725-Nov-1993On the M- Machine Scheduling for Dags with Bounded Number of Maximal Complete Bipartite SubgraphsE. M. El-Sherif, M. M. Kouta and B.I. Bayoumi ; Khamis, Soheir 
81991On The Relative Frequency of Series-Parallel to N–Free PosetsBAYOUHI I. BAYOUM I, MOHAHED H. EL-ZAHAR ; Khamis, Soheir 
910-Dec-1990COUNTING PERMUTATION GRAPHSBAYOUMI I. BAYOUMI MOHAMED H. EL-ZAHAR ; Khamis, Soheir 
10Aug-1990An Exact Enumeration of the Reliability of Some Linear & Circular Connected X-out-of-(n,m) :F Lattice Systems.N. Mokhlis ; Khamis, Soheir 
1125-Dec-1989AN ALGORITHM TO COUNT RIME N-FREE POSETSBayoumi I. Bayoumi , Mohamed H. El-Zahar ; Khamis, Soheir 
121-Sep-1989Asymptotic enumeration of N-free partial ordersBayoumi B. ; El-Zahar M. ; Khamis, Soheir 
13Dec-1988ENUMERATION OF 2-DIMENSIONAL Posets VIA COUNTING PRIME2-DIMENSIONAL POSETBayoumi B.I. El Zahar M. H. Soheir M.K. ; Khamis, Soheir