This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be ...

Distribution network reconfiguration (DNR) can significantly reduce power losses, improve the voltage profile, and increase the power quality. DNR studies require implementation of power flow analysis and complex optimization procedures capable of ...

We give a distributed (1+eps)-approximation algorithm for the minimum vertex coloring problem on interval graphs, which runs in the LOCAL model and operates in O((1/eps) log* n) rounds. If nodes are aware of their interval representations, then the ...

In this thesis, two methods for automatic enumeration of permutation classes are studied. The first method extends on the theory of combinatorial exploration. We review how combinatorial exploration works as a two phases process: the first phase ...

The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifications ...

Efficiency improvement is of great significance for simulation-driven antenna design optimization methods based on evolutionary algorithms (EAs). The two main efficiency enhancement methods exploit data-driven surrogate models and/or multi-fidelity ...

A simulation-based optimization approach to design of phase excitation tapers for linear phased antenna arrays is presented. The design optimization process is accelerated by means of Surrogate-Based Optimization (SBO); it uses a coarse-mesh surrogate ...

We propose a new type system for WebAssembly. It is a refinement of the type system from the language specification and is based on type qualifiers and subtyping. In the WebAssembly specification, a typable instruction sequence gets many different ...