Collections in this community

Recent Submissions

  • Block-Diagonal and LT Codes for Distributed Computing with Straggling Servers 

    Severinson, Albin; Graell i Amat, Alexandre; Rosnes, Eirik (IEEE, 2019-03)
    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
  • Transformations for Array programming 

    Abusdal, Ole Jørgen (The University of Bergen, 2020-05-15)
    Master thesis
  • On offshore wind farm maintenance scheduling for decision support on vessel fleet composition 

    Gutierrez-Alcoba, Alejandro; Hendrix, Eligius M.T.; Lopez, Gloria Ortega; Halvorsen-Weare, Elin Espeland; Haugland, Dag (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 EA-equivalences 

    Villa, Irene; Calderini, Marco; Budaghyan, Lilya (Springer, 2020)
    In the present paper we introduce some sufficient conditions and a procedure for checking whether, for a given function, CCZ-equivalence is more general than EA-equivalence together with taking inverses of permutations. ...
    Journal article
  • On width measures and topological problems on semi-complete digraphs 

    Fomin, Fedor; Pilipczuk, Michal (Elsevier, 2019)
    The topological theory for semi-complete 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 

    Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Schloss Dagstuhl, 2019-09-06)
    An undirected graph G is d-degenerate 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 b-chromatic number of graphs 

    Jaffke, Lars; Lima, Paloma T. (Schloss Dagstuhl, 2019-08-20)
    A b-coloring 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 b-Coloring problem asks whether a graph G has ...
    Journal article
  • Pooling Problems with Single-Flow Constraints 

    Haugland, Dag (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 

    Baste, Julien; Jaffke, Lars; Masařík, Tomáš; Philip, Geevarghese; Rote, Günter (MDPI, 2019-11-27)
    In this work, we study the d-Hitting 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 

    Labun, Kornel; Guo, Xiaoge; Chavez, Alejandro; Church, George M.; Gagnon, James A.; Valen, Eivind (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 nuclease-optimized alignments, filtering of experimental ...
    Journal article
  • Refined Complexity of PCA with Outliers 

    Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Simonov, Kirill (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 

    Strømme, Torstein Jarl Fagerbakke (The University of Bergen, 2020-05-07)
    Coping with NP-hard 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
  • Mim-Width III. Graph powers and generalized distance domination problems 

    Telle, Jan Arne; Jaffke, Lars; Strømme, Torstein Jarl Fagerbakke; Kwon, O-Joung (Elsevier, 2019)
    We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as Distance-r Dominating Set and Distance-r Independent ...
    Journal article
  • Smart Surrogate Widgets for Direct Volume Manipulation 

    Stoppel, Sergej; Bruckner, Stefan (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 

    Blaser, Nello; Brun, Morten (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 

    Bolte, Fabian; Nourani, Mahsan; Ragan, Eric; Bruckner, Stefan (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 

    Guo, Qian; Johansson, Thomas; Yang, Jing (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 Post-Quantum Cryptography Standardization effort. Many submitted ...
    Journal article
  • Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems 

    Fomin, Fedor; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomasse, Stephan; Zehavi, Meirav (ACM, 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 ...
    Journal article
  • A note on some algebraic trapdoors for block ciphers 

    Calderini, Marco (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 partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it ...
    Journal article
  • Hard Mathematical Problems in Cryptography and Coding Theory 

    Varadharajan, Srimathi (The University of Bergen, 2020-04-28)
    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

View more