Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
Communication across the science-policy interface is complicated by uncertainty and ignorance associated with predictions on which to base policies. The international symposium ā...
In a recent paper, Savas, Batta and Nagi [14] consider the optimal placement of a ļ¬nite-sized facility in the presence of arbitrarily-shaped barriers under rectilinear travel. T...
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCSā07). In that paper, Dan...
Abstract. A cryptographic accumulator is a scheme where a set of elements is represented by a single short value. This value, along with another value called witness, allows to pro...