Department of Informatics
Browse by
Recent Submissions

Maximum number of edges in graph classes under degree and matching constraints
(The University of Bergen, 20150512)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, 20150501)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 MaximumFlow Problem with MinimumLot Sizes
(The University of Bergen, 20150303)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 minimumlot 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 AspectOriented and Strategic Programming
(Elsevier, 200601)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, 20100917)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, 201008)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 ... 
AxiomBased Transformations: Optimisation and Testing
(Elsevier, 20091010)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 SpaceTime Topology for Semantic Flow Segmentation
(Elsevier, 2011) 
A Diagrammatic Logic for ObjectOriented Visual Modeling
(Elsevier, 20081121)Formal generalized sketches is a graphbased specification format that borrows its main ideas from categorical and ordinary firstorder logic, and adapts them to software engineering needs. In the engineering jargon, it ... 
Fusing a Transformation Language with an Open Compiler
(Elsevier, 20080401)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, 20090629)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, ... 
DomainSpecific Languages for Composable Editor Plugins
(Elsevier, 20100917)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  LeibnizZentrum fuer Informatik, 20140219)Let F be a family of graphs. In the FCompletion problem, we are given an nvertex 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 ... 
On cutwidth parameterized by vertex cover
(Springer, 201404)We study the CUTWIDTH problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two ... 
Parameterized complexity of Eulerian deletion problems
(Springer, 201401)We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ... 
Solving the 2disjoint connected subgraphs problem faster than 2ⁿ
(Springer, 201410)The 2DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ... 
Managing spatial selections with contextual snapshots
(Wiley, 201412)Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analysed and compared in different views. However, the semantics of such selections often depend on specific ... 
Scaling the scales  A suggested improvement to IBM's Intelligent Recommendation Algorithm
(The University of Bergen, 20141120)Recommender systems appear in a large variety of applications, and their use has become very common in recent years. As a lot of money can be made by companies having a better recommender system than their competitors, ... 
The index tracking problem with a limit on portfolio size
(The University of Bergen, 20141119)For a passive fund manager tracking a benchmark, it is not uncommon to select some, and not all the assets in the index to his portfolio. In this thesis, we consider the problem of minimizing the tracking error under the ...