Department of Informatics
Browse by
Recent Submissions

BlockDiagonal and LT Codes for Distributed Computing with Straggling Servers
(IEEE, 201903)We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors. The first scheme is based on partitioning the matrix into submatrices and applying maximum distance separable ...Journal article 

On offshore wind farm maintenance scheduling for decision support on vessel fleet composition
(Elsevier, 2019)Maintenance costs account for a large part of the total cost of an offshore wind farm. Several models have been presented in the literature to optimize the fleet composition of the required vessels to support maintenance ...Journal article 
On relations between CCZ and EAequivalences
(Springer, 2020)In the present paper we introduce some sufficient conditions and a procedure for checking whether, for a given function, CCZequivalence is more general than EAequivalence together with taking inverses of permutations. ...Journal article 
On width measures and topological problems on semicomplete digraphs
(Elsevier, 2019)The topological theory for semicomplete digraphs, pioneered by Chudnovsky, Fradkin, Kim, Scott, and Seymour [10], [11], [12], [28], [43], [39], concentrates on the interplay between the most important width measures — ...Journal article 
Going Far From Degeneracy
(Schloss Dagstuhl, 20190906)An undirected graph G is ddegenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least ...Journal article 
A complexity dichotomy for critical values of the bchromatic number of graphs
(Schloss Dagstuhl, 20190820)A bcoloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The bColoring problem asks whether a graph G has ...Journal article 
Pooling Problems with SingleFlow Constraints
(INOC, 2019)The pooling problem is a frequently studied extension of the traditional minimum cost flow problem, in which the composition of the flow is subject to restrictions. In a network consisting of three layers of nodes, the ...Conference object 
FPT Algorithms for Diverse Collections of Hitting Sets
(MDPI, 20191127)In this work, we study the dHitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of r solutions of size at most k each, which has recently been introduced to the field of ...Journal article 
Accurate analysis of genuine CRISPR editing events with ampliCan
(Cold Spring Harbor Laboratory Press, 2019)We present ampliCan, an analysis tool for genome editing that unites highly precise quantification and visualization of genuine genome editing events. ampliCan features nucleaseoptimized alignments, filtering of experimental ...Journal article 
Refined Complexity of PCA with Outliers
(PMLR, 2019)Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data analysis and is the basic step in applications ranging from quantitative finance and bioinformatics to image analysis and ...Conference object 
Exploiting graph structures for computational efficiency
(The University of Bergen, 20200507)Coping with NPhard graph problems by doing better than simply brute force is a field of significant practical importance, and which have also sparked wide theoretical interest. One route to cope with such hard graph ...Doctoral thesis 
MimWidth III. Graph powers and generalized distance domination problems
(Elsevier, 2019)We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures wellknown problems such as Distancer Dominating Set and Distancer Independent ...Journal article 
Smart Surrogate Widgets for Direct Volume Manipulation
(IEEE, 2018)Interaction is an essential aspect in volume visualization, yet common manipulation tools such as bounding boxes or clipping plane widgets provide rather crude tools as they neglect the complex structure of the underlying ...Conference object 
Sparse Nerves in Practice
(Springer, 2019)Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. ...Journal article 
SplitStreams: A Visual Metaphor for Evolving Hierarchies
(IEEE, 2020)The visualization of hierarchically structured data over time is an ongoing challenge and several approaches exist trying to solve it. Techniques such as animated or juxtaposed tree visualizations are not capable of providing ...Journal article 
A novel CCA attack using decryption errors against LAC
(Springer, 2019)Cryptosystems based on Learning with Errors or related problems are central topics in recent cryptographic research. One main witness to this is the NIST PostQuantum Cryptography Standardization effort. Many submitted ...Journal article 
Subquadratic Kernels for Implicit 3Hitting Set and 3Set Packing Problems
(ACM, 2019)We consider four wellstudied NPcomplete packing/covering problems on graphs: Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle Packing in Tournaments (TPT) and Induced P3Packing. For ...Journal article 
A note on some algebraic trapdoors for block ciphers
(American Institute of Mathematical Sciences (AIMS), 2018)We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partitionbased trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it ...Journal article 
Hard Mathematical Problems in Cryptography and Coding Theory
(The University of Bergen, 20200428)In this thesis, we are concerned with certain interesting computationally hard problems and the complexities of their associated algorithms. All of these problems share a common feature in that they all arise from, or have ...Doctoral thesis