We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
In this paper we develop a representational approach to media theory. We construct representations of media by well-graded families of sets and partial cubes and establish the uni...
Abstract. We study for various tree families the distribution of the number of edgedisjoint paths required to cover the edges of a random tree of size n. For all tree families cons...
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
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...