We consider the Work Function Algorithm for the k-server problem [2, 3]. We show that if the Work Function algorithm is c-competitive, then it is also strictly (2c)-competitive. A...
Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Ro...
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...