We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
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...
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...