In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
We consider the amount of communication required to verify the outcome of the Vickrey-Clarke-Groves (VCG) mechanism: an efficient allocation together with incentivizing VCG paymen...
: For a large class of bounded-error estimation problems, the posterior feasible set 5 for the parameters can be dened by nonlinear inequalities. The set-inversion approach combine...
We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P posit...
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...