We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
In various applications, the effect of errors in gradient-based iterations is of particular importance when seeking saddle points of the Lagrangian function associated with constra...
In this paper, we propose a class of incentive schemes based on intervention. We develop a general game-theoretic framework for the design of intervention schemes under imperfect m...
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap ...
Mark de Berg, Bettina Speckmann, Vincent van der W...
We consider a multi-cell MIMO downlink (network MIMO) where B base-stations (BS) with M antennas, connected to a central station (CS), transmit K messages to K singleantenna user t...