Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...