Blar i Department of Informatics på tittel

Viser treff 639-658 av 917

    • Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree 

      Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket (Peer reviewed; Journal article, 2019)
      In the Steiner Tree problem, we are given as input a connected \(n\)-vertex graph with edge weights in \(\{1,2,\ldots,W\}\), and a set of \(k\) terminal vertices. Our task is to compute a minimum-weight tree that contains ...

    • Parameterized streaming algorithms for min-ones d-SAT 

      Agrawal, Akanksha; Bonnet, Édouard; Curticapean, Radu; Miltzow, Tillmann; Saurabh, Saket; Biswas, Arindam; Brettell, Nick; Marx, Dániel; Raman, Venkatesh (Journal article; Peer reviewed, 2019)
      In this work, we initiate the study of the Min-Ones d-SAT problem in the parameterized streaming model. An instance of the problem consists of a d-CNF formula F and an integer k, and the objective is to determine if F has ...

    • Parsing in a Broad Sense 

      Zaytsev, Vadim; Bagge, Anya Helene (Lecture Notes in Computer Science: 8767, Chapter; Peer reviewed, 2014)
      Having multiple representations of the same instance is common in software language engineering: models can be visualised as graphs, edited as text, serialised as XML. When mappings between such representations are considered, ...

    • Partially APN functions with APN-like polynomial representations 

      Budaghyan, Lilya; Kaleyski, Nikolay Stoyanov; Riera, Constanza Susana; Stănică, Pantelimon (Journal article; Peer reviewed, 2020)
      In this paper we investigate several families of monomial functions with APN-like exponents that are not APN, but are partially 0-APN for infinitely many extensions of the binary field F2. We also investigate the differential ...

    • Partitioning a graph into degenerate subgraphs 

      Abu-Khzam, Faisal; Feghali, Carl; Heggernes, Pinar (Journal article; Peer reviewed, 2020-01)
      Let G = (V, E) be a connected graph with maximum degree k ≥ 3 distinct from Kk+1. Given integers s ≥ 2 and p1, . . . , ps ≥ 0, G is said to be (p1, . . . , ps)-partitionable if there exists a partition of V into sets ...

    • Partitioning H-Free Graphs of Bounded Diameter 

      Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani (Journal article; Peer reviewed, 2021)
      A natural way of increasing our understanding of NP-complete graph problems is to restrict the input to a special graph class. Classes of H-free graphs, that is, graphs that do not contain some graph H as an induced subgraph, ...

    • Passive Cryptanalysis of the UnConditionally Secure Authentication Protocol for RFID Systems 

      Abyaneh, Mohammad Reza Sohizadeh (Journal article, 2011)
      Recently, Alomair et al. proposed the first Un- Conditionally Secure mutual authentication protocol for lowcost RFID systems(UCS-RFID). The security of the UCSRFID relies on five dynamic secret keys which are updated at ...

    • Path contraction faster than $2^n$ 

      Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar (Journal article; Peer reviewed, 2020)
      A graph $G$ is contractible to a graph $H$ if there is a set $X \subseteq E(G)$, such that $G/X$ is isomorphic to $H$. Here, $G/X$ is the graph obtained from $G$ by contracting all the edges in $X$. For a family of graphs ...

    • Path Contraction Faster Than 2n 

      Agrawal, Akanksha; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar (Peer reviewed; Journal article, 2019)
      A graph G is contractible to a graph H if there is a set X subseteq E(G), such that G/X is isomorphic to H. Here, G/X is the graph obtained from G by contracting all the edges in X. For a family of graphs F, the F-Contraction ...

    • Perceptually Uniform Motion Space 

      Birkeland, Åsmund; Turkay, Cagatay; Viola, Ivan (Peer reviewed; Journal article, 2014-05-07)
      Flow data is often visualized by animated particles inserted into a flow field. The velocity of a particle on the screen is typically linearly scaled by the velocities in the data. However, the perception of velocity ...

    • The Perfect Matching Cut Problem Revisited 

      Telle, Jan Arne; Le, Van Bang (Journal article; Peer reviewed, 2021)
      In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP -complete. We ...

    • Personalized Sketch-Based Brushing in Scatterplots 

      Fan, Chaoran; Hauser, Helwig (Journal article; Peer reviewed, 2019)
      Brushing is at the heart of most modern visual analytics solutions and effective and efficient brushing is crucial for successful interactive data exploration and analysis. As the user plays a central role in brushing, ...

    • Perspectives on automated composition of workflows in the life sciences [version 1; peer review: 2 approved] 

      Lamprecht, Anna-Lena; Palmblad, Magnus; Ison, Jon; Schwämmle, Veit; Al Manir, Mohammad Sadnan; Altintas, Ilkay; Baker, Christopher J. O.; Ben Hadj Amor, Ammar; Capella-Gutierrez, Salvador; Charonyktakis, Paulos; Crusoe, Michael R.; Gil, Yolanda; Goble, Carole; Griffin, Timothy J.; Groth, Paul; Ienasescu, Hans; Jagtap, Pratik; Kalaš, Matúš; Kasalica, Vedran; Khanteymoori, Alireza; Kuhn, Tobias; Mei, Hailiang; Ménager, Hervé; Möller, Steffen; Richardson, Robin A.; Robert, Vincent; Soiland-Reyes, Stian; Stevens, Robert; Szaniszlo, Szoke; Verberne, Suzan; Verhoeven, Aswin; Wolstencroft, Katherine (Journal article; Peer reviewed, 2021)
      Scientific data analyses often combine several computational tools in automated pipelines, or workflows. Thousands of such workflows have been used in the life sciences, though their composition has remained a cumbersome ...

    • Pharmacokinetics and transcriptional effects of the anti-salmon lice drug emamectin benzoate in Atlantic salmon (Salmo salar L.) 

      Olsvik, Pål Asgeir; Lie, Kai Kristoffer; Mykkeltvedt, Eva; Samuelsen, Ole Bent; Petersen, Kjell; Stavrum, Anne-Kristin; Lunestad, Bjørn Tore (Peer reviewed; Journal article, 2008-09-11)
      Background: Emamectin benzoate (EB) is a dominating pharmaceutical drug used for the treatment and control of infections by sea lice (Lepeophtheirus salmonis) on Atlantic salmon (Salmo salar L). Fish with an initial mean ...

    • Phase Transition in a System of Random Sparse Boolean Equations 

      Schilling, Thorsten Ernst; Zajac, Pavol (Chapter; Peer reviewed, 2012)
      Many problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy ...

    • Phosphatidylcholine Cation—Tyrosine π Complexes: Motifs for Membrane Binding by a Bacterial Phospholipase C 

      Roberts, Mary F.; Gershenson, Anne; Reuter, Nathalie (Journal article; Peer reviewed, 2022-09-21)
      Phosphatidylinositol-specific phospholipase C (PI-PLC) enzymes are a virulence factor in many Gram-positive organisms. The specific activity of the Bacillus thuringiensis PI-PLC is significantly increased by adding ...

    • Plasma cortisol linked gene networks in hepatic and adipose tissues implicate corticosteroid binding globulin in modulating tissue glucocorticoid action and cardiovascular risk 

      Bankier, Sean Alexander; Michoel, Tom (Journal article; Peer reviewed, 2023)
      Genome-wide association meta-analysis (GWAMA) by the Cortisol Network (CORNET) consortium identified genetic variants spanning the SERPINA6/SERPINA1 locus on chromosome 14 associated with morning plasma cortisol, cardiovascular ...

    • Polyhedra and algorithms for problems bridging notions of connectivity and independence 

      Samer, Phillippe (Doctoral thesis, 2023-12-21)
      I denne avhandlinga interesserer vi oss for å finne delgrafer som svarer til utvalgte modeller for begrepene sammenheng og uavhengighet. I korthet betyr dette stabile (også kalt uavhengige) mengder med gitt kardinalitet, ...

    • Polyhedral results and stronger Lagrangean bounds for stable spanning trees 

      Samer, Phillippe; Haugland, Dag (Journal article; Peer reviewed, 2023)
      Given a graph G=(V,E) and a set C of unordered pairs of edges regarded as being in conflict, a stable spanning tree in G is a set of edges T inducing a spanning tree in G, such that for each {ei,ej}∈C, at most one of the ...

    • A Polynomial Kernel for Line Graph Deletion 

      Lochet, William; Eiben, Eduard (Journal article; Peer reviewed, 2020)
      The line graph of a graph G is the graph L(G) whose vertex set is the edge set of G and there is an edge between e,f ∈ E(G) if e and f share an endpoint in G. A graph is called line graph if it is a line graph of some ...