Blar i Department of Informatics på tittel
Viser treff 802-821 av 925
-
Structural parameterizations of clique coloring
(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
(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
(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
(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
(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
(Master thesis, 2012-01-27) -
Støtte for rike klienter i Dynamic Presentation Generator
(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
(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
(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
(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
(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
(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
(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
(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
(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 ... -
Sufficiently overdetermined random polynomial systems behave like semiregular ones
(Doctoral thesis, 2019-12-18)Solving systems of polynomial equations over finite fields is a fundamental problem in several areas of pure and applied mathematics. Gröbner basis methods is a family of techniques to computationally solve such systems ... -
A Survey of Linear-Programming Guided Branching Parameterized Algorithms for Vertex Cover, with Experimental Results
(Master thesis, 2015-06-01)A survey of FPT algorithms for Vertex Cover, parameterized by an above guarantee parameter. -
A survey of parameterized algorithms and the complexity of edge modification
(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
(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 ...