.

Recently added

LAUR Repository

SoAS - Scholarly Publications: Recent submissions

  • Abu-Khzam, Faisal N.; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    The Maximum Common Induced Subgraph problem (MCIS ) takes a pair of graphs as input and asks for a graph of maximum order that is isomorphic to an induced subgraph of each of the input graphs. The problem is NP-hard in ...
  • Abu-Khzam, Faisal N.; Feghali, Carl; Muller, Haiko; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    A graph G=(V,E) is partitionable if there exists a partition {A,B} of V such that A induces a disjoint union of cliques (i.e. , G[A] is P3-free) and B induces a triangle-free graph (i.e. , G[B] is K3-free). In this ...
  • Abu-Khzam, Faisal N.; Daudjee, Khuzaima; Mouawad, Amer E.; Nishimura, Naomi; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    Supercomputers are equipped with an increasingly large number of cores to use computational power as a way of solving problems that are otherwise intractable. Unfortunately, getting serial algorithms to run in parallel to ...
  • Abu-Khzam, Faisal N.; Langston, Micheal; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties of graphs with a given disk dimension are ...
  • Abu-Khzam, Faisal N.; Mouawad, Amer E.; Liedloff, Mathieu; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    In the Connected Red–Blue Dominating Set problem we are given a graph G whose vertex set is partitioned into two parts R and B (red and blue vertices), and we are asked to find a connected subgraph induced by a subset S ...
  • Abu-Khzam, Faisal N.; Fernau, Henning; Langston, Micheal A.; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    The parameterized complexity of the face cover problem is considered. The input to this problem is a plane graph G with n vertices. The question asked is whether, for a given parameter value k, there exists a set of k or ...
  • Abu-Khzam, Faisal N.; Langston, Micheal; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. It is shown that a t-chromatic graph G contains either an immersed Kt ...
  • Abu-Khzam, Faisal N.; Fernau, Henning; Langston, Micheal A.; Lee-Cultura, Serena; Stege, Ulrike; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    String distance problems typically ask for a minimum number of permitted operations to transform one string into another. Such problems find application in a wide variety of areas, including error-correcting codes, parsing ...
  • Abu-Khzam, Faisal N.; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). ...
  • Abu-Khzam, Faisal N.; Fellos, Micheal R.; Langston, Micheal A.; Suters, W. Henry; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discussed. One, based on linear programming, has ...
  • Abu-Khzam, Faisal N.; SAS; 200302941; Computer Science and Mathematics; faisal.abukhzam@lau.edu.lb (2015-12-07)
    Pseudo-kernelization is introduced in this paper as a new strategy for improving fixed-parameter algorithms. This new technique works for bounded search tree algorithms by identifying favorable branching conditions whose ...
  • Abu-Khzam, Faisal N.; Langston, Micheal; Shanbhag, Pushkar; Symons, Christopher; SAS; 200302941; Computer Science and Mathematics (2015-12-07)
    Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems of significance. As a case study, optimal ...
  • Bassil, Maya S.; Mrayati, Maha M.; Hwalla, Nahla C.; Obeid, Omar A.; SAS; 201102356; Natural Sciences; mbassil@lau.edu.lb (2015-12-04)
    Aim: The study was designed to investigate the immediate (1 h) effect of leptin and ghrelin injection on in vivo postprandial hepatic glycogen and lipid synthesis. Animals andMethods: Adult Sprague-Dawley male rats were ...
  • Bassil, Maya S.; Hwalla, Nahla; Obeid, Omar A.; SAS; 201102356; Natural Sciences; mbassil@lau.edu.lb (2015-12-04)
    Objective: Food intake is known to be affected by macronutrient composition of the diet, and protein manipulation has been reported to alter food intake, but the effect of individual amino acids on eating behavior has ...
  • Bassil, M.; Morais, J.A.; Pereira, S.; Chevalier, S.; Gougeon, R.; Marliss, J.; SAS; 201102356; Natural Sciences; mbassil@lau.edu.lb (2015-12-04)
    Aims/hypothesis Although protein is usually ignored when considering insulin resistance, we have shown resistance of protein concurrent with glucose metabolism in men with type 2 diabetes during a hyperinsulinaemic clamp ...
  • Bassil, M.; Burgos, S.; Marliss, E.B.; Morais, J.A.; Chevalier, S.; Gougeon, R.; SAS; 201102356; Natural Sciences; mbassil@lau.edu.lb (2015-12-04)
    Aims/hypothesis Hyperaminoacidaemia attenuates glucose disposal during hyperinsulinaemic clamps in healthy lean individuals, an effect thought to be mediated by negative feedback on insulin signalling, downstream of the ...
  • Dallal, Jenine Abboushi; SAS; 201001985; English; jenine.abboushi@lau.edu.lb (2015-12-03)
  • Dallal, Jenine Abboushi; SAS; 201001985; English; jenine.abboushi@lau.edu.lb (2015-12-03)
  • Bahous, Rima; Fidaoui, Diana; SAS; 197902770; Education; rbahous@lau.edu.lb (2015-12-01)
    This qualitative study explores the relationship between gender identity and conversational behavior in all-male groups' interactions in a Lebanese context. We collected the data through non-participant observations and ...
  • Bahous, Rima; Nabhani, Mona; Rabo, Annika; SAS; 197902770; 198129610; Education; rbahous@lau.edu.lb; mnabhani@lau.edu.lb (2015-12-01)
    This exploratory article is based on a researchproject which runs 2011-2013 that examines how global processes are expressedin educational policies and pedagogical texts in Lebanon, Sweden and Turkey byfocusing on school ...

Search LAUR


Advanced Search

Browse

My Account