• Optimization issues in medical imaging and fiber-tracking 

      Bergmann, Ørjan (Doctoral thesis, 2008-02-27)
      Fiber tracking is a relatively recent methodology, made possible by access to new highly advanced MR scanners able to produce high-quality diffusion tensor images (DTI), which promises clinicians a possibility to observe ...
    • Optimization Models for Turbine Location in Wind Farms 

      Haugland, Jan Kristian (Master thesis, 2012-05-24)
      The topic of this thesis is wind farm optimization. The goal is to be able to decide where to install wind turbines within a given region in order to maximize the power output in two different scenarios: For a fixed number ...
    • Optimization of reliable cyclic cable layouts in offshore wind farms 

      Klein, Arne; Haugland, Dag (Peer reviewed; Journal article, 2020)
      A novel approach for optimizing reliable cable layouts in offshore wind farms is presented. While optimization models traditionally are designed to suggest acyclic cable routes, those developed in this work recognize that ...
    • Optimization Problems in Communication Networks and Multi-Agent Path Finding 

      Ivanova, Marika (Doctoral thesis, 2019-09-13)
      This dissertation is a compilation of six research papers that are focused on three dif- ferent topics summarized in the text. The first three papers address NP-hard problems arising in ad-hoc wireless com- munication ...
    • Optimizing Approximate Weighted Matching on Nvidia Kepler K40 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino; Langguth, Johannes (Chapter; Peer reviewed, 2018)
      Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand ...
    • Order Reconfiguration Under Width Constraints 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; Oliveira, Mateus De Oliveira; Wolf, Petra (Journal article; Peer reviewed, 2021)
      In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω' of the vertices of G, can one transform ω into ω' by a sequence of swaps of adjacent elements in ...
    • Order Reconfiguration under Width Constraints 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; De Oliveira Oliveira, Mateus; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2023)
      In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω′ of the vertices of G, can one transform ω into ω′ by a sequence of swaps of adjacent elements in ...
    • Order-Related Problems Parameterized by Width 

      Arrighi, Emmanuel (Doctoral thesis, 2022-05-25)
      In the main body of this thesis, we study two different order theoretic problems. The first problem, called Completion of an Ordering, asks to extend a given finite partial order to a complete linear order while respecting ...
    • ORFik: a comprehensive R toolkit for the analysis of translation 

      Tjeldnes, Håkon; Labun, Kornel; Torres Cleuren, Yamila Nicole; Chyzynska, Katarzyna; Swirski, Michal; Valen, Eivind Dale (Journal article; Peer reviewed, 2021)
      Background With the rapid growth in the use of high-throughput methods for characterizing translation and the continued expansion of multi-omics, there is a need for back-end functions and streamlined tools for processing, ...
    • Ouroboros-E: An efficient Lattice-based Key-Exchange Protocol 

      Deneuville, Jean-Christophe; Gaborit, Philippe; Guo, Qian; Johansson, Thomas (Peer reviewed; Journal article, 2018)
      The Bit Flipping algorithm is a hard decision decoding algorithm originally designed by Gallager in 1962 to decode Low Density Parity Check Codes (LDPC). It has recently proved to be much more versatile, for Moderate Parity ...
    • Output-Sensitive Filtering of Streaming Volume Data 

      Šoltészová, Veronika; Birkeland, Åsmund; Stoppel, Sergej; Viola, Ivan; Bruckner, Stefan (Peer reviewed; Journal article, 2016-02)
      Real-time volume data acquisition poses substantial challenges for the traditional visualization pipeline where data enhancement is typically seen as a pre-processing step. In the case of 4D ultrasound data, for instance, ...
    • P3 problem and Magnolia language: Specializing array computations for emerging architectures 

      Chetioui, Benjamin; Larnøy, Marius Kleppe; Järvi, Jaakko Timo Henrik; Haveraaen, Magne; Mullin, Lenore (Journal article; Peer reviewed, 2022)
      The problem of producing portable high-performance computing (HPC) software that is cheap to develop and maintain is called the P3 (performance, portability, productivity) problem. Good solutions to the P3 problem have ...
    • Packing arc-disjoint cycles in tournaments 

      Bessy, Stephane; Bougeret, Marin; Krithika, R; Sahu, Abhishek; Saurabh, Saket; Thiebaut, Jocelyn; Zehavi, Meirav (Journal article; Peer reviewed, 2019)
      A tournament is a directed graph in which there is a single arc between every pair of distinct vertices. Given a tournament T on n vertices, we explore the classical and parameterized complexity of the problems of determining ...
    • Packing cycles faster than Erdos-Posa 

      Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket; Zehavi, Meirav (Journal article; Peer reviewed, 2019)
      The Cycle Packing problem asks whether a given undirected graph $G=(V,E)$ contains $k$ vertex-disjoint cycles. Since the publication of the classic Erdös--Pósa theorem in 1965, this problem received significant attention ...
    • Parallel algorithms for computing k-connectivity 

      Haakonsen, Joachim (Master thesis, 2017-05-05)
    • Parallel algorithms for matching under preference 

      Lerring, Håkon Heggernes (Master thesis, 2017-06-20)
    • Parallel Graph Algorithms for Combinatorial Scientific Computing 

      Patwary, Mostofa Ali (Doctoral thesis, 2011-08-26)
    • Parallel Matching and Clustering Algorithms on GPUs 

      Naim, Md. (Doctoral thesis, 2017-06-17)
    • Parameter optimisation for the improved modelling of industrial-scale gas explosions 

      Both, Anna-Lena (Doctoral thesis, 2019-06-17)
      This thesis presents work on improving the predictive capabilities of a numerical model by parameter optimisation. The numerical model is based on computational fluid dynamics (CFD) and predicts the consequences of ...
    • Parameterization Above a Multiplicative Guarantee 

      Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Journal article; Peer reviewed, 2020)
      Parameterization above a guarantee is a successful paradigm in Parameterized Complexity. To the best of our knowledge, all fixed-parameter tractable problems in this paradigm share an additive form defined as follows. Given ...