We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom...
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...