Recent Submissions

  • Annotating otoliths with a deep generative model 

    Bojesen, Troels Arnfred; Denechaud, Côme; Malde, Ketil (Journal article; Peer reviewed, 2023)
    Otoliths are a central information source for fish ecology and stock management, conveying important data about age and other life history for individual fish. Traditionally, interpretation of otoliths has required skilled ...
  • How to find a good explanation for clustering? 

    Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Purohit, Nidhi; Simonov, Kirill (Journal article; Peer reviewed, 2023)
    k-means and k-median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependencies on all the features, it is challenging to interpret the resulting cluster assignments. Moshkovitz, ...
  • The Connections Among Hamming Metric, b-Symbol Metric, and r-th Generalized Hamming Metric 

    Shi, Minjia; Zhu, Hongwei; Helleseth, Tor (Journal article; Peer reviewed, 2023)
    The r -th generalized Hamming metric and the b -symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of ...
  • Classes of intersection digraphs with good algorithmic properties 

    Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (Journal article; Peer reviewed, 2023)
    While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions ...
  • Parameterized complexity of categorical clustering with size constraints 

    Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (Journal article; Peer reviewed, 2023)
  • Diverse collections in matroids and graphs 

    Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Journal article; Peer reviewed, 2023)
    We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems. The input to the Weighted Diverse Bases problem consists of a matroid M, a weight function ω : ...
  • Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs 

    Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
    We introduce the rendezvous game with adversaries. In this game, two players, Facilitator and Divider, play against each other on a graph. Facilitator has two agents and Divider has a team of k agents located in some ...
  • Five-weight codes from three-valued correlation of M-sequences 

    Shi, Minjia; Qian, Liqin; Helleseth, Tor; Sole, Patrick (Journal article; Peer reviewed, 2023)
    In this paper, for each of six families of three-valued m-sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring R = F2 + uF2, where u2 = 0. The trace codes have the ...
  • Dynamic Programming on Bipartite Tree Decompositions 

    Jaffke, Lars; Morelle, Laure; Sau, Ignasi; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
    We revisit a graph width parameter that we dub bipartite treewidth, along with its associated graph decomposition that we call bipartite tree decomposition. Bipartite treewidth can be seen as a common generalization of ...
  • Structural Parameterizations of b-Coloring 

    Jaffke, Lars; Lima, Paloma Thome de; Sharma, Roohani (Journal article; Peer reviewed, 2023)
    The b-Coloring problem, which given a graph G and an integer k asks whether G has a proper k-coloring such that each color class has a vertex adjacent to all color classes except its own, is known to be FPT parameterized ...
  • Covering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristic 

    Shi, Minjia; Helleseth, Tor; Özbudak, Ferruh (Journal article; Peer reviewed, 2023)
    Let Fq0 be a finite field of odd characteristic. For an integer s≥1 , let Cs(q0) be the generalized Zetterberg code of length qs0+1 over Fq0 . If s is even, then we prove that the covering radius of Cs(q0) is 3. Put q=qs0 ...
  • New Results on the -1 Conjecture on Cross-Correlation of m-Sequences Based on Complete Permutation Polynomials 

    Wu, GaoFei; Feng, Keqin; Li, Nian; Helleseth, Tor (Journal article; Peer reviewed, 2023)
    The cross-correlation between two maximum length sequences (m-sequences) of the same period has been studied since the end of 1960s. One open conjecture by Helleseth states that the cross- correlation between any two p-ary ...
  • Detours in directed graphs 

    Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Sagunov, Danil; Saurabh, Saket; Simonov, Kirill (Journal article; Peer reviewed, 2023)
    We study two “above guarantee” versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, ...
  • VR Walk: Game. VR simulator for treadmill as a tool for constraint-based gait rehabilitation 

    Bleikli, Bendik Myrene; Valved, Lauritz Skålevik (Master thesis, 2020-06-06)
    The viability of Virtual Reality (VR) is being explored in an increasing number of fields outside its primary use in entertainment. A notable example is VR therapy, where VR-based alternatives to exposure therapy and ...
  • Computational searches for quadratic APN functions with subfield coefficients 

    Berg, Simon Knotten (Master thesis, 2023-06-01)
    Almost perfect nonlinear (APN) functions are important in fields such as algebra, combinatorics, cryptography, etc. Finding new APN functions is of special importance in cryptography. This is because when used in modern ...
  • Applying Gamification and Virtual Reality to an MRSA Infection Control Guideline 

    Bråten, Oskar Elias; Igesund, Trygve Eide (Master thesis, 2020-06-10)
    MRSA is a group of harmful bacteria with resistance to many important antibiotics. Infections are hard to treat and often result in prolonged hospital stays, leading to increased costs and mortality. Like with many other ...
  • Graph Algebras and Derived Graph Operations 

    Wolter, Uwe; Truong, Tam T. (Journal article, 2023)
    We revise our former definition of graph operations and correspondingly adapt the construction of graph term algebras. As a first contribution to a prospective research field, Universal Graph Algebra, we generalize some ...
  • Finding haplotypic signatures in proteins 

    Vasicek, Jakub; Skiadopoulou, Dafni; Kuznetsova, Ksenia; Wen, Bo; Johansson, Stefan; Njølstad, Pål Rasmus; Bruckner, Stefan; Käll, Lukas; Vaudel, Marc (Journal article; Peer reviewed, 2023)
    Background The nonrandom distribution of alleles of common genomic variants produces haplotypes, which are fundamental in medical and population genetic studies. Consequently, protein-coding genes with different ...
  • A Novel Evolutionary Solution Approach for Many-objective Reliability-Redundancy Allocation Problem Based on Objective Prioritization and Constraint Optimization 

    Nath, Rahul (Journal article; Peer reviewed, 2024)
    The reliability redundancy allocation problem (RRAP) has been mostly solved either as a single or as a multi-objective optimization problem. However, this problem also has numerous important constraints which play prominent ...
  • Measuring Adversarial Robustness using a Voronoi-Epsilon Adversary 

    Kim, Hyeongji; Parviainen, Pekka; Malde, Ketil (Journal article; Peer reviewed, 2023)
    Previous studies on robustness have argued that there is a tradeoff between accuracy and adversarial accuracy. The tradeoff can be inevitable even when we neglect generalization. We argue that the tradeoff is inherent to ...

View more