Communication protocols based on coded schemes and, in particular, network coding promise increased efficiency for future networks. The field is still young. Nevertheless, many important results have been already obtained. ...

Given a graph G=(V,E) and a set C of unordered pairs of edges regarded as being in conflict, a stable spanning tree in G is a set of edges T inducing a spanning tree in G, such that for each {e_i, e_j} in C, at most one ...

Let lpt(G) be the minimum cardinality of a transversal of longest paths in G, that is, a set of vertices that intersects all longest paths in a graph G. There are several results in the literature bounding the value of ...

In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9. We add a new ...

We define the class of triplicate functions as a generalization of 3-to-1 functions over \(\mathbb {F}_{2^{n}}\) for even values of n. We investigate the properties and behavior of triplicate functions, and of 3-to-1 among ...

Digital twin applications use digital artefacts to twin physical systems. The purpose is to continuously mirror the structure and behavior of the physical system, such that users can analyse the physical system by means ...

Estimating white matter fiber pathways from a diffusion tensor MRI dataset has many important applications in medical research. However, the standard approach of performing tracking on single-tensor estimates per voxel is ...

Component composition can lead to multiple instances of the same component. Some components can have only one instance loaded at a time, for example, when a unique external resource is used. We give an abstract component ...

Since the early days of the development of programming languages, people have been developing various methods to reduce the runtime errors of software programs. These methods range from static analysis, testing to runtime ...

We show how the display-map category of finite (symmetric) simplicial complexes can be seen as representing the totality of database schemas and instances in a single mathematical structure. We give a sound interpretation ...