We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
Onur Tekdas, Yokesh Kumar, Volkan Isler, Ravi Jana...
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...