2009 |
190 | EE | Goce Trajcevski,
Roberto Tamassia,
Hui Ding,
Peter Scheuermann,
Isabel F. Cruz:
Continuous probabilistic nearest-neighbor queries for uncertain trajectories.
EDBT 2009: 874-885 |
189 | EE | Danfeng Yao,
Roberto Tamassia:
Compact and Anonymous Role-Based Authorization Chain.
ACM Trans. Inf. Syst. Secur. 12(3): (2009) |
2008 |
188 | EE | Charalampos Papamanthou,
Roberto Tamassia,
Nikos Triandopoulos:
Authenticated hash tables.
ACM Conference on Computer and Communications Security 2008: 437-448 |
187 | EE | Charalampos Papamanthou,
Franco P. Preparata,
Roberto Tamassia:
Algorithms for Location Estimation Based on RSSI Sampling.
ALGOSENSORS 2008: 72-86 |
186 | EE | Michael T. Goodrich,
Roberto Tamassia,
Nikos Triandopoulos:
Super-Efficient Verification of Dynamic Outsourced Databases.
CT-RSA 2008: 407-424 |
185 | EE | Goce Trajcevski,
Oliviu Ghica,
Peter Scheuermann,
Roberto Tamassia,
Isabel F. Cruz:
Alternating multiple tributaries + deltas.
DMSN 2008: 28-34 |
184 | EE | Roberto Tamassia,
Bernardo Palazzi,
Charalampos Papamanthou:
Graph Drawing for Security Visualization.
Graph Drawing 2008: 2-13 |
183 | EE | Michael T. Goodrich,
Charalampos Papamanthou,
Roberto Tamassia,
Nikos Triandopoulos:
Athos: Efficient Authentication of Outsourced File Systems.
ISC 2008: 80-96 |
182 | EE | Alexander Heitzmann,
Bernardo Palazzi,
Charalampos Papamanthou,
Roberto Tamassia:
Efficient integrity checking of untrusted network storage.
StorageSS 2008: 43-54 |
181 | EE | Alexander Heitzmann,
Bernardo Palazzi,
Charalampos Papamanthou,
Roberto Tamassia:
Effective Visualization of File System Access-Control.
VizSEC 2008: 18-25 |
180 | EE | Camil Demetrescu,
Roberto Tamassia:
Papers from ALENEX 2005.
ACM Journal of Experimental Algorithmics 12: (2008) |
179 | EE | Danfeng Yao,
Keith B. Frikken,
Mikhail J. Atallah,
Roberto Tamassia:
Private Information: To Reveal or not to Reveal.
ACM Trans. Inf. Syst. Secur. 12(1): (2008) |
178 | EE | Michael T. Goodrich,
Roberto Tamassia,
Danfeng (Daphne) Yao:
Notarized federated ID management and authentication.
Journal of Computer Security 16(4): 399-418 (2008) |
177 | EE | Nancy M. Amato,
Der-Tsai Lee,
Andrea Pietracaprina,
Roberto Tamassia:
Preface.
Theor. Comput. Sci. 408(2-3): 97-98 (2008) |
2007 |
176 | EE | Roberto Tamassia,
Nikos Triandopoulos:
Efficient Content Authentication in Peer-to-Peer Networks.
ACNS 2007: 354-372 |
175 | EE | Isabel F. Cruz,
Roberto Tamassia,
Danfeng Yao:
Privacy-Preserving Schema Matching Using Mutual Information.
DBSec 2007: 93-94 |
174 | EE | Goce Trajcevski,
Hui Ding,
Peter Scheuermann,
Roberto Tamassia,
Dennis Vaccaro:
Dynamics-aware similarity of moving objects trajectories.
GIS 2007: 11 |
173 | EE | Charalampos Papamanthou,
Roberto Tamassia:
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures.
ICICS 2007: 1-15 |
172 | EE | Lorenzo Cirio,
Isabel F. Cruz,
Roberto Tamassia:
A Role and Attribute Based Access Control System Using Semantic Web Technologies.
OTM Workshops (2) 2007: 1256-1266 |
171 | EE | Danfeng Yao,
Yunhua Koglin,
Elisa Bertino,
Roberto Tamassia:
Decentralized authorization and data security in web content delivery.
SAC 2007: 1654-1661 |
170 | EE | Michael T. Goodrich,
Charalampos Papamanthou,
Roberto Tamassia:
On the Cost of Persistence and Authentication in Skip Lists.
WEA 2007: 94-107 |
2006 |
169 | EE | Michael T. Goodrich,
Roberto Tamassia,
Danfeng Yao:
Notarized Federated Identity Management for Web Services.
DBSec 2006: 133-147 |
168 | EE | Danfeng Yao,
Keith B. Frikken,
Mikhail J. Atallah,
Roberto Tamassia:
Point-Based Trust: Define How Much Privacy Is Worth.
ICICS 2006: 190-209 |
2005 |
167 | | Camil Demetrescu,
Robert Sedgewick,
Roberto Tamassia:
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005
SIAM 2005 |
166 | EE | Michael T. Goodrich,
Mikhail J. Atallah,
Roberto Tamassia:
Indexing Information for Data Forensics.
ACNS 2005: 206-221 |
165 | EE | Michael T. Goodrich,
Roberto Tamassia,
Danfeng Yao:
Accredited DomainKeys: A Service Architecture for Improved Email Validation.
CEAS 2005 |
164 | EE | Mikhail J. Atallah,
Keith B. Frikken,
Michael T. Goodrich,
Roberto Tamassia:
Secure Biometric Authentication for Weak Computational Devices.
Financial Cryptography 2005: 357-371 |
163 | EE | Roberto Tamassia,
Nikos Triandopoulos:
Computational Bounds on Hierarchical Data Processing with Applications to Information Security.
ICALP 2005: 153-165 |
162 | EE | Danfeng Yao,
Michael Shin,
Roberto Tamassia,
William H. Winsborough:
Visualization of Automated Trust Negotiation.
VizSEC 2005: 8 |
2004 |
161 | EE | Michael T. Goodrich,
Jonathan Z. Sun,
Roberto Tamassia:
Efficient Tree-Based Revocation in Groups of Low-State Devices.
CRYPTO 2004: 511-527 |
160 | EE | Benjamin Finkel,
Roberto Tamassia:
Curvilinear Graph Drawing Using the Force-Directed Method.
Graph Drawing 2004: 448-453 |
159 | EE | Anna Lysyanskaya,
Roberto Tamassia,
Nikos Triandopoulos:
Multicast Authentication in Fully Adversarial Networks.
IEEE Symposium on Security and Privacy 2004: 241- |
158 | EE | Roberto Tamassia,
Danfeng Yao,
William H. Winsborough:
Role-based cascaded delegation.
SACMAT 2004: 146-155 |
157 | EE | Sean Cannella,
Daniel J. Polivy,
Michael Shin,
Christian D. Straub,
Roberto Tamassia:
Secure Visualization of Authentication Information: A Case Study.
VL/HCC 2004: 35-37 |
2003 |
156 | EE | Michael T. Goodrich,
Roberto Tamassia,
Nikos Triandopoulos,
Robert F. Cohen:
Authenticated Data Structures for Graph and Geometric Searching.
CT-RSA 2003: 295-313 |
155 | EE | Michael T. Goodrich,
Roberto Tamassia:
Efficient and Scalable Infrastructure Support for Dynamic Coalitions.
DISCEX (2) 2003: 246-251 |
154 | EE | Michael T. Goodrich,
Michael Shin,
Christian D. Straub,
Roberto Tamassia:
Distributed Data Authenication (System Demonstration).
DISCEX (2) 2003: 58-59 |
153 | EE | Roberto Tamassia:
Authenticated Data Structures.
ESA 2003: 2-5 |
152 | EE | Michael T. Goodrich,
Michael Shin,
Roberto Tamassia,
William H. Winsborough:
Authenticated Dictionaries for Fresh Attribute Credentials.
iTrust 2003: 332-347 |
151 | EE | Roberto Tamassia:
Guest Editor's Foreword.
Int. J. Comput. Geometry Appl. 13(1): 3-4 (2003) |
2002 |
150 | EE | Michael T. Goodrich,
Roberto Tamassia,
Jasminka Hasic:
An Efficient Dynamic and Distributed Cryptographic Accumulator.
ISC 2002: 372-388 |
149 | EE | David Emory,
Roberto Tamassia:
JERPA: a distance-learning environment for introductory Java programming courses.
SIGCSE 2002: 307-311 |
148 | EE | Daniel J. Polivy,
Roberto Tamassia:
Authenticating distributed data using Web services and XML signatures.
XML Security 2002: 80-89 |
147 | | Timothy M. Chan,
Michael T. Goodrich,
S. Rao Kosaraju,
Roberto Tamassia:
Optimizing area and aspect ration in straight-line orthogonal tree drawings.
Comput. Geom. 23(2): 153-162 (2002) |
146 | EE | Stina S. Bridgeman,
Roberto Tamassia:
A User Study in Similarity Measures for Graph Drawing.
J. Graph Algorithms Appl. 6(3): 225-254 (2002) |
2001 |
145 | | Frank K. H. A. Dehne,
Jörg-Rüdiger Sack,
Roberto Tamassia:
Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings
Springer 2001 |
144 | EE | Stina S. Bridgeman,
Roberto Tamassia:
The Graph Drawing Server.
Graph Drawing 2001: 448-450 |
143 | EE | Aris Anagnostopoulos,
Michael T. Goodrich,
Roberto Tamassia:
Persistent Authenticated Dictionaries and Their Applications.
ISC 2001: 379-393 |
142 | EE | Michael T. Goodrich,
Roberto Tamassia:
Teaching internet algorithmics.
SIGCSE 2001: 129-133 |
141 | | Giuseppe Di Battista,
Roberto Tamassia,
Luca Vismara:
Incremental Convex Planarity Testing.
Inf. Comput. 169(1): 94-126 (2001) |
140 | | Roberto Tamassia,
Luca Vismara:
A Case Study in Algorithm Engineering for Geometric Computing.
Int. J. Comput. Geometry Appl. 11(1): 15-70 (2001) |
139 | EE | Takao Nishizeki,
Roberto Tamassia,
Dorothea Wagner:
Guest Editors' Foreword.
J. Graph Algorithms Appl. 5(5): 1 (2001) |
138 | EE | Ashim Garg,
Roberto Tamassia:
On the Computational Complexity of Upward and Rectilinear Planarity Testing.
SIAM J. Comput. 31(2): 601-625 (2001) |
2000 |
137 | | Maurizio Pizzonia,
Roberto Tamassia:
Minimum Depth Graph Embedding.
ESA 2000: 356-367 |
136 | EE | Ulrik Brandes,
Galina Shubina,
Roberto Tamassia,
Dorothea Wagner:
Fast Layout Methods for Timetable Graphs.
Graph Drawing 2000: 127-138 |
135 | EE | Stina S. Bridgeman,
Roberto Tamassia:
A User Study in Similarity Measures for Graph Drawing.
Graph Drawing 2000: 19-30 |
134 | EE | Stina S. Bridgeman,
Michael T. Goodrich,
Stephen G. Kobourov,
Roberto Tamassia:
PILOT: an interactive tool for learning and grading.
SIGCSE 2000: 139-143 |
133 | EE | Stina S. Bridgeman,
Michael T. Goodrich,
Stephen G. Kobourov,
Roberto Tamassia:
SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX.
SIGCSE 2000: 300-304 |
132 | EE | Takao Nishizeki,
Roberto Tamassia,
Dorothea Wagner:
Foreword.
Algorithmica 26(1): 1-2 (2000) |
131 | | Stina S. Bridgeman,
Giuseppe Di Battista,
Walter Didimo,
Giuseppe Liotta,
Roberto Tamassia,
Luca Vismara:
Turn-regularity and optimal area drawings of orthogonal representations.
Comput. Geom. 16(1): 53-93 (2000) |
130 | | Giuseppe Di Battista,
Ashim Garg,
Giuseppe Liotta,
Armando Parise,
Roberto Tamassia,
Emanuele Tassinari,
Francesco Vargiu,
Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study.
Int. J. Comput. Geometry Appl. 10(6): 623-648 (2000) |
129 | EE | Stina S. Bridgeman,
Roberto Tamassia:
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms.
J. Graph Algorithms Appl. 4(3): 47-74 (2000) |
128 | | Roberto Tamassia,
Ioannis G. Tollis,
Jeffrey Scott Vitter:
A Parallel Algorithm for Planar Orthogonal Grid Drawings.
Parallel Processing Letters 10(1): 141-150 (2000) |
127 | | Luca Vismara,
Giuseppe Di Battista,
Ashim Garg,
Giuseppe Liotta,
Roberto Tamassia,
Francesco Vargiu:
Experimental studies on graph drawing algorithms.
Softw., Pract. Exper. 30(11): 1235-1284 (2000) |
1999 |
126 | | Giuseppe Di Battista,
Peter Eades,
Roberto Tamassia,
Ioannis G. Tollis:
Graph Drawing: Algorithms for the Visualization of Graphs
Prentice-Hall 1999 |
125 | | Frank K. H. A. Dehne,
Arvind Gupta,
Jörg-Rüdiger Sack,
Roberto Tamassia:
Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings
Springer 1999 |
124 | EE | Michael T. Goodrich,
Mark Handy,
Benoît Hudson,
Roberto Tamassia:
Accessing the Internal Organization of Data Structures in the JDSL Library.
ALENEX 1999: 124-139 |
123 | EE | Stina S. Bridgeman,
Giuseppe Di Battista,
Walter Didimo,
Giuseppe Liotta,
Roberto Tamassia,
Luca Vismara:
Turn-Regularity and Planar Orthogonal Drawings.
Graph Drawing 1999: 8-26 |
122 | EE | Ryan Shaun Baker,
Michael Boilen,
Michael T. Goodrich,
Roberto Tamassia,
B. Aaron Stibel:
Testers and visualizers for teaching data structures.
SIGCSE 1999: 261-265 |
121 | EE | Michael T. Goodrich,
Roberto Tamassia:
Using randomization in the teaching of data structures and algorithms.
SIGCSE 1999: 53-57 |
120 | EE | Giuseppe Di Battista,
Roberto Tamassia,
Luca Vismara:
Output-Sensitive Reporting of Disjoint Paths.
Algorithmica 23(4): 302-340 (1999) |
119 | | James E. Baker,
Isabel F. Cruz,
Giuseppe Liotta,
Roberto Tamassia:
Visualizing geometric algorithms over the Web.
Comput. Geom. 12(1-2): 125-152 (1999) |
118 | | Gill Barequet,
Christian A. Duncan,
Michael T. Goodrich,
Stina S. Bridgeman,
Roberto Tamassia:
GeomNet: Geometric Computing Over the Internet.
IEEE Internet Computing 3(2): 21-29 (1999) |
117 | | Stina S. Bridgeman,
Ashim Garg,
Roberto Tamassia:
A Graph Drawing and Translation Service on the World Wide Web.
Int. J. Comput. Geometry Appl. 9(4/5): 419-446 (1999) |
116 | EE | Roberto Tamassia:
Advances in the Theory and Practice of Graph Drawing.
Theor. Comput. Sci. 217(2): 235-254 (1999) |
1998 |
115 | EE | Natasha Gelfand,
Roberto Tamassia:
Algorithmic Patterns for Orthogonal Graph Drawing.
Graph Drawing 1998: 138-152 |
114 | EE | Stina S. Bridgeman,
Roberto Tamassia:
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms.
Graph Drawing 1998: 57-71 |
113 | EE | Roberto Tamassia:
Implementing Algorithms and Data Structures: An Educational and Research Perspective.
ISAAC 1998: 4-8 |
112 | EE | Michael T. Goodrich,
Roberto Tamassia:
Teaching the analysis of algorithms with visual proofs.
SIGCSE 1998: 207-211 |
111 | EE | Natasha Gelfand,
Michael T. Goodrich,
Roberto Tamassia:
Teaching data structure design patterns.
SIGCSE 1998: 331-335 |
110 | | Olivier Devillers,
Giuseppe Liotta,
Franco P. Preparata,
Roberto Tamassia:
Checking the convexity of polytopes and the planarity of subdivisions.
Comput. Geom. 11(3-4): 187-208 (1998) |
109 | | Roberto Tamassia:
Constraints in Graph Drawing Algorithms.
Constraints 3(1): 87-120 (1998) |
108 | | Paola Bertolazzi,
Giuseppe Di Battista,
Carlo Mannino,
Roberto Tamassia:
Optimal Upward Planarity Testing of Single-Source Digraphs.
SIAM J. Comput. 27(1): 132-169 (1998) |
107 | | Michael T. Goodrich,
Roberto Tamassia:
Dynamic Trees and Dynamic Point Location.
SIAM J. Comput. 28(2): 612-636 (1998) |
106 | | Giuseppe Liotta,
Franco P. Preparata,
Roberto Tamassia:
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design.
SIAM J. Comput. 28(3): 864-889 (1998) |
1997 |
105 | | Frank K. H. A. Dehne,
Andrew Rau-Chaplin,
Jörg-Rüdiger Sack,
Roberto Tamassia:
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings
Springer 1997 |
104 | | Giuseppe Liotta,
Roberto Tamassia,
Ioannis G. Tollis,
Paola Vocca:
Area Requirement of Gabriel Drawings.
CIAC 1997: 135-146 |
103 | | Stina S. Bridgeman,
Jody Fanto,
Ashim Garg,
Roberto Tamassia,
Luca Vismara:
InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing.
Graph Drawing 1997: 303-308 |
102 | EE | Giuseppe Liotta,
Franco P. Preparata,
Roberto Tamassia:
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design.
Symposium on Computational Geometry 1997: 156-165 |
101 | EE | Gill Barequet,
Stina S. Bridgeman,
Christian A. Duncan,
Michael T. Goodrich,
Roberto Tamassia:
Classical Computational Geometry in GeomNet.
Symposium on Computational Geometry 1997: 412-414 |
100 | | Olivier Devillers,
Giuseppe Liotta,
Franco P. Preparata,
Roberto Tamassia:
Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract).
WADS 1997: 186-199 |
99 | | Roberto Tamassia,
Bryan Cantrill:
Data Structures.
The Computer Science and Engineering Handbook 1997: 86-110 |
98 | | Robert F. Cohen,
Roberto Tamassia:
Combine and Conquer.
Algorithmica 18(3): 324-362 (1997) |
97 | | Emo Welzl,
Giuseppe Di Battista,
Ashim Garg,
Giuseppe Liotta,
Roberto Tamassia,
Emanuele Tassinari,
Francesco Vargiu:
An Experimental Comparison of Four Graph Drawing Algorithms.
Comput. Geom. 7: 303-325 (1997) |
96 | EE | Goos Kant,
Giuseppe Liotta,
Roberto Tamassia,
Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees.
Inf. Process. Lett. 62(2): 81-88 (1997) |
95 | | Yi-Jen Chiang,
Roberto Tamassia:
Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle.
Int. J. Comput. Geometry Appl. 7(1/2): 85-121 (1997) |
94 | | Michael T. Goodrich,
Roberto Tamassia:
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations.
J. Algorithms 23(1): 51-73 (1997) |
1996 |
93 | EE | James E. Baker,
Isabel F. Cruz,
Giuseppe Liotta,
Roberto Tamassia:
Algorithm animation over the World Wide Web.
AVI 1996: 203-212 |
92 | EE | James E. Baker,
Isabel F. Cruz,
Giuseppe Liotta,
Roberto Tamassia:
The Mocha algorithm animation system.
AVI 1996: 248-250 |
91 | | Roberto Tamassia,
Giuseppe Liotta,
Franco P. Preparata:
Robust Proximity Queries in Implicit Voronoi Diagrams.
CCCG 1996: 1-1 |
90 | | Giuseppe Di Battista,
Roberto Tamassia,
Luca Vismara:
Output-Sensitive Reporting of Disjoint Paths (Extended Abstract).
COCOON 1996: 81-91 |
89 | | Ashim Garg,
Roberto Tamassia,
Paola Vocca:
Drawing with Colors (Extended Abstract).
ESA 1996: 12-26 |
88 | | Ashim Garg,
Roberto Tamassia:
GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D.
Graph Drawing 1996: 193-200 |
87 | | Ashim Garg,
Roberto Tamassia:
A New Minimum Cost Flow Algorithm with Applications to Graph Drawing.
Graph Drawing 1996: 201-216 |
86 | | Stina S. Bridgeman,
Ashim Garg,
Roberto Tamassia:
A Graph Drawing and Translation Service on the WWW.
Graph Drawing 1996: 45-52 |
85 | | Timothy M. Chan,
Michael T. Goodrich,
S. Rao Kosaraju,
Roberto Tamassia:
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings.
Graph Drawing 1996: 63-75 |
84 | | Giuseppe Di Battista,
Ashim Garg,
Giuseppe Liotta,
Armando Parise,
Roberto Tamassia,
Emanuele Tassinari,
Francesco Vargiu,
Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study.
Graph Drawing 1996: 76-91 |
83 | EE | Marek Chrobak,
Michael T. Goodrich,
Roberto Tamassia:
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version).
Symposium on Computational Geometry 1996: 319-328 |
82 | EE | James E. Baker,
Isabel F. Cruz,
Giuseppe Liotta,
Roberto Tamassia:
Animating Geometric Algorithms Over the Web.
Symposium on Computational Geometry 1996: C-3-C-4 |
81 | | Roberto Tamassia:
Data Structures.
ACM Comput. Surv. 28(1): 23-26 (1996) |
80 | | Roberto Tamassia:
Strategic Directions in Computational Geometry.
ACM Comput. Surv. 28(4): 591-606 (1996) |
79 | | Roberto Tamassia,
Jeffrey Scott Vitter:
Optimal Cooperative Search in Fractional Cascaded Data Structures.
Algorithmica 15(2): 154-171 (1996) |
78 | | Giuseppe Di Battista,
Roberto Tamassia:
On-Line Maintenance of Triconnected Components with SPQR-Trees.
Algorithmica 15(4): 302-318 (1996) |
77 | | Giuseppe Di Battista,
Roberto Tamassia:
Guest Editors' Introduction to the Special Issue on Graph Drwaing
Algorithmica 16(1): 1-3 (1996) |
76 | | Peter Eades,
Xuemin Lin,
Roberto Tamassia:
An Algorithm for Drawing a Hierarchical Graph.
Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996) |
75 | | Ashim Garg,
Michael T. Goodrich,
Roberto Tamassia:
Planar upward tree drawings with optimal area.
Int. J. Comput. Geometry Appl. 6(3): 333-356 (1996) |
74 | | Roberto Tamassia:
On-Line Planar Graph Embedding.
J. Algorithms 21(2): 201-239 (1996) |
73 | | Yi-Jen Chiang,
Franco P. Preparata,
Roberto Tamassia:
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps.
SIAM J. Comput. 25(1): 207-233 (1996) |
72 | | Giuseppe Di Battista,
Roberto Tamassia:
On-Line Planarity Testing.
SIAM J. Comput. 25(5): 956-997 (1996) |
1995 |
71 | | Roberto Tamassia,
Ioannis G. Tollis:
Graph Drawing, DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings
Springer 1995 |
70 | | Yi-Jen Chiang,
Michael T. Goodrich,
Edward F. Grove,
Roberto Tamassia,
Darren Erik Vengroff,
Jeffrey Scott Vitter:
External-Memory Graph Algorithms.
SODA 1995: 139-149 |
69 | EE | Giuseppe Di Battista,
Ashim Garg,
Giuseppe Liotta,
Roberto Tamassia,
Emanuele Tassinari,
Francesco Vargiu:
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract).
Symposium on Computational Geometry 1995: 306-315 |
68 | | James E. Baker,
Isabel F. Cruz,
Giuseppe Liotta,
Roberto Tamassia:
A New Model for Algorithm Animation Over the WWW.
ACM Comput. Surv. 27(4): 568-572 (1995) |
67 | | Robert F. Cohen,
Roberto Tamassia:
Dynamic Expression Trees.
Algorithmica 13(3): 245-265 (1995) |
66 | | Sairam Subramanian,
Roberto Tamassia,
Jeffrey Scott Vitter:
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs.
Algorithmica 14(4): 322-339 (1995) |
65 | | Robert F. Cohen,
Giuseppe Di Battista,
Roberto Tamassia,
Ioannis G. Tollis:
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs.
SIAM J. Comput. 24(5): 970-1001 (1995) |
1994 |
64 | | Ashim Garg,
Roberto Tamassia:
Advances in Graph Drawing.
CIAC 1994: 12-21 |
63 | | Ashim Garg,
Roberto Tamassia:
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract).
ESA 1994: 12-23 |
62 | | Yi-Jen Chiang,
Roberto Tamassia:
Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract).
ESA 1994: 266-277 |
61 | | Ashim Garg,
Roberto Tamassia:
On the Compuational Complexity of Upward and Rectilinear Planarity Testing.
Graph Drawing 1994: 286-297 |
60 | | Giuseppe Di Battista,
Roberto Tamassia,
Luca Vismara:
On-Line Convex Plabarity Testing.
WG 1994: 242-255 |
59 | | Giuseppe Di Battista,
Peter Eades,
Roberto Tamassia,
Ioannis G. Tollis:
Algorithms for Drawing Graphs: an Annotated Bibliography.
Comput. Geom. 4: 235-282 (1994) |
58 | | Paola Bertolazzi,
Robert F. Cohen,
Giuseppe Di Battista,
Roberto Tamassia,
Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph.
Int. J. Comput. Geometry Appl. 4(4): 385-402 (1994) |
57 | | Peter Bro Miltersen,
Sairam Subramanian,
Jeffrey Scott Vitter,
Roberto Tamassia:
Complexity Models for Incremental Computation.
Theor. Comput. Sci. 130(1): 203-236 (1994) |
1993 |
56 | | Goos Kant,
Giuseppe Liotta,
Roberto Tamassia,
Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees.
CCCG 1993: 192-197 |
55 | | Paola Bertolazzi,
Giuseppe Di Battista,
Carlo Mannino,
Roberto Tamassia:
Optimal Upward Planarity Testing of Single-Source Digraphs.
ESA 1993: 37-48 |
54 | | Robert F. Cohen,
Roberto Tamassia:
Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract).
ESA 1993: 97-108 |
53 | | Robert F. Cohen,
Sairam Sairam,
Roberto Tamassia,
Jeffrey Scott Vitter:
Dynamic algorithms for optimization problems in bounded tree-width graphs.
IPCO 1993: 99-112 |
52 | | Yi-Jen Chiang,
Franco P. Preparata,
Roberto Tamassia:
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps.
SODA 1993: 44-53 |
51 | | Sairam Sairam,
Jeffrey Scott Vitter,
Roberto Tamassia:
A Complexity Theoretic Approach to Incremental Computation.
STACS 1993: 640-649 |
50 | EE | Robert F. Cohen,
Giuseppe Di Battista,
Arkady Kanevsky,
Roberto Tamassia:
Reinventing the wheel: an optimal data structure for connectivity queries.
STOC 1993: 194-200 |
49 | EE | Michael T. Goodrich,
Roberto Tamassia:
Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations.
Symposium on Computational Geometry 1993: 318-327 |
48 | EE | Ashim Garg,
Michael T. Goodrich,
Roberto Tamassia:
Area-Efficient Upward Tree Drawings.
Symposium on Computational Geometry 1993: 359-368 |
47 | | 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.
J. Algorithms 15(1): 173 (1993) |
46 | | Roberto Tamassia,
Ioannis G. Tollis:
Dynamic Reachability in Planar Digraphs with One Source and One Sink.
Theor. Comput. Sci. 119(2): 331-343 (1993) |
1992 |
45 | | Sairam Sairam,
Roberto Tamassia,
Jeffrey Scott Vitter:
A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs.
SPDP 1992: 176-183 |
44 | | Paola Bertolazzi,
Robert F. Cohen,
Giuseppe Di Battista,
Roberto Tamassia,
Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph (Extended Abstract).
SWAT 1992: 272-283 |
43 | EE | Robert F. Cohen,
Giuseppe Di Battista,
Roberto Tamassia,
Ioannis G. Tollis,
Paola Bertolazzi:
A Framework for Dynamic Graph Drawing.
Symposium on Computational Geometry 1992: 261-270 |
42 | | Giuseppe Di Battista,
Roberto Tamassia,
Ioannis G. Tollis:
Area Requirement and Symmetry Display of Planar Upward Drawings.
Discrete & Computational Geometry 7: 381-401 (1992) |
41 | | Giuseppe Di Battista,
Roberto Tamassia,
Ioannis G. Tollis:
Constrained Visibility Representations of Graphs.
Inf. Process. Lett. 41(1): 1-7 (1992) |
40 | | Yi-Jen Chiang,
Roberto Tamassia:
Dynamization of the trapezoid method for planar point location in monotone subdivisions.
Int. J. Comput. Geometry Appl. 2(3): 311-333 (1992) |
39 | | 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.
J. Algorithms 13(1): 33-54 (1992) |
38 | | Franco P. Preparata,
Roberto Tamassia:
Efficient Point Location in a Convex Spatial Cell-Complex.
SIAM J. Comput. 21(2): 267-280 (1992) |
1991 |
37 | | Arkady Kanevsky,
Roberto Tamassia,
Giuseppe Di Battista,
Jianer Chen:
On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)
FOCS 1991: 793-801 |
36 | | Robert F. Cohen,
Roberto Tamassia:
Dynamic Expression Trees and their Applications (Extended Abstract).
SODA 1991: 52-61 |
35 | | Michael T. Goodrich,
Roberto Tamassia:
Dynamic Trees and Dynamic Point Location (Preliminary Version)
STOC 1991: 523-533 |
34 | EE | Yi-Jen Chiang,
Roberto Tamassia:
Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract).
Symposium on Computational Geometry 1991: 61-70 |
33 | | Bruno Codenotti,
Roberto Tamassia:
A Network Flow Approach to the Reconfiguration of VLSI Arrays.
IEEE Trans. Computers 40(1): 118-121 (1991) |
32 | | Roberto Tamassia:
An Incremental Reconstruction Method for Dynamic Planar Point Location.
Inf. Process. Lett. 37(2): 79-83 (1991) |
31 | | Roberto Tamassia,
Ioannis G. Tollis,
Jeffrey Scott Vitter:
Lower Bounds for Planar Orthogonal Drawings of Graphs.
Inf. Process. Lett. 39(1): 35-40 (1991) |
30 | | Roberto Tamassia,
Jeffrey Scott Vitter:
Parallel Transitive Closure and Point Location in Planar Structures.
SIAM J. Comput. 20(4): 708-725 (1991) |
29 | | Roberto Tamassia,
Ioannis G. Tollis:
Representations of Graphs on a Cylinder.
SIAM J. Discrete Math. 4(1): 139-149 (1991) |
1990 |
28 | | Giuseppe Di Battista,
Roberto Tamassia:
On-Line Graph Algorithms with SPQR-Trees.
ICALP 1990: 598-611 |
27 | | 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.
SODA 1990: 1-11 |
26 | EE | Roberto Tamassia,
Jeffrey Scott Vitter:
Optimal Cooperative Search in Fractional Cascaded Data Structures.
SPAA 1990: 307-316 |
25 | | Giuseppe Di Battista,
Amadeo Giammarco,
Giuseppe Santucci,
Roberto Tamassia:
The Architecture of Diagram Server.
VL 1990: 60-65 |
24 | | Roberto Tamassia,
Franco P. Preparata:
Dynamic Maintenance of Planar Digraphs, with Applications.
Algorithmica 5(4): 509-527 (1990) |
23 | | Franco P. Preparata,
Roberto Tamassia:
Dynamic Planar Point Location with Optimal Query Time.
Theor. Comput. Sci. 74(1): 95-114 (1990) |
1989 |
22 | | Giuseppe Di Battista,
Roberto Tamassia:
Incremental Planarity Testing (Extended Abstract)
FOCS 1989: 436-441 |
21 | EE | Roberto Tamassia,
Jeffrey Scott Vitter:
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures.
SPAA 1989: 399-408 |
20 | | Franco P. Preparata,
Roberto Tamassia:
Dynamic Planar Point Location with Optimal Query Time.
STACS 1989: 84-95 |
19 | EE | Giuseppe Di Battista,
Roberto Tamassia,
Ioannis G. Tollis:
Area Requirement and Symmetry Display in Drawing Graphs.
Symposium on Computational Geometry 1989: 51-60 |
18 | | Franco P. Preparata,
Roberto Tamassia:
Efficient Spatial Point Location (Extended Abstract).
WADS 1989: 3-11 |
17 | | Giuseppe Di Battista,
Hannu Kangassalo,
Roberto Tamassia:
Definition Libraries for Conceptual Modelling.
Data Knowl. Eng. 4: 245-260 (1989) |
16 | | Franco P. Preparata,
Roberto Tamassia:
Fully Dynamic Point Location in a Monotone Subdivision.
SIAM J. Comput. 18(4): 811-830 (1989) |
1988 |
15 | | Bruno Codenotti,
Roberto Tamassia:
Efficient Reconfiguration of VLSI Arrays.
AWOC 1988: 191-200 |
14 | EE | Giuseppe Di Battista,
Hannu Kangassalo,
Roberto Tamassia:
Definition Libraries for Conceptual Modelling.
ER 1988: 251-267 |
13 | | Franco P. Preparata,
Roberto Tamassia:
Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract)
FOCS 1988: 558-567 |
12 | | Roberto Tamassia:
A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract).
ICALP 1988: 576-590 |
11 | | Giuseppe Di Battista,
Roberto Tamassia:
Algorithms for Plane Representations of Acyclic Digraphs.
Theor. Comput. Sci. 61: 175-198 (1988) |
1987 |
10 | | Giuseppe Di Battista,
Roberto Tamassia:
Upward Drawings of Acyclic Digraphs.
WG 1987: 121-133 |
9 | | Roberto Tamassia:
On Embedding a Graph in the Grid with the Minimum Number of Bends.
SIAM J. Comput. 16(3): 421-444 (1987) |
1986 |
8 | | Roberto Tamassia,
Ioannis G. Tollis:
Algorithms for Visibility Representations of Planar Graphs.
STACS 1986: 130-141 |
7 | | Roberto Tamassia,
Ioannis G. Tollis:
Centipede Graphs and Visibility on a Cylinder.
WG 1986: 252-263 |
6 | | Roberto Tamassia,
Ioannis G. Tollis:
A Unified Approach a Visibility Representation of Planar Graphs.
Discrete & Computational Geometry 1: 321-341 (1986) |
5 | | Carlo Batini,
Enrico Nardelli,
Roberto Tamassia:
A Layout Algorithm for Data Flow Diagrams.
IEEE Trans. Software Eng. 12(4): 538-546 (1986) |
1985 |
4 | EE | Roberto Tamassia:
New Layout Techniques for Entity-Relationship Diagrams.
ER 1985: 304-311 |
3 | | Carlo Batini,
Enrico Nardelli,
Maurizio Talamo,
Roberto Tamassia:
GINCOD: A Graphical Tool for Conceptual Design of Data Base Applications.
Computer-Aided Database Design: the DATAID approach 1985: 33-51 |
1984 |
2 | EE | Carlo Batini,
Maurizio Talamo,
Roberto Tamassia:
Computer aided layout of entity relationship diagrams.
Journal of Systems and Software 4(2-3): 163-173 (1984) |
1983 |
1 | EE | Roberto Tamassia,
Carlo Batini,
Maurizio Talamo:
An Algorithm for Automatic Layout of Entity-Relationship Diagrams.
ER 1983: 421-439 |