Home  |  Online Registration  |  eLearning  |  Contact Us  |  عربي  

Home >> CV

  CV    Sign In
   
 
Personal Information  
Name :Ruzayn Quaddoura
Academic Rank :Assistant Professor
Office No :1537
Phone :
Department :Computer Science
Email :ruzayn@zu.edu.jo
CV

 
Qualifications
Research - Journals
Ruzayn Quaddoura , An O(n) Time Algorithm for Scheduling UET-UCT of Bipartite Digraphs of Depth One on Two Processors, American Journal of Operations Research , 6, 75-80
01/01/2016
Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identical processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case is still a challenging open question. We present in this paper an O(n) time alg
Full Text Paper PDF

Ruzayn Quaddoura , Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time, Open Journal of Discrete Mathematics , 6, 13-24
01/01/2016
The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.
Full Text Paper PDF

Ruzayn Quaddoura , An O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star123-free Graphs, World of Computer Science and Information Technolo , Vol. 4, No. 3, 38-41, 2014
04/01/2014
Abstract— A matching in a graph is a set of edges no two of which share a common vertex. A matching 𝑀 is an induced matching if no edge connects two edges of 𝑀. The problem of finding a maximum induced matching is known to be NP-hard in general and specifically for bipartite graphs. Lozin has been proposed an 𝑂(𝑛3) time algorithm for this problem on the class of bipartite 𝑆𝑡𝑎𝑟123,𝑆𝑢𝑛4-free graphs. In this paper we improve and generalize this result in presenting a simple 𝑂(𝑛) time a
Full Text Paper PDF

Ruzayn Quaddoura, Khalid Mansour , Classical graphs decomposition and their totally decomposable graphs, International Journal of Computer Science and Netw , VOL.10 No.1, 240-250
01/01/2010
In solving optimization problems on graphs, graph decomposition is considered to be a powerful tool for obtaining efficient solutions for these problems. Totally decomposable graphs with respect to some method of graphs decomposition are relevant to many different areas of applied mathematics and computer science. There is a considerable number of results in this area. The goal of this paper is to survey the state of art of the famous methods of graphs decomposition and their totally decomposabl
Full Text Paper PDF

Ruzayn Quaddoura , Operator Decomposition of Graphs, International Arab Journal of Informatio , Vol. 3, No. 3, 152-164
04/01/2006
In this paper, we introduce a new form of decomposition of graphs, the (P, Q)-decomposition...
Full Text Paper PDF

Ruzayn Quaddoura , Linear Time Recognition of Bipartite Star123-Free Graphs    , International Arab Journal of Information Technolo , Vol. 3, No. 3, 193-202
06/01/2006
In this paper we present a linear time recognition algorithm for recognizing bipartite graphs without induced subgraphs isomorph to Star123. Bipartite Star123-free graphs are a natural generalization of both weak bisblit and Star123, Sun4-free bipartite graphs, both further generalizing bicographs.
Full Text Paper PDF

Ruzayn Quaddoura , Linear time recognition algorithms for three variants of vertex series parallel digraphs, Conf. on Foundations of Computer Science | FCS'07 , 7, 121-131
09/01/2007
Let S and P be the set of sources and the set of sinks of a digraph G. Tarjan and al in [1] defined the family of vertex series parallel dags (directed asyclic graphs) that is obtained from one vertex by the parallel operation (disjoint union) and the series operation (disjoint union of two dags G1 and G2 with adding the arcs of P1 × S2. We show in this paper that if we consider the multiplication in the series operation as S1×P2, P1 × P2 or S1 × S2 then the obtained classes of dags are
Full Text Paper PDF

Conferences
Ruzayn Quaddoura
Conf. on Foundations of Computer Science | FCS'07 |
USA
2007.09.01
Let S and P be the set of sources and the set of sinks of a digraph G. Tarjan and al in [1] defined the family of vertex series parallel dags (directed asyclic graphs) that is obtained from one vertex

Experiences