Search the dblp DataBase
Roberto Tamassia :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Roberto Tamassia , Carlo Batini , Maurizio Talamo An Algorithm for Automatic Layout of Entity-Relationship Diagrams. [Citation Graph (6, 3)][DBLP ] ER, 1983, pp:421-439 [Conf ] Carlo Batini , Enrico Nardelli , Roberto Tamassia A Layout Algorithm for Data Flow Diagrams. [Citation Graph (5, 0)][DBLP ] IEEE Trans. Software Eng., 1986, v:12, n:4, pp:538-546 [Journal ] Roberto Tamassia New Layout Techniques for Entity-Relationship Diagrams. [Citation Graph (3, 8)][DBLP ] ER, 1985, pp:304-311 [Conf ] Roberto Tamassia On Embedding a Graph in the Grid with the Minimum Number of Bends. [Citation Graph (3, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:3, pp:421-444 [Journal ] Peter Bro Miltersen , Sairam Subramanian , Jeffrey Scott Vitter , Roberto Tamassia Complexity Models for Incremental Computation. [Citation Graph (3, 0)][DBLP ] Theor. Comput. Sci., 1994, v:130, n:1, pp:203-236 [Journal ] Giuseppe Di Battista , Hannu Kangassalo , Roberto Tamassia Definition Libraries for Conceptual Modelling. [Citation Graph (2, 8)][DBLP ] ER, 1988, pp:251-267 [Conf ] Giuseppe Di Battista , Roberto Tamassia Algorithms for Plane Representations of Acyclic Digraphs. [Citation Graph (2, 0)][DBLP ] Theor. Comput. Sci., 1988, v:61, n:, pp:175-198 [Journal ] Sairam Sairam , Jeffrey Scott Vitter , Roberto Tamassia A Complexity Theoretic Approach to Incremental Computation. [Citation Graph (1, 0)][DBLP ] STACS, 1993, pp:640-649 [Conf ] Roberto Tamassia , Jeffrey Scott Vitter Optimal Cooperative Search in Fractional Cascaded Data Structures. [Citation Graph (1, 0)][DBLP ] Algorithmica, 1996, v:15, n:2, pp:154-171 [Journal ] Giuseppe Di Battista , Hannu Kangassalo , Roberto Tamassia Definition Libraries for Conceptual Modelling. [Citation Graph (1, 0)][DBLP ] Data Knowl. Eng., 1989, v:4, n:, pp:245-260 [Journal ] Michael T. Goodrich , Mikhail J. Atallah , Roberto Tamassia Indexing Information for Data Forensics. [Citation Graph (0, 0)][DBLP ] ACNS, 2005, pp:206-221 [Conf ] Michael T. Goodrich , Mark Handy , Benoît Hudson , Roberto Tamassia Accessing the Internal Organization of Data Structures in the JDSL Library. [Citation Graph (0, 0)][DBLP ] ALENEX, 1999, pp:124-139 [Conf ] James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia Algorithm animation over the World Wide Web. [Citation Graph (0, 0)][DBLP ] AVI, 1996, pp:203-212 [Conf ] James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia The Mocha algorithm animation system. [Citation Graph (0, 0)][DBLP ] AVI, 1996, pp:248-250 [Conf ] Bruno Codenotti , Roberto Tamassia Efficient Reconfiguration of VLSI Arrays. [Citation Graph (0, 0)][DBLP ] AWOC, 1988, pp:191-200 [Conf ] Goos Kant , Giuseppe Liotta , Roberto Tamassia , Ioannis G. Tollis Area Requirement of Visibility Representations of Trees. [Citation Graph (0, 0)][DBLP ] CCCG, 1993, pp:192-197 [Conf ] Roberto Tamassia , Giuseppe Liotta , Franco P. Preparata Robust Proximity Queries in Implicit Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] CCCG, 1996, pp:1-1 [Conf ] Michael T. Goodrich , Roberto Tamassia , Danfeng Yao Accredited DomainKeys: A Service Architecture for Improved Email Validation. [Citation Graph (0, 0)][DBLP ] CEAS, 2005, pp:- [Conf ] Giuseppe Liotta , Roberto Tamassia , Ioannis G. Tollis , Paola Vocca Area Requirement of Gabriel Drawings. [Citation Graph (0, 0)][DBLP ] CIAC, 1997, pp:135-146 [Conf ] Ashim Garg , Roberto Tamassia Advances in Graph Drawing. [Citation Graph (0, 0)][DBLP ] CIAC, 1994, pp:12-21 [Conf ] Giuseppe Di Battista , Roberto Tamassia , Luca Vismara Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1996, pp:81-91 [Conf ] James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia Animating Geometric Algorithms Over the Web. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-3 [Conf ] Gill Barequet , Stina S. Bridgeman , Christian A. Duncan , Michael T. Goodrich , Roberto Tamassia Classical Computational Geometry in GeomNet. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1997, pp:412-414 [Conf ] Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Roberto Tamassia , Emanuele Tassinari , Francesco Vargiu An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1995, pp:306-315 [Conf ] Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis Area Requirement and Symmetry Display in Drawing Graphs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1989, pp:51-60 [Conf ] Yi-Jen Chiang , Roberto Tamassia Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1991, pp:61-70 [Conf ] Marek Chrobak , Michael T. Goodrich , Roberto Tamassia Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:319-328 [Conf ] Robert F. Cohen , Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis , Paola Bertolazzi A Framework for Dynamic Graph Drawing. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1992, pp:261-270 [Conf ] Ashim Garg , Michael T. Goodrich , Roberto Tamassia Area-Efficient Upward Tree Drawings. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:359-368 [Conf ] Michael T. Goodrich , Roberto Tamassia Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1993, pp:318-327 [Conf ] Giuseppe Liotta , Franco P. Preparata , Roberto Tamassia Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1997, pp:156-165 [Conf ] Michael T. Goodrich , Jonathan Z. Sun , Roberto Tamassia Efficient Tree-Based Revocation in Groups of Low-State Devices. [Citation Graph (0, 0)][DBLP ] CRYPTO, 2004, pp:511-527 [Conf ] Michael T. Goodrich , Roberto Tamassia , Nikos Triandopoulos , Robert F. Cohen Authenticated Data Structures for Graph and Geometric Searching. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2003, pp:295-313 [Conf ] Michael T. Goodrich , Roberto Tamassia , Danfeng Yao Notarized Federated Identity Management for Web Services. [Citation Graph (0, 0)][DBLP ] DBSec, 2006, pp:133-147 [Conf ] Michael T. Goodrich , Michael Shin , Christian D. Straub , Roberto Tamassia Distributed Data Authenication (System Demonstration). [Citation Graph (0, 0)][DBLP ] DISCEX (2), 2003, pp:58-59 [Conf ] Michael T. Goodrich , Roberto Tamassia Efficient and Scalable Infrastructure Support for Dynamic Coalitions. [Citation Graph (0, 0)][DBLP ] DISCEX (2), 2003, pp:246-251 [Conf ] Paola Bertolazzi , Giuseppe Di Battista , Carlo Mannino , Roberto Tamassia Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP ] ESA, 1993, pp:37-48 [Conf ] Yi-Jen Chiang , Roberto Tamassia Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ESA, 1994, pp:266-277 [Conf ] Robert F. Cohen , Roberto Tamassia Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ESA, 1993, pp:97-108 [Conf ] Ashim Garg , Roberto Tamassia Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ESA, 1994, pp:12-23 [Conf ] Ashim Garg , Roberto Tamassia , Paola Vocca Drawing with Colors (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ESA, 1996, pp:12-26 [Conf ] Maurizio Pizzonia , Roberto Tamassia Minimum Depth Graph Embedding. [Citation Graph (0, 0)][DBLP ] ESA, 2000, pp:356-367 [Conf ] Roberto Tamassia Authenticated Data Structures. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:2-5 [Conf ] Mikhail J. Atallah , Keith B. Frikken , Michael T. Goodrich , Roberto Tamassia Secure Biometric Authentication for Weak Computational Devices. [Citation Graph (0, 0)][DBLP ] Financial Cryptography, 2005, pp:357-371 [Conf ] Giuseppe Di Battista , Roberto Tamassia Incremental Planarity Testing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:436-441 [Conf ] Arkady Kanevsky , Roberto Tamassia , Giuseppe Di Battista , Jianer Chen On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:793-801 [Conf ] Franco P. Preparata , Roberto Tamassia Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1988, pp:558-567 [Conf ] Stina S. Bridgeman , Roberto Tamassia Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1998, pp:57-71 [Conf ] Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Armando Parise , Roberto Tamassia , Emanuele Tassinari , Francesco Vargiu , Luca Vismara Drawing Directed Acyclic Graphs: An Experimental Study. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1996, pp:76-91 [Conf ] Ulrik Brandes , Galina Shubina , Roberto Tamassia , Dorothea Wagner Fast Layout Methods for Timetable Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2000, pp:127-138 [Conf ] Stina S. Bridgeman , Giuseppe Di Battista , Walter Didimo , Giuseppe Liotta , Roberto Tamassia , Luca Vismara Turn-Regularity and Planar Orthogonal Drawings. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1999, pp:8-26 [Conf ] Stina S. Bridgeman , Jody Fanto , Ashim Garg , Roberto Tamassia , Luca Vismara InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1997, pp:303-308 [Conf ] Stina S. Bridgeman , Ashim Garg , Roberto Tamassia A Graph Drawing and Translation Service on the WWW. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1996, pp:45-52 [Conf ] Stina S. Bridgeman , Roberto Tamassia A User Study in Similarity Measures for Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2000, pp:19-30 [Conf ] Stina S. Bridgeman , Roberto Tamassia The Graph Drawing Server. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2001, pp:448-450 [Conf ] Timothy M. Chan , Michael T. Goodrich , S. Rao Kosaraju , Roberto Tamassia Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1996, pp:63-75 [Conf ] Benjamin Finkel , Roberto Tamassia Curvilinear Graph Drawing Using the Force-Directed Method. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2004, pp:448-453 [Conf ] Ashim Garg , Roberto Tamassia On the Compuational Complexity of Upward and Rectilinear Planarity Testing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1994, pp:286-297 [Conf ] Ashim Garg , Roberto Tamassia GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1996, pp:193-200 [Conf ] Ashim Garg , Roberto Tamassia A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1996, pp:201-216 [Conf ] Natasha Gelfand , Roberto Tamassia Algorithmic Patterns for Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1998, pp:138-152 [Conf ] Giuseppe Di Battista , Roberto Tamassia On-Line Graph Algorithms with SPQR-Trees. [Citation Graph (0, 0)][DBLP ] ICALP, 1990, pp:598-611 [Conf ] Roberto Tamassia A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1988, pp:576-590 [Conf ] Roberto Tamassia , Nikos Triandopoulos Computational Bounds on Hierarchical Data Processing with Applications to Information Security. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:153-165 [Conf ] Danfeng Yao , Keith B. Frikken , Mikhail J. Atallah , Roberto Tamassia Point-Based Trust: Define How Much Privacy Is Worth. [Citation Graph (0, 0)][DBLP ] ICICS, 2006, pp:190-209 [Conf ] Robert F. Cohen , Sairam Sairam , Roberto Tamassia , Jeffrey Scott Vitter Dynamic algorithms for optimization problems in bounded tree-width graphs. [Citation Graph (0, 0)][DBLP ] IPCO, 1993, pp:99-112 [Conf ] Roberto Tamassia Implementing Algorithms and Data Structures: An Educational and Research Perspective. [Citation Graph (0, 0)][DBLP ] ISAAC, 1998, pp:4-8 [Conf ] Aris Anagnostopoulos , Michael T. Goodrich , Roberto Tamassia Persistent Authenticated Dictionaries and Their Applications. [Citation Graph (0, 0)][DBLP ] ISC, 2001, pp:379-393 [Conf ] Michael T. Goodrich , Roberto Tamassia , Jasminka Hasic An Efficient Dynamic and Distributed Cryptographic Accumulator. [Citation Graph (0, 0)][DBLP ] ISC, 2002, pp:372-388 [Conf ] Michael T. Goodrich , Michael Shin , Roberto Tamassia , William H. Winsborough Authenticated Dictionaries for Fresh Attribute Credentials. [Citation Graph (0, 0)][DBLP ] iTrust, 2003, pp:332-347 [Conf ] Danfeng Yao , Yunhua Koglin , Elisa Bertino , Roberto Tamassia Decentralized authorization and data security in web content delivery. [Citation Graph (0, 0)][DBLP ] SAC, 2007, pp:1654-1661 [Conf ] Roberto Tamassia , Danfeng Yao , William H. Winsborough Role-based cascaded delegation. [Citation Graph (0, 0)][DBLP ] SACMAT, 2004, pp:146-155 [Conf ] Ryan Shaun Baker , Michael Boilen , Michael T. Goodrich , Roberto Tamassia , B. Aaron Stibel Testers and visualizers for teaching data structures. [Citation Graph (0, 0)][DBLP ] SIGCSE, 1999, pp:261-265 [Conf ] Stina S. Bridgeman , Michael T. Goodrich , Stephen G. Kobourov , Roberto Tamassia PILOT: an interactive tool for learning and grading. [Citation Graph (0, 0)][DBLP ] SIGCSE, 2000, pp:139-143 [Conf ] Stina S. Bridgeman , Michael T. Goodrich , Stephen G. Kobourov , Roberto Tamassia SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX. [Citation Graph (0, 0)][DBLP ] SIGCSE, 2000, pp:300-304 [Conf ] David Emory , Roberto Tamassia JERPA: a distance-learning environment for introductory Java programming courses. [Citation Graph (0, 0)][DBLP ] SIGCSE, 2002, pp:307-311 [Conf ] Natasha Gelfand , Michael T. Goodrich , Roberto Tamassia Teaching data structure design patterns. [Citation Graph (0, 0)][DBLP ] SIGCSE, 1998, pp:331-335 [Conf ] Michael T. Goodrich , Roberto Tamassia Teaching internet algorithmics. [Citation Graph (0, 0)][DBLP ] SIGCSE, 2001, pp:129-133 [Conf ] Michael T. Goodrich , Roberto Tamassia Teaching the analysis of algorithms with visual proofs. [Citation Graph (0, 0)][DBLP ] SIGCSE, 1998, pp:207-211 [Conf ] Michael T. Goodrich , Roberto Tamassia Using randomization in the teaching of data structures and algorithms. [Citation Graph (0, 0)][DBLP ] SIGCSE, 1999, pp:53-57 [Conf ] Yi-Jen Chiang , Michael T. Goodrich , Edward F. Grove , Roberto Tamassia , Darren Erik Vengroff , Jeffrey Scott Vitter External-Memory Graph Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1995, pp:139-149 [Conf ] Yi-Jen Chiang , Franco P. Preparata , Roberto Tamassia A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. [Citation Graph (0, 0)][DBLP ] SODA, 1993, pp:44-53 [Conf ] Robert F. Cohen , Roberto Tamassia Dynamic Expression Trees and their Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SODA, 1991, pp:52-61 [Conf ] David Eppstein , Giuseppe F. Italiano , Roberto Tamassia , Robert Endre Tarjan , Jeffery Westbrook , Moti Yung Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. [Citation Graph (0, 0)][DBLP ] SODA, 1990, pp:1-11 [Conf ] Anna Lysyanskaya , Roberto Tamassia , Nikos Triandopoulos Multicast Authentication in Fully Adversarial Networks. [Citation Graph (0, 0)][DBLP ] IEEE Symposium on Security and Privacy, 2004, pp:241-0 [Conf ] Roberto Tamassia , Jeffrey Scott Vitter Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures. [Citation Graph (0, 0)][DBLP ] SPAA, 1989, pp:399-408 [Conf ] Roberto Tamassia , Jeffrey Scott Vitter Optimal Cooperative Search in Fractional Cascaded Data Structures. [Citation Graph (0, 0)][DBLP ] SPAA, 1990, pp:307-316 [Conf ] Sairam Sairam , Roberto Tamassia , Jeffrey Scott Vitter A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. [Citation Graph (0, 0)][DBLP ] SPDP, 1992, pp:176-183 [Conf ] Franco P. Preparata , Roberto Tamassia Dynamic Planar Point Location with Optimal Query Time. [Citation Graph (0, 0)][DBLP ] STACS, 1989, pp:84-95 [Conf ] Roberto Tamassia , Ioannis G. Tollis Algorithms for Visibility Representations of Planar Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 1986, pp:130-141 [Conf ] Robert F. Cohen , Giuseppe Di Battista , Arkady Kanevsky , Roberto Tamassia Reinventing the wheel: an optimal data structure for connectivity queries. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:194-200 [Conf ] Michael T. Goodrich , Roberto Tamassia Dynamic Trees and Dynamic Point Location (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1991, pp:523-533 [Conf ] Paola Bertolazzi , Robert F. Cohen , Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis How to Draw a Series-Parallel Digraph (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1992, pp:272-283 [Conf ] Danfeng Yao , Michael Shin , Roberto Tamassia , William H. Winsborough Visualization of Automated Trust Negotiation. [Citation Graph (0, 0)][DBLP ] VizSEC, 2005, pp:8- [Conf ] Giuseppe Di Battista , Amadeo Giammarco , Giuseppe Santucci , Roberto Tamassia The Architecture of Diagram Server. [Citation Graph (0, 0)][DBLP ] VL, 1990, pp:60-65 [Conf ] Sean Cannella , Daniel J. Polivy , Michael Shin , Christian D. Straub , Roberto Tamassia Secure Visualization of Authentication Information: A Case Study. [Citation Graph (0, 0)][DBLP ] VL/HCC, 2004, pp:35-37 [Conf ] Olivier Devillers , Giuseppe Liotta , Franco P. Preparata , Roberto Tamassia Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1997, pp:186-199 [Conf ] Franco P. Preparata , Roberto Tamassia Efficient Spatial Point Location (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1989, pp:3-11 [Conf ] Giuseppe Di Battista , Roberto Tamassia Upward Drawings of Acyclic Digraphs. [Citation Graph (0, 0)][DBLP ] WG, 1987, pp:121-133 [Conf ] Giuseppe Di Battista , Roberto Tamassia , Luca Vismara On-Line Convex Plabarity Testing. [Citation Graph (0, 0)][DBLP ] WG, 1994, pp:242-255 [Conf ] Roberto Tamassia , Ioannis G. Tollis Centipede Graphs and Visibility on a Cylinder. [Citation Graph (0, 0)][DBLP ] WG, 1986, pp:252-263 [Conf ] Giuseppe Di Battista , Roberto Tamassia On-Line Maintenance of Triconnected Components with SPQR-Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1996, v:15, n:4, pp:302-318 [Journal ] Giuseppe Di Battista , Roberto Tamassia Guest Editors' Introduction to the Special Issue on Graph Drwaing [Citation Graph (0, 0)][DBLP ] Algorithmica, 1996, v:16, n:1, pp:1-3 [Journal ] Giuseppe Di Battista , Roberto Tamassia , Luca Vismara Output-Sensitive Reporting of Disjoint Paths. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1999, v:23, n:4, pp:302-340 [Journal ] Robert F. Cohen , Roberto Tamassia Dynamic Expression Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1995, v:13, n:3, pp:245-265 [Journal ] Robert F. Cohen , Roberto Tamassia Combine and Conquer. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:3, pp:324-362 [Journal ] Takao Nishizeki , Roberto Tamassia , Dorothea Wagner Foreword. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2000, v:26, n:1, pp:1-2 [Journal ] Sairam Subramanian , Roberto Tamassia , Jeffrey Scott Vitter An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1995, v:14, n:4, pp:322-339 [Journal ] Roberto Tamassia , Franco P. Preparata Dynamic Maintenance of Planar Digraphs, with Applications. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1990, v:5, n:4, pp:509-527 [Journal ] James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia Visualizing geometric algorithms over the Web. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1999, v:12, n:1-2, pp:125-152 [Journal ] Giuseppe Di Battista , Peter Eades , Roberto Tamassia , Ioannis G. Tollis Algorithms for Drawing Graphs: an Annotated Bibliography. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1994, v:4, n:, pp:235-282 [Journal ] Stina S. Bridgeman , Giuseppe Di Battista , Walter Didimo , Giuseppe Liotta , Roberto Tamassia , Luca Vismara Turn-regularity and optimal area drawings of orthogonal representations. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2000, v:16, n:1, pp:53-93 [Journal ] Timothy M. Chan , Michael T. Goodrich , S. Rao Kosaraju , Roberto Tamassia Optimizing area and aspect ration in straight-line orthogonal tree drawings. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2002, v:23, n:2, pp:153-162 [Journal ] Olivier Devillers , Giuseppe Liotta , Franco P. Preparata , Roberto Tamassia Checking the convexity of polytopes and the planarity of subdivisions. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1998, v:11, n:3-4, pp:187-208 [Journal ] Emo Welzl , Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Roberto Tamassia , Emanuele Tassinari , Francesco Vargiu An Experimental Comparison of Four Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1997, v:7, n:, pp:303-325 [Journal ] Roberto Tamassia Constraints in Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP ] Constraints, 1998, v:3, n:1, pp:87-120 [Journal ] James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia A New Model for Algorithm Animation Over the WWW. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 1995, v:27, n:4, pp:568-572 [Journal ] Roberto Tamassia Data Structures. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 1996, v:28, n:1, pp:23-26 [Journal ] Roberto Tamassia Strategic Directions in Computational Geometry. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 1996, v:28, n:4, pp:591-606 [Journal ] Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis Area Requirement and Symmetry Display of Planar Upward Drawings. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1992, v:7, n:, pp:381-401 [Journal ] Roberto Tamassia , Ioannis G. Tollis A Unified Approach a Visibility Representation of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1986, v:1, n:, pp:321-341 [Journal ] Giuseppe Di Battista , Roberto Tamassia , Luca Vismara Incremental Convex Planarity Testing. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:169, n:1, pp:94-126 [Journal ] Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Armando Parise , Roberto Tamassia , Emanuele Tassinari , Francesco Vargiu , Luca Vismara Drawing Directed Acyclic Graphs: An Experimental Study. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2000, v:10, n:6, pp:623-648 [Journal ] Yi-Jen Chiang , Roberto Tamassia Dynamization of the trapezoid method for planar point location in monotone subdivisions. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:311-333 [Journal ] Yi-Jen Chiang , Roberto Tamassia Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:85-121 [Journal ] Paola Bertolazzi , Robert F. Cohen , Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis How to Draw a Series-Parallel Digraph. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1994, v:4, n:4, pp:385-402 [Journal ] Peter Eades , Xuemin Lin , Roberto Tamassia An Algorithm for Drawing a Hierarchical Graph. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:145-156 [Journal ] Ashim Garg , Michael T. Goodrich , Roberto Tamassia Planar upward tree drawings with optimal area. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:333-356 [Journal ] Stina S. Bridgeman , Ashim Garg , Roberto Tamassia A Graph Drawing and Translation Service on the World Wide Web. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1999, v:9, n:4/5, pp:419-446 [Journal ] Roberto Tamassia Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2003, v:13, n:1, pp:3-4 [Journal ] Roberto Tamassia , Luca Vismara A Case Study in Algorithm Engineering for Geometric Computing. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2001, v:11, n:1, pp:15-70 [Journal ] Gill Barequet , Christian A. Duncan , Michael T. Goodrich , Stina S. Bridgeman , Roberto Tamassia GeomNet: Geometric Computing Over the Internet. [Citation Graph (0, 0)][DBLP ] IEEE Internet Computing, 1999, v:3, n:2, pp:21-29 [Journal ] Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis Constrained Visibility Representations of Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:41, n:1, pp:1-7 [Journal ] Goos Kant , Giuseppe Liotta , Roberto Tamassia , Ioannis G. Tollis Area Requirement of Visibility Representations of Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:62, n:2, pp:81-88 [Journal ] Roberto Tamassia An Incremental Reconstruction Method for Dynamic Planar Point Location. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:79-83 [Journal ] Roberto Tamassia , Ioannis G. Tollis , Jeffrey Scott Vitter Lower Bounds for Planar Orthogonal Drawings of Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:39, n:1, pp:35-40 [Journal ] David Eppstein , Giuseppe F. Italiano , Roberto Tamassia , Robert Endre Tarjan , Jeffery Westbrook , Moti Yung Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1992, v:13, n:1, pp:33-54 [Journal ] David Eppstein , Giuseppe F. Italiano , Roberto Tamassia , Robert Endre Tarjan , Jeffery Westbrook , Moti Yung Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1993, v:15, n:1, pp:173- [Journal ] Michael T. Goodrich , Roberto Tamassia Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:23, n:1, pp:51-73 [Journal ] Roberto Tamassia On-Line Planar Graph Embedding. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:21, n:2, pp:201-239 [Journal ] Takao Nishizeki , Roberto Tamassia , Dorothea Wagner Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2001, v:5, n:5, pp:1- [Journal ] Stina S. Bridgeman , Roberto Tamassia Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2000, v:4, n:3, pp:47-74 [Journal ] Stina S. Bridgeman , Roberto Tamassia A User Study in Similarity Measures for Graph Drawing. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2002, v:6, n:3, pp:225-254 [Journal ] Carlo Batini , Maurizio Talamo , Roberto Tamassia Computer aided layout of entity relationship diagrams. [Citation Graph (0, 0)][DBLP ] Journal of Systems and Software, 1984, v:4, n:2-3, pp:163-173 [Journal ] Roberto Tamassia , Ioannis G. Tollis , Jeffrey Scott Vitter A Parallel Algorithm for Planar Orthogonal Grid Drawings. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2000, v:10, n:1, pp:141-150 [Journal ] Giuseppe Di Battista , Roberto Tamassia On-Line Planarity Testing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1996, v:25, n:5, pp:956-997 [Journal ] Paola Bertolazzi , Giuseppe Di Battista , Carlo Mannino , Roberto Tamassia Optimal Upward Planarity Testing of Single-Source Digraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:1, pp:132-169 [Journal ] Yi-Jen Chiang , Franco P. Preparata , Roberto Tamassia A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1996, v:25, n:1, pp:207-233 [Journal ] Robert F. Cohen , Giuseppe Di Battista , Roberto Tamassia , Ioannis G. Tollis Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:5, pp:970-1001 [Journal ] Ashim Garg , Roberto Tamassia On the Computational Complexity of Upward and Rectilinear Planarity Testing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:2, pp:601-625 [Journal ] Michael T. Goodrich , Roberto Tamassia Dynamic Trees and Dynamic Point Location. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:2, pp:612-636 [Journal ] Giuseppe Liotta , Franco P. Preparata , Roberto Tamassia Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:3, pp:864-889 [Journal ] Franco P. Preparata , Roberto Tamassia Fully Dynamic Point Location in a Monotone Subdivision. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:4, pp:811-830 [Journal ] Franco P. Preparata , Roberto Tamassia Efficient Point Location in a Convex Spatial Cell-Complex. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:2, pp:267-280 [Journal ] Roberto Tamassia , Jeffrey Scott Vitter Parallel Transitive Closure and Point Location in Planar Structures. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:4, pp:708-725 [Journal ] Roberto Tamassia , Ioannis G. Tollis Representations of Graphs on a Cylinder. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1991, v:4, n:1, pp:139-149 [Journal ] Luca Vismara , Giuseppe Di Battista , Ashim Garg , Giuseppe Liotta , Roberto Tamassia , Francesco Vargiu Experimental studies on graph drawing algorithms. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 2000, v:30, n:11, pp:1235-1284 [Journal ] Bruno Codenotti , Roberto Tamassia A Network Flow Approach to the Reconfiguration of VLSI Arrays. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1991, v:40, n:1, pp:118-121 [Journal ] Franco P. Preparata , Roberto Tamassia Dynamic Planar Point Location with Optimal Query Time. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1990, v:74, n:1, pp:95-114 [Journal ] Roberto Tamassia Advances in the Theory and Practice of Graph Drawing. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:217, n:2, pp:235-254 [Journal ] Roberto Tamassia , Ioannis G. Tollis Dynamic Reachability in Planar Digraphs with One Source and One Sink. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:119, n:2, pp:331-343 [Journal ] Roberto Tamassia , Nikos Triandopoulos Efficient Content Authentication in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP ] ACNS, 2007, pp:354-372 [Conf ] Isabel F. Cruz , Roberto Tamassia , Danfeng Yao Privacy-Preserving Schema Matching Using Mutual Information. [Citation Graph (0, 0)][DBLP ] DBSec, 2007, pp:93-94 [Conf ] Charalampos Papamanthou , Roberto Tamassia Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. [Citation Graph (0, 0)][DBLP ] ICICS, 2007, pp:1-15 [Conf ] Michael T. Goodrich , Charalampos Papamanthou , Roberto Tamassia On the Cost of Persistence and Authentication in Skip Lists. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:94-107 [Conf ] Algorithms for Location Estimation Based on RSSI Sampling. [Citation Graph (, )][DBLP ] Authenticated hash tables. [Citation Graph (, )][DBLP ] Dynamic provable data possession. [Citation Graph (, )][DBLP ] Super-Efficient Verification of Dynamic Outsourced Databases. [Citation Graph (, )][DBLP ] Continuous probabilistic nearest-neighbor queries for uncertain trajectories. [Citation Graph (, )][DBLP ] Graph Drawing for Security Visualization. [Citation Graph (, )][DBLP ] Dynamics-aware similarity of moving objects trajectories. [Citation Graph (, )][DBLP ] Athos: Efficient Authentication of Outsourced File Systems. [Citation Graph (, )][DBLP ] A Role and Attribute Based Access Control System Using Semantic Web Technologies. [Citation Graph (, )][DBLP ] Lower bounds and parallel algorithms for planar orthogonal grid drawings. [Citation Graph (, )][DBLP ] Effective Visualization of File System Access-Control. [Citation Graph (, )][DBLP ] Authenticating distributed data using Web services and XML signatures. [Citation Graph (, )][DBLP ] Alternating multiple tributaries + deltas. [Citation Graph (, )][DBLP ] Efficient integrity checking of untrusted network storage. [Citation Graph (, )][DBLP ] Certification and Authentication of Data Structures. [Citation Graph (, )][DBLP ] An Efficient Dynamic and Distributed RSA Accumulator [Citation Graph (, )][DBLP ] Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems [Citation Graph (, )][DBLP ] Search in 0.034secs, Finished in 0.047secs