Department of Informatics: Nye registreringer
Viser treff 1-20 av 970
-
Turán's Theorem Through Algorithmic Lens
(Journal article; Peer reviewed, 2023) -
Towards Reusable GUI Structures
(Chapter, 2023)Graphical user interfaces present data as structures (lists, trees, grids). Convenient features to manipulate these structures are tedious to implement. We are working towards a GUI programming approach, where concise ... -
Compiler Support for Parallel Evaluation of C++ Constant Expressions
(Journal article; Peer reviewed, 2023)Metaprogramming, the practice of writing programs that manipulate other programs at compile-time, continues to impact software development; enabling new approaches to optimisation, static analysis, and reflection. Nevertheless, ... -
Computing Paths of Large Rank in Planar Frameworks Deterministically
(Journal article; Peer reviewed, 2023)A framework consists of an undirected graph G and a matroid M whose elements correspond to the vertices of G. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing ... -
Coset leaders of the first order Reed-Muller codes in the classes of Niho functions and Thershold functions
(Journal article; Peer reviewed, 2024)The notion of coset leader has applications in coding theory and cryptography. It has been studied in several papers. In this paper, we extend a recent study, made on the coset leaders of the first order Reed-Muller codes, ... -
Kernelization for Spreading Points
(Journal article; Peer reviewed, 2023)We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance, we can obtain an arrangement of points ... -
Strong bounds and exact solutions to the minimum broadcast time problem
(Journal article; Peer reviewed, 2025)Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast time problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the ... -
Compound Logics for Modification Problems
(Journal article; Peer reviewed, 2023)We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with ... -
Parameterized Complexity of Broadcasting in Graphs
(Journal article; Peer reviewed, 2023)The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, ... -
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
(Journal article; Peer reviewed, 2023)We study the α-Fixed Cardinality Graph Partitioning (α-FCGP) problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In this problem, we are given a graph G, two numbers k,p ... -
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
(Journal article; Peer reviewed, 2023)In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex deletion, edge deletion, edge contraction, or ... -
Kernelizing Temporal Exploration Problems
(Journal article; Peer reviewed, 2023)We study the kernelization of exploration problems on temporal graphs. A temporal graph consists of a finite sequence of snapshot graphs 𝒢 = (G₁, G₂, … , G_L) that share a common vertex set but might have different edge ... -
An Optimal Universal Construction for the Threshold Implementation of Bijective S-Boxes
(Journal article; Peer reviewed, 2023)Threshold implementation is a method based on secret sharing to secure cryptographic ciphers (and in particular S-boxes) against differential power analysis side-channel attacks which was proposed by Nikova, Rechberger, ... -
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves
(Journal article; Peer reviewed, 2023)A lineal topology T = (G, r, T ) of a graph G is an r-rooted depth-first spanning (DFS) tree T of G. Equivalently, this is a spanning tree of G such that every edge uv of G is either an edge of T or is between a vertex u ... -
Combing a Linkage in an Annulus
(Journal article; Peer reviewed, 2023)A linkage in a graph 𝐺 of size 𝑘 is a subgraph 𝐿 of 𝐺 whose connected components are 𝑘 paths. The pattern of a linkage of size 𝑘 is the set of 𝑘 pairs formed by the endpoints of these paths. A consequence of the ... -
Approximating Long Cycle Above Dirac's Guarantee
(Journal article; Peer reviewed, 2023)Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit "natural" guarantees bringing to algorithmic questions whether a better ... -
Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
(Journal article; Peer reviewed, 2023)The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating ... -
Visual Ensemble Analysis of Fluid Flow in Porous Media Across Simulation Codes and Experiment
(Journal article; Peer reviewed, 2024)We study the question of how visual analysis can support the comparison of spatio-temporal ensemble data of liquid and gas flow in porous media. To this end, we focus on a case study, in which nine different research groups ... -
Differentiating between malicious events and natural events in an Operational Technology (OT) environment
(Master thesis, 2024-06-03) -
On Logical Deduction in Large Language Models
(Master thesis, 2024-06-03)