Browsing Department of Informatics by Title
Now showing items 92111 of 365


Exact methods for solving the small scale single vehicle pickup and delivery problem with time windows
(The University of Bergen, 20160815)The single vehicle pickup and delivery problem with time windows (1PDPTW) is a wellknown problem in transportation and combinatorics. In practice, these routes are relatively small with less then 30 stops. In this ...Master thesis 
Exploring graph parameters similar to treewidth and pathwidth
(The University of Bergen, 20170704)In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast algorithms for dominating set” [12], three similar treelike parameters, treewidth, branchwidth and maximum matchingwidth, ...Master thesis 
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 ...Journal article 
Exploring the evolution of protein function in Archaea
(BioMed Central, 20120530)Background: Despite recent progress in studies of the evolution of protein function, the questions what were the first functional protein domains and what were their basic building blocks remain unresolved. Previously, we ...Journal article 
Exponential time algorithms: Structures, measures, and bounds
(The University of Bergen, 20081205)This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ...Doctoral thesis 
Expressive Visualization and Rapid Interpretation of Seismic Volumes
(The University of Bergen, 20091027)One of the most important resources in the world today is energy. Oil and gas provide two thirds of the world energy consumption, making the world completely dependent on it. Locating and recovering the remaining oil and ...Doctoral thesis 
Fast biclustering by dual parameterization
(Dagstuhl Publishing, 2015)We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NPhard, none ...Conference object 
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. ...Master thesis 
Fast methods to solve the pooling problem
(The University of Bergen, 20140531)In pipeline transportation of natural gas, simple network flow problems are replaced by hard ones when bounds on the flow quality are imposed. The sources, typically represented by gas wells, provide flow of unequal ...Master thesis 
Faster enumeration of minimal connected dominating sets in split graphs
(The University of Bergen, 20170620)Graphs are mathematical objects that can be used to model many real world problems. An example is a roadmap, where the nodes in the graph represent cities and the edges of the graph represent roads. An interesting and ...Master thesis 
Feasible Algorithms for Semantics — Employing Automata and Inference Systems
(The University of Bergen, 20101216)Doctoral thesis 
Filtering duplicate reads from 454 pyrosequencing data
(Oxford University Press, 2013)Motivation: Throughout the recent years, 454 pyrosequencing has emerged as an efficient alternative to traditional Sanger sequencing and is widely used in both de novo wholegenome sequencing and metagenomics. Especially ...Peer reviewedJournal article 
Filtering of FTLE for Visualizing Spatial Separation in Unsteady 3D Flow
(Springer, 2012)In many cases, feature detection for flow visualization is structured in two phases: first candidate identification, and then filtering. With this paper, we propose to use the directional information contained in the ...Peer reviewedJournal article 
Finding even subgraphs even faster
(Dagstuhl Publishing, 2015)Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ...Conference object 
Finding Induced Subgraphs via Minimal Triangulations
(Dagstuhl Publishing, 2010)Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems in cluding Minimum Fillin and Treewidth. We discover unexpected ...Conference object 

Finding Resource Bounds in the Presence of Explicit Deallocation
(Springer Berlin Heidelberg, 20051017)A software program requesting a resource that is not available usually raises an outofresource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may ...Journal article 
Firewalls: Enforcement of Security Policy in networks
(The University of Bergen, 20141120)Firewalls are set up to protect computer networks. Originally, networks were just coupled together, in order to achieve connection. With the ability to reach networks all over the world, one started to denote this the ...Master thesis