• Statistical considerations for the design and interpretation of proteomics experiments 

      Burger, Bram (Doctoral thesis, 2021-06-10)
      The methods to study proteins are continuously improving, making it possible to identify and study increasingly more proteins. It is important to keep studying and improving the way experiments are designed, performed, and ...
    • A Statistics-based Dimension Reduction of the Space of Path Line Attributes for Interactive Visual Flow Analysis 

      Pobitzer, Armin; Lež, Alan; Matković, Krešimir; Hauser, Helwig (Peer reviewed; Journal article, 2012)
      Recent work has shown the great potential of interactive flow analysis by the analysis of path lines. The choice of suitable attributes, describing the path lines, is, however, still an open question. This paper addresses ...
    • Strategic optimization of offshore wind farm installation 

      Backe, Stian; Haugland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2017)
      This work describes logistical planning of offshore wind farm (OWF) installation through linear programming. A mixed integer linear programming (MILP) model is developed to analyze cost-effective port and vessel strategies ...
    • Strongly stable C-stationary points for mathematical programs with complementarity constraints 

      Escobar, Daniel Hernandez; Rückmann, Jan-Joachim (Journal article; Peer reviewed, 2021)
      In this paper we consider the class of mathematical programs with complementarity constraints (MPCC). Under an appropriate constraint qualification of Mangasarian–Fromovitz type we present a topological and an equivalent ...
    • Structural parameterizations of clique coloring 

      Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese (Journal article; Peer reviewed, 2020)
      A clique coloring of a graph is an assignment of colors to its vertices such that no maximal clique is monochromatic. We initiate the study of structural parameterizations of the Clique Coloring problem which asks whether ...
    • Structure of Polynomial-Time Approximation 

      Leeuwen, Erik Jan van; Leeuwen, Jan van (Peer reviewed; Journal article, 2011-10-14)
      Approximation schemes are commonly classified as being either a polynomial-time approximation scheme (ptas) or a fully polynomial-time approximation scheme (fptas). To properly differentiate between approximation schemes ...
    • Strukturering av data for internettbehandling av pasienter med depresjon 

      Bergheim, Jostein (Master thesis, 2018-08-21)
      Depresjon er et globalt voksende problem med store direkte og indirekte økonomiske belastninger. Internettbasert behandling som har vist seg å gi god effekt for enkelte kategorier av pasienter med depresjon. For et av ...
    • Studies on the Security of Selected Advanced Asymmetric Cryptographic Primitives 

      Hovd, Martha Norberg (Doctoral thesis, 2022-03-11)
      The main goal of asymmetric cryptography is to provide confidential communication, which allows two parties to communicate securely even in the presence of adversaries. Ever since its invention in the seventies, asymmetric ...
    • A study of refactorings during software change tasks 

      Eilertsen, Anna Maria; Murphy, Gail C. (Journal article; Peer reviewed, 2021)
      Developers frequently undertake software change tasks that could be partially or fully automated by refactoring tools. As has been reported by others, all too often, these refactoring steps are instead performed manually ...
    • Støtte for Geodata i Dynamic Presentation Generator 

      Waage, Aleksander Vatle (Master thesis, 2012-01-27)
    • Støtte for rike klienter i Dynamic Presentation Generator 

      Skeidsvoll, Peder Lång (Master thesis, 2010-06-01)
      Denne oppgaven beskriver hvordan det kan legges til støtte for rike klienter i Dynamic Presentation Generator (DPG). Oppgaven tar for seg både server og klientsiden av temaet. DPG er et innholdshåndteringssystem utviklet ...
    • Subdivisions in digraphs of large out-degree or large dichromatic number 

      Aboulker, Pierre; Cohen, Nathann; Havet, Frederic; Lochet, William; Moura, Phablo F S; Thomasse, Stephan (Journal article; Peer reviewed, 2019)
      In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-degree at least f ( k ) contains a subdivision of the transitive tournament of order k . This conjecture is still completely ...
    • Subexponential Algorithms for Partial Cover Problems 

      Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket (Conference object; Peer reviewed; Journal article, 2009)
      Partial Cover problems are optimization versions of fundamental and well studied problems like {\sc Vertex Cover} and {\sc Dominating Set}. Here one is interested in covering (or dominating) the maximum number of edges (or ...
    • Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs 

      Fomin, Fedor; Golovach, Petr (Journal article; Peer reviewed, 2020)
      We study algorithmic properties of the graph class Chordal-ke, that is, graphs that can be turned into a chordal graph by adding at most k edges or, equivalently, the class of graphs of fill-in at most k. We discover that ...
    • Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs 

      Fomin, Fedor; Golovach, Petr (Journal article; Peer reviewed, 2021)
      We study algorithmic properties of the graph class CHORDAL−ke, that is, graphs that can be turned into a chordal graph by adding at most k edges or, equivalently, the class of graphs of fll-in at most k. It appears that a ...
    • Subexponential-time parameterized algorithm for Steiner tree on planar graphs 

      Pilipczuk, Marcin; Pilipczuk, Michal Pawel; van Leeuwen, Erik Jan; Sankowski, Piotr (Conference object; Peer reviewed; Journal article, 2013)
      The well-known bidimensionality theory provides a method for designing fast, subexponential-time parameterized algorithms for a vast number of NP-hard problems on sparse graph classes such as planar graphs, bounded genus ...
    • Subgraph Complementation 

      Fomin, Fedor; Golovach, Petr; Strømme, Torstein J. F.; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2020-02)
      A subgraph complement of the graph G is a graph obtained from G by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph G and graph class G, is there ...
    • Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems 

      Fomin, Fedor; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomasse, Stephan; Zehavi, Meirav (Peer reviewed; Journal article, 2019)
      We consider four well-studied NP-complete packing/covering problems on graphs: Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle Packing in Tournaments (TPT) and Induced P3-Packing. For ...
    • Substation Location in Offshore Wind Farms - A Planar Multi-Facility Location-Routing Problem 

      Amland, Thomas (Master thesis, 2014-03-14)
      In offshore wind farms, two important parts of the design are to determine locations for substations and a cabling layout that connects every turbine to a substation. These problems are interconnected, as the cable layout ...