The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness...
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...