### Recent Submissions

• #### Maximum number of objects in graph classes. ﻿

(The University of Bergen, 2015-05-31)
The focus of this thesis is the study and implementation of two exact exponential time algorihms. These algorihms finds and lists the number of minimal dominating sets and the number of minimal subset feedback vertex ...
• #### Projective Simulation compared to reinforcement learning ﻿

(The University of Bergen, 2015-06-01)
This thesis explores the model of projective simulation (PS), a novel approach for an artificial intelligence (AI) agent. The model of PS learns by interacting with the environment it is situated in, and allows for ...
• #### Choice of parameter for DP-based FPT algorithms: four case studies ﻿

(The University of Bergen, 2015-09-07)
This thesis studies dynamic programming algorithms and structural parameters used when solving computationally hard problems. In particular, we look at algorithms that make use of structural decompositions to overcome ...
• #### Exact algorithms for MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication ﻿

(The University of Bergen, 2015-06-01)
In this thesis it is showed how an $O(n^{4-\epsilon})$ algorithm for the cube multiplication problem (that is defined in the thesis) would imply a faster than naive $O^{*}(2^{n(1-\frac{\epsilon}{4})})$ algorithm for the ...
• #### Localizing Cell Towers from Crowdsourced Measurements ﻿

(The University of Bergen, 2015-06-01)
Today, several internet sites exist that aim to provide the locations and number of cellular network antennas worldwide. For example [1],[2] and [3]. What makes this task difficult to accomplish is the lack of information ...
• #### A Model of Type Theory in Cubical Sets ﻿

(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014)
We present a model of type theory with dependent product, sum, and identity, in cubical sets. We describe a universe and explain how to transform an equivalence between two types into an equality. We also explain how to ...
• #### Maximum number of edges in graph classes under degree and matching constraints ﻿

(The University of Bergen, 2015-05-12)
In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has to satisfy certain constraints. In this thesis, we ask how many edges a graph can have with restrictions on its degree ...
• #### Community Detection in Social Networks ﻿

(The University of Bergen, 2015-05-01)
Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of ...
• #### Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes ﻿

(The University of Bergen, 2015-03-03)
In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimum-lot size. ...
• #### Molecular mechanisms of adaptation emerging from the physics and evolution of nucleic acids and proteins ﻿

(Oxford University Press, 2014)
DNA, RNA and proteins are major biological macromolecules that coevolve and adapt to environments as components of one highly interconnected system. We explore here sequence/structure determinants of mechanisms of adaptation ...
• #### Combining Aspect-Oriented and Strategic Programming ﻿

(Elsevier, 2006-01)
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very difficult or even impossible to modularizewith ...
• #### Interfacing concepts: Why declaration style shouldn't matter ﻿

(Elsevier, 2010-09-17)
A concept (or signature) describes the interface of a set of abstract types by listing the operations that should be supported for those types. When implementing a generic operation, such as sorting, we may then specify ...
• #### Hybrid visibility compositing and masking for illustrative rendering ﻿

(Elsevier, 2010-08)
In this paper, we introduce a novel framework for the compositing of interactively rendered 3D layers tailored to the needs of scientific illustration. Currently, traditional scientific illustrations are produced in a ...
• #### Axiom-Based Transformations: Optimisation and Testing ﻿

(Elsevier, 2009-10-10)
Programmers typically have knowledge about properties of their programs that aren't explicitly expressed in the code ­ properties that may be very useful for, e.g., compiler optimisation and automated testing. Although ...
• #### Current Trends for 4D Space-Time Topology for Semantic Flow Segmentation ﻿

(Elsevier, 2011)
• #### A Diagrammatic Logic for Object-Oriented Visual Modeling ﻿

(Elsevier, 2008-11-21)
Formal generalized sketches is a graph-based specification format that borrows its main ideas from categorical and ordinary first-order logic, and adapts them to software engineering needs. In the engineering jargon, it ...
• #### Fusing a Transformation Language with an Open Compiler ﻿

(Elsevier, 2008-04-01)
Program transformation systems provide powerful analysis and transformation frameworks as well as concise languages for language processing, but instantiating them for every subject language is an arduous task, most often ...
• #### The Second Rewrite Engines Competition ﻿

(Elsevier, 2009-06-29)
The Second Rewrite Engines Competition (REC) was celebrated as part of the 7th Workshop on Rewriting Logic and its Applications (WRLA 2008). In this edition of the competition participated five systems, namely ASF+SDF, ...
• #### Domain-Specific Languages for Composable Editor Plugins ﻿

(Elsevier, 2010-09-17)
Modern IDEs increase developer productivity by incorporating many different kinds of editor services. These can be purely syntactic, such as syntax highlighting, code folding, and an outline for navigation; or they can be ...
• #### Exploring Subexponential Parameterized Complexity of Completion Problems ﻿

(Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014-02-19)
Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a ...