Motivated by a search game, Fomin, Heggernes and Telle [Algorithmica, 2005] defined the graph parameter treespan, a generalization of the well studied parameter bandwidth. Treespan is the maximum number of appearances of ...

To understand animal wellbeing, we need to consider subjective phenomena and sentience. This is challenging, since these properties are private and cannot be observed directly. Certain motivations, emotions and related ...

Let G be a graph. A dominating set D ⊆ V (G) is a super dominating set if for every vertex x ∈ V (G) \ D there exists y ∈ D such that NG (y) ∩ (V (G) \ D)) = {x}. The cardinality of a smallest super dominating set of G is ...

This thesis is dedicated to exploring methods for deciding whether a power function $F(x) = x^d$ is 0-APN. Any APN function is 0-APN, and so 0-APN-ness is a necessary condition for APN-ness. APN functions are cryptographically ...

In this review, we present important, recent developments in the computational prediction of cytochrome P450 (CYP) metabolism in the context of drug discovery. We discuss in silico models for the various aspects of CYP ...

This is an overview of examples and problems posed in the late 1600s up to the mid 1700s for the purpose of testing or explaining the two different implementations of the Newton-Raphson method, Newton’s method as described ...

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 ...

The computational power has increased dramatically since the appearance of the first computers, making them a vital tool in the analysis of dynamical systems. We present further applications of those two basic ideas, namely ...

We look at multiple GPU programming, using the connected components algorithm as the basis when we look into libraries and runtime environment for multiple GPU programming. We also show that Rem is a fast parallel algorithm, ...