We prove that binary decision diagrams [1] can be polynomially simulated by the extended resolution rule of [2]. More precisely, for any unsatisfiable formula , there exists an ex...
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic c...
The purpose of this paper is to provide sufficient geometric conditions that imply the existence of a cubic parametric polynomial curve which interpolates six points in the plane....
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...