• A survey of parameterized algorithms and the complexity of edge modification 

      Crespelle, Christophe; Drange, Pål Grønås; Fomin, Fedor; Golovach, Petr (Journal article; Peer reviewed, 2023)
      The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized ...
    • Sustainability in mining protocols for public blockchains 

      Nilsen, Cecilie Daae (Master thesis, 2019-05-04)
      Blockchains are a somewhat new technology with much potential and it is meeting growing public interest. However, with wider use of the technology we face the challenge of sustainability since the current mining protocols ...
    • Symmetric Ciphers for Fully Homomorphic Encryption 

      Thorvaldsen, Håkon (Master thesis, 2020-08-28)
      Fully homomorphic encryption is the latest addition to the world of cryptography. It is a type of encryption that allows operations to be done on ciphertexts, which is not possible with traditional encryption. The field ...
    • Synthesis and Analysis of Petri Nets from Causal Specifications 

      De Oliveira Oliveira, Mateus (Journal article; Peer reviewed, 2022)
      Petri nets are one of the most prominent system-level formalisms for the specification of causality in concurrent, distributed, or multi-agent systems. This formalism is abstract enough to be analyzed using theoretical ...
    • Synthesizing Skin Lesion Images Using Generative Adversarial Networks 

      Fossen-Romsaas, Sondre; Storm-Johannessen, Adrian (Master thesis, 2020-10-02)
      According to the World Health Organization cancer is the second leading cause of death globally [1], and the most common cancer in the world is skin cancer [2]. To get a skin cancer diagnosis, a patient will usually mention ...
    • Systematic exploration of error sources in pyrosequencing flowgram data 

      Balzer, Susanne Mignon; Malde, Ketil; Jonassen, Inge (Peer reviewed; Journal article, 2011)
      Motivation: 454 pyrosequencing, by Roche Diagnostics, has emerged as an alternative to Sanger sequencing when it comes to read lengths, performance and cost, but shows higher per-base error rates. Although there are several ...
    • Tail-biting Codes for Lattice Wiretap Coding 

      Persson, Palma Rud (Master thesis, 2023-06-01)
      The secrecy gain of Construction A lattices obtained by tail-biting rate 1/2 convolutional codes is studied to evaluate the secrecy performance of a lattice in a wiretap channel communication. The higher the secrecy gain, ...
    • TailFindR: Alignment-free poly(A) length measurement for Oxford Nanopore RNA and DNA sequencing 

      Krause, Maximilian; Niazi, Adnan Muhammad; Labun, Kornel; Torres Cleuren, Yamila Nicole; Müller, Florian S; Valen, Eivind (Peer reviewed; Journal article, 2019-07-02)
      Polyadenylation at the 3′-end is a major regulator of messenger RNA and its length is known to affect nuclear export, stability, and translation, among others. Only recently have strategies emerged that allow for genome-wide ...
    • Taming Graphs with No Large Creatures and Skinny Ladders 

      Gajarský, Jakub; Jaffke, Lars; Lima, Paloma Thome de; Novotná, Jana; Pilipczuk, Marcin; Rzążewski, Paweł; Souza, Uéverton S. (Journal article; Peer reviewed, 2022)
      We confirm a conjecture of Gartland and Lokshtanov [arXiv:2007.08761]: if for a hereditary graph class 𝒢 there exists a constant k such that no member of 𝒢 contains a k-creature as an induced subgraph or a k-skinny-ladder ...
    • Tangible Scalar Fields 

      Syvertsen, Anders Høyland (Master thesis, 2022-06-15)
      Data Visualization is a field that explores how to most efficiently convey information to the user, most often via visual representations like plots, graphs or glyphs. While this field of research has had great growth ...
    • Targeting performance and user-friendliness: GPU-accelerated finite element computation with automated code generation in FEniCS 

      Trotter, James David; Langguth, Johannes; Cai, Xing (Journal article; Peer reviewed, 2023)
      This paper studies the use of automated code generation to provide user-friendly GPU acceleration for solving partial differential equations (PDEs) with finite element methods. By extending the FEniCS framework and its ...
    • Techniques in parameterized algorithm design 

      Sloper, Christian (Doctoral thesis, 2006-03-06)
      In this thesis we give a novel classification of techniques for designing parameterized algorithms, together with research publications applying these techniques, in particular Crown Decompositions, to various problems. ...
    • Ten Open Challenges in Medical Visualization 

      Gillmann, Christina; Smit, Noeska Natasja; Groller, Eduard; Preim, Bernhard; Vilanova, Anna; Wischgoll, Thomas (Journal article; Peer reviewed, 2021)
      The medical domain has been an inspiring application area in visualization research for many years already, but many open challenges remain. The driving forces of medical visualization research have been strengthened by ...
    • Testing with Concepts and Axioms in C++ 

      Bagge, Anya Helene; David, Valentin; Haveraaen, Magne (Reports in Informatics: 368, Research report, 2008-10)
      Modern development practices encourage extensive testing of code while it is still under development, using unit tests to check individual code units in isolation. Such tests are typically case-based, checking a likely ...
    • ThermoRawFileParser: Modular, Scalable, and Cross-Platform RAW File Conversion 

      Hulstaert, Niels; Shofstahl, Jim; Sachsenberg, Timo; Walzer, Mathias; Barsnes, Harald; Martens, Lennart; Perez-Riverol, Yasset (Journal article; Peer reviewed, 2020)
      The field of computational proteomics is approaching the big data age, driven both by a continuous growth in the number of samples analyzed per experiment as well as by the growing amount of data obtained in each analytical ...
    • Thickness Distribution of Boolean Functions in 4 and 5 Variables 

      Hopp, Mathias Ludvig Presterud (Master thesis, 2020-05-12)
      This thesis explores the distribution of algebraic thickness of Boolean functions in four and five variables, that is, the minimum number of terms in the ANF of the functions in the orbit of a Boolean function, through all ...
    • Three Is Enough for Steiner Trees 

      Arrighi, Emmanuel; De Oliveira Oliveira, Mateus (Journal article; Peer reviewed, 2021)
      In the Steiner tree problem, the input consists of an edge-weighted graph G together with a set S of terminal vertices. The goal is to find a minimum weight tree in G that spans all terminals. This fundamental NP-hard ...
    • Three problems on well-partitioned chordal graphs 

      Ahn, Jungho; Jaffke, Lars; Kwon, O-Joung; Lima, Paloma Thome de (Journal article; Peer reviewed, 2021)
      In this work, we solve three problems on well-partitioned chordal graphs. First, we show that every connected (resp., 2-connected) well-partitioned chordal graph has a vertex that intersects all longest paths (resp., longest ...
    • Throughput and robustness of bioinformatics pipelines for genome-scale data analysis 

      Sztromwasser, Paweł (Doctoral thesis, 2014-02-19)
      The post-genomic era has been heavily influenced by the rapid development of highthroughput molecular-screening technologies, which has enabled genome-wide analysis approaches on an unprecedented scale. The constantly ...