.

Browsing School of Arts and Sciences by Title

LAUR Repository

Browsing School of Arts and Sciences by Title

Sort by: Order: Results:

  • On Single Source Reachability Improvement 
    Alkak, Hashem (Lebanese American University, 2023-02-02)
    The problem of augmenting a given network, or graph, via edge-additions for improved reachability from a given source node is considered. We formulate and study the following Single Source Reachability Improvement problem ...
  • On special-purpose hardware clusters for high-performance computational grids 
    Abu-Khzam, Faisal N.; Lehrter, Jeanne M.; Bouldin, Donald W.; Langston, Micheal A.; Peterson, Gregory D. (2017-03-22)
    Lehrter, J. M., Abu-Khzam, F. N., Bouldin, D. W., Langston, M. A., & Peterson, G. D. (2002, November). On Special-purpose Hardware Clusters for High-performance Computational Grids. In IASTED PDCS (pp. 1-5).
  • On the complexity of bilinear computations 
    Takche, Jean Halim (Pennsylvania State University, 2018-04-17)
    Arithmetic complexity theory is the study of the minimum number of non-scalar multiplications required to compute a set of bilinear forms. One can show that we can restrict ourselves to bilinear algorithms. Brockett and ...
  • On the complexity of multi-parameterized cluster editing 
    Abu-Khzam, Faisal (2018-04-23)
    The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. A multi-parameterized version of the problem is studied, ...
  • On the complexity of QoS-Aware service selection problem 
    Abu-Khzam, Faisal N.; Bazgan, Cristina; El Haddad, Joyce; Sikora, Florian (Springer, 2017-03-16)
    This paper addresses the QoS-aware service selection problem considering complex workflow patterns. More specifically, it focuses on the complexity issues of the problem. The NPNP-hardness of the problem, under various ...
  • On the complexity of various parameterizations of common induced subgraph isomorphism 
    Abu-Khzam, Faisal N.; Bonnet, Edouard; Sikora, Florian (Springer, 2017-03-16)
    Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NPNP -hard problems. MCIS remains NPNP -hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is ...
  • On the Computations of Gas-Solid Mixture Two-Phase Flow 
    Touma, R.; Zeidan, D. (2016-04-07)
    This paper presents high-resolution computations of a two-phase gas-solid mixture using a well-defined mathematical model. The HLL Riemann solver is applied to solve the Riemann problem for the model equations. This ...
  • "On the Death of my Dear Friend Nada Adib Haddad" 
    Aghacy, Samira (2016-11-14)
    She's dead, dead, and all the city, her city, weeps for her.
  • On the Detection of Passive Malicious Providers in Cloud Federations 
    Hammoud, Ahmad; Otrok, Hadi; Mourad, Azzam; Abdel Wahab, Omar; Bentahar, Jamal (2021-04-15)
    Cloud federation has emerged as a new business architecture which aims to help cloud providers cope with the increased waves of demands on their resources and services. Although plenty of solutions have been proposed trying ...
  • On the disk dimension of planar graphs 
    Abu-khzam, Faisal (2018-04-26)
    The disk dimension problem was introduced by Fellows and Langston in 1987. The disk dimension of a graph, G, is the least k for which G embeds in the plane minus k open disks, with every vertex of G on a boundary of one ...
  • On the effects of user ratings on the profitability of cloud services 
    Taghavi, Mona; Bentahar, Jamal; Otrok, Hadi; Abdel Wahab, Omar; Mourad, Azzam (IEEE Xplore, 2018-08-14)
    In todays cloud market, providers are taking advantage of consumer reviews and ratings as a new marketing tool to establish their credibility. However, to achieve higher ratings, they need to enhance their service quality ...
  • On the Issue of Oil. (c2017) 
    El-Chammas, Diana (Lebanese American University, 2018-03-06)
    Tensions between Lebanon and Israel have lately been on the rise due to the two countries’ opposing proposals for the delineation of their respective Exclusive Economic Zones (EEZ), and the resulting overlapping maritime ...
  • On the parameterized complexity of dynamic problems 
    Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter (2016-11-08)
    In a dynamic version of a (base) problem X it is assumed that some solution to an instance of X is no longer feasible due to changes made to the original instance, and it is required that a new feasible solution be obtained ...
  • On the parameterized parallel complexity and the vertex cover problem 
    Abu-Khzam, Faisal N.; Li, Shouwei; Markarian, Chrisitne; Meyer auf der Heide, Friedhelm; Podipyan, PAvel (Springer, 2018-04-24)
    Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In ...
  • On the Provisioning of Ultra-Reliable Low-Latency Services in IoT Networks with Multipath Diversity 
    Sweidan, Zahraa (Lebanese American University, 2020-12-18)
    The unprecedented increase in the number of smart connected devices invoked a plethora of diverse applications with different performance requirements stipulating various network management strategies. Ultra-reliable ...
  • On the relative efficiency of maximal clique enumeration algorithms, with application to high-throughput computational biology 
    Abu-Khzam, Faisal N.; Baldwin, Nicole E.; Langston, Micheal A.; Samatova, Nagiza F. (2018-04-24)
    The efficient enumeration of maximal cliques has applications in microarray analysis and a number of other foundational problems of computational biology. In this paper, we analyze and test existing maximal clique enumeration ...
  • On the steiner walk problem. (c2009) 
    Maarouf, Amina (Lebanese American University, 2011-10-24)
    Given a Euclidean graph G = (Y, E) with a special set of vertices, called the terminal s, the Euclidean Steiner Walk problem asks for a walk through the vertices of the graph that starts and ends at a particular point, ...
  • On the Union of Closed Balls Property 
    Nour, Chadi; Takche, Jean (2016-03-30)
    We provide a new analytical proof for a strengthened version of the variable radius form of the union of closed balls conjecture. We also introduce a strong version of this conjecture and discuss its validity.
  • On the Validity of the Direct Sum Conjecture 
    Takche, Jean; Ja'ja', Joseph (2016-04-08)
    The direct sum conjecture states that the multiplicative complexity of disjoint sets of bilinear computations is the sum of their separate multiplicative complexities. This conjecture is known to hold for only a few ...
  • On the verge of colistin resistance. (c2019) 
    Alousi, Sahar (Lebanese American University, 2019-11-27)
    Colistin has often become the last option to treat infections by carbapenemase producing Klebsiella pneumoniae (CPKP). The PhoPQ two-component system (TCS), insertional inactivation of mgrB gene, and crrAB TCS have ...

Search LAUR


Advanced Search

Browse

My Account