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

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

Concurrency as a phenomenon is observed in most of the current computer science trends. However the inherent complexity of analyzing the behavior of such a system is incremented due to the many different models of concurrency, the variety of applications ...