A definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data, and uses a new version of authenticated dictionaries based on rank information.Expand

An algorithm is presented that computes a region preserving grid embedding with the minimum number of bends in edges with use of network flow techniques, and runs in time $O(n^2 \log n)$, where n is the number of vertices of the graph.Expand

It is shown that upward planarity testing and rectilinear planar testing are NP-complete problems and that it is NP-hard to approximate the minimum number of bends in a planar orthogonal drawing of an n-vertex graph with an $O(n^{1-\epsilon})$ error for any $\ep silon > 0$.Expand

This work studies visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments, and considers three types of visibility representations.Expand

We present a collection of new techniques for designing and analyzing e cient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of… Expand

This book incorporates the object-oriented design paradigm, using Java as the implementation language while also providing the fundamental intuition and analysis of each data structure studied.Expand

An efficient technique for on-line planarity testing of a graph is presented that uses O(n) space and supports tests and insertions of vertices and edges in O(\log n) time, where n is the current number of Vertices of G.Expand

A survey of techniques for designing authenticated data structures is presented and their computational efficiency is overview to discuss implementation issues and practical applications.Expand