We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Abstract. We propose a new method for face recognition under arbitrary pose and illumination conditions, which requires only one training image per subject. Furthermore, no limitat...
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...