• Publications
  • Influence
Dynamic provable data possession
We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to anExpand
  • 1,127
  • 88
On Embedding a Graph in the Grid with the Minimum Number of Bends
  • R. Tamassia
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 June 1987
Given a planar graph G together with a planar representation P, a region preserving grid embedding of G is a planar embedding of G in the rectilinear grid that has planar representation isomorphic toExpand
  • 549
  • 72
External-memory graph algorithms
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 ofExpand
  • 366
  • 41
A unified approach to visibility representations of planar graphs
We studyvisibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments. EveryExpand
  • 334
  • 37
On the Computational Complexity of Upward and Rectilinear Planarity Testing
A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the vertical direction and no two edges cross. An undirected graph isExpand
  • 305
  • 35
Data Structures and Algorithms in Java
From the Publisher: Using the power of technology to go beyond the borders of the printed page, Goodrich and Tamassia have created a book that is conceptually elegant and innovative. It incorporatesExpand
  • 317
  • 29
Algorithms for Drawing Graphs: an Annotated Bibliography
Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and diagrams for information systems analysis and design.Expand
  • 947
  • 25
On-Line Planarity Testing
The on-line planarity-testing problem consists of performing the following operations on a planar graph $G$: (i) testing if a new edge can be added to $G$ so that the resulting graph is itselfExpand
  • 218
  • 21
Algorithms for Plane Representations of Acyclic Digraphs
Abstract Acyclic digraphs are widely used for representing hierarchical structures. Examples include PERT networks, subroutine-call graphs, family trees, organization charts, Hasse diagrams, and ISAExpand
  • 227
  • 20
Algorithm design - foundations, analysis and internet examples
PART I: FUNDAMENTAL TOOLS. Algorithm Analysis. Basic Data Structures. Search Trees and Skip Lists. Sorting, Sets, and Selection. Fundamental Techniques. PART II: GRAPH ALGORITHMS. Graphs. WeightedExpand
  • 233
  • 18