| Year |
Citation |
Score |
| 2017 |
Avci B, Trajcevski G, Tamassia R, Scheuermann P, Zhou F. Efficient detection of motion-trend predicates in wireless sensor networks Computer Communications. 101: 26-43. DOI: 10.1016/J.Comcom.2016.08.012 |
0.315 |
|
| 2016 |
Papamanthou C, Tamassia R, Triandopoulos N. Authenticated Hash Tables Based on Cryptographic Accumulators Algorithmica. 74: 664-712. DOI: 10.1007/S00453-014-9968-3 |
0.749 |
|
| 2015 |
Juels A, Kelley J, Tamassia R, Triandopoulos N. Falcon codes: Fast, authenticated LT codes (Or: Making rapid tornadoes unstoppable) Proceedings of the Acm Conference On Computer and Communications Security. 2015: 1032-1047. DOI: 10.1145/2810103.2813728 |
0.671 |
|
| 2015 |
Erway CC, Küpç;ü A, Papamanthou C, Tamassia R. Dynamic provable data possession Acm Transactions On Information and System Security. 17. DOI: 10.1145/2699909 |
0.42 |
|
| 2013 |
Goodrich MT, Ohrimenko O, Tamassia R. Graph drawing in the cloud: Privately visualizing relational data using small working storage Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7704: 43-54. DOI: 10.1007/978-3-642-36763-2_5 |
0.394 |
|
| 2012 |
Kelley J, Tamassia R, Triandopoulos N. Hardening access control and data protection in GFS-like file systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7459: 19-36. DOI: 10.1007/978-3-642-33167-1_2 |
0.714 |
|
| 2012 |
Goodrich MT, Nguyen D, Ohrimenko O, Papamanthou C, Tamassia R, Triandopoulos N, Lopes CV. Efficient verification of webcontent searching through authenticated web crawlers Proceedings of the Vldb Endowment. 5: 920-931. |
0.712 |
|
| 2011 |
Goodrich MT, Tamassia R, Triandopoulos N. Efficient authenticated data structures for graph connectivity and geometric search problems Algorithmica (New York). 60: 505-552. DOI: 10.1007/S00453-009-9355-7 |
0.784 |
|
| 2011 |
Papamanthou C, Tamassia R, Triandopoulos N. Optimal verification of operations on dynamic sets Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6841: 91-110. DOI: 10.1007/978-3-642-22792-9_6 |
0.725 |
|
| 2010 |
Lysyanskaya A, Tamassia R, Triandopoulos N. Authenticated error-correcting codes with applications to multicast authentication Acm Transactions On Information and System Security. 13. DOI: 10.1145/1698750.1698757 |
0.717 |
|
| 2010 |
Papamanthou C, Tamassia R, Triandopoulos N. Optimal authenticated data structures with multilinear forms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6487: 246-264. DOI: 10.1007/978-3-642-17455-1_16 |
0.727 |
|
| 2010 |
Tamassia R, Triandopoulos N. Certification and authentication of data structures Ceur Workshop Proceedings. 619. |
0.748 |
|
| 2009 |
Yao D, Tamassia R. Compact and anonymous role-based authorization chain Acm Transactions On Information and System Security. 12. DOI: 10.1145/1455526.1455528 |
0.595 |
|
| 2009 |
Goodrich MT, Sun JZ, Tamassia R, Triandopoulos N. Reliable resource searching in P2P networks Lecture Notes of the Institute For Computer Sciences, Social-Informatics and Telecommunications Engineering. 19: 437-447. DOI: 10.1007/978-3-642-05284-2_25 |
0.718 |
|
| 2008 |
Goodrich MT, Tamassia R, Yao D. Notarized federated ID management and authentication Journal of Computer Security. 16: 399-418. DOI: 10.3233/Jcs-2008-0324 |
0.324 |
|
| 2008 |
Yao D, Frikken KB, Atallah MJ, Tamassia R. Private information: To reveal or not to reveal Acm Transactions On Information and System Security. 12. DOI: 10.1145/1410234.1410240 |
0.58 |
|
| 2008 |
Papamanthou C, Preparata FP, Tamassia R. Algorithms for location estimation based on RSSI sampling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5389: 72-86. DOI: 10.1007/978-3-540-92862-1_7 |
0.517 |
|
| 2008 |
Goodrich MT, Papamanthou C, Tamassia R, Triandopoulos N. Athos: Efficient authentication of outsourced file systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5222: 80-96. DOI: 10.1007/978-3-540-85886-7_6 |
0.735 |
|
| 2008 |
Goodrich MT, Tamassia R, Triandopoulos N. Super-efficient verification of dynamic outsourced databases Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4964: 407-424. DOI: 10.1007/978-3-540-79263-5_26 |
0.738 |
|
| 2007 |
Tamassia R, Triandopoulos N. Efficient content authentication in peer-to-peer networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4521: 354-372. |
0.724 |
|
| 2007 |
Papamanthou C, Tamassia R. Time and space efficient algorithms for two-party authenticated data structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4861: 1-15. |
0.336 |
|
| 2006 |
Goodrich MT, Tamassia R, Yao D. Notarized federated identity management for web services Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4127: 133-147. DOI: 10.1007/11805588_10 |
0.569 |
|
| 2005 |
Tamassia R, Triandopoulos N. Computational bounds on hierarchical data processing with applications to information security Lecture Notes in Computer Science. 3580: 153-165. |
0.761 |
|
| 2004 |
Lysyanskaya A, Tamassia R, Triandopoulos N. Multicast authentication in fully adversarial networks Proceedings - Ieee Symposium On Security and Privacy. 2004: 241-255. DOI: 10.1109/SECPRI.2004.1301327 |
0.712 |
|
| 2003 |
Goodrich MT, Tamassia R, Triandopoulos N, Cohen R. Authenticated data structures for graph and geometric searching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2612: 295-313. |
0.744 |
|
| 2002 |
Bridgeman S, Tamassia R. A user study in similarity measures for graph drawing Journal of Graph Algorithms and Applications. 6: 225-254. DOI: 10.7155/Jgaa.00053 |
0.786 |
|
| 2002 |
Chan TM, Goodrich MT, Rao Kosaraju S, Tamassia R. Optimizing area and aspect ratio in straight-line orthogonal tree drawings Computational Geometry: Theory and Applications. 23: 153-162. DOI: 10.1016/S0925-7721(01)00066-9 |
0.353 |
|
| 2002 |
Bridgeman S, Tamassia R. The graph drawing server Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2265: 448-450. |
0.772 |
|
| 2002 |
Goodrich MT, Tamassia R, Hasić J. An efficient dynamic and distributed cryptographic accumulator Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2433: 372-388. |
0.327 |
|
| 2001 |
Tamassia R, Vismara L. A case study in algorithm engineering for geometric computing International Journal of Computational Geometry and Applications. 11: 15-70. DOI: 10.1142/S0218195901000390 |
0.361 |
|
| 2001 |
Garg A, Tamassia R. On the computational complexity of upward and rectilinear planarity testing Siam Journal On Computing. 31: 601-625. DOI: 10.1137/S0097539794277123 |
0.443 |
|
| 2001 |
Brandes U, Shubina G, Tamassia R, Wagner D. Fast layout methods for timetable graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1984: 127-138. DOI: 10.1007/3-540-44541-2_12 |
0.353 |
|
| 2001 |
Di Battista G, Tamassia R, Vismara L. Incremental convex planarity testing Information and Computation. 169: 94-126. DOI: 10.1006/Inco.2001.3031 |
0.454 |
|
| 2001 |
Nishizeki T, Tamassia R, Wagner D. Special issue on selected papers from the 1998 Dagstuhl seminar on graph algorithms and applications Journal of Graph Algorithms and Applications. 5: 1. |
0.301 |
|
| 2000 |
Bridgeman S, Tamassia R. Difference metrics for interactive orthogonal graph drawing algorithms Journal of Graph Algorithms and Applications. 4: 47-74. DOI: 10.7155/Jgaa.00025 |
0.771 |
|
| 2000 |
Di Battista G, Garg A, Liotta G, Parise A, Tamassia R, Tassinari E, Vargiu F, Vismara L. Drawing directed acyclic graphs: An experimental study International Journal of Computational Geometry and Applications. 10: 623-648. DOI: 10.1142/S0218195900000358 |
0.414 |
|
| 2000 |
Bridgeman SS, Di Battista G, Didimo W, Liotta G, Tamassia R, Vismara L. Turn-regularity and optimal area drawings of orthogonal representations Computational Geometry: Theory and Applications. 16: 53-93. DOI: 10.1016/S0925-7721(99)00054-1 |
0.775 |
|
| 2000 |
Tamassia R. A parallel algorithm for planar orthogonal grid drawings Parallel Processing Letters. 10: 141-150. DOI: 10.1016/S0129-6264(00)00014-7 |
0.475 |
|
| 2000 |
Vismara L, Di Battista G, Garg A, Liotta G, Tamassia R, Vargiu F. Experimental studies on graph drawing algorithms Software - Practice and Experience. 30: 1235-1284. DOI: 10.1002/1097-024X(200009)30:11<1235::Aid-Spe339>3.0.Co;2-B |
0.415 |
|
| 2000 |
Bridgeman S, Goodrich MT, Kobourov SG, Tamassia R. SAIL: A system for generating, archiving, and retrieving specialized assignments using LAT EX Sigcse Bulletin (Association For Computing Machinery, Special Interest Group On Computer Science Education). 300-304. |
0.735 |
|
| 2000 |
Bridgeman S, Goodrich MT, Kobourov SG, Tamassia R. PILOT: An interactive tool for learning and grading Sigcse Bulletin (Association For Computing Machinery, Special Interest Group On Computer Science Education). 139-143. |
0.754 |
|
| 2000 |
Pizzonia M, Tamassia R. Minimum depth graph embedding Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1879: 356-367. |
0.364 |
|
| 1999 |
Bridgeman S, Garg A, Tamassia R. A graph drawing and translation service on the world wide web International Journal of Computational Geometry and Applications. 9: 419-446. DOI: 10.1142/S021819599900025X |
0.782 |
|
| 1999 |
Liotta G, Preparata FP, Tamassia R. Robust proximity queries: An illustration of degree-driven algorithm design Siam Journal On Computing. 28: 864-889. DOI: 10.1137/S0097539796305365 |
0.643 |
|
| 1999 |
Goodrich MT, Tamassia R. Dynamic Trees and Dynamic Point Location Siam Journal On Computing. 28: 612-636. DOI: 10.1137/S0097539793254376 |
0.402 |
|
| 1999 |
Tamassia R. Advances in the theory and practice of graph drawing Theoretical Computer Science. 217: 235-254. DOI: 10.1016/S0304-3975(98)00272-2 |
0.406 |
|
| 1999 |
Di Battista G, Tamassia R, Vismara L. Output-sensitive reporting of disjoint paths Algorithmica (New York). 23: 302-340. DOI: 10.1007/Pl00009264 |
0.437 |
|
| 1999 |
Bridgeman SS, Di Battista G, Didimo W, Liotta G, Tamassia R, Vismara L. Turn-regularity and planar orthogonal drawings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1731: 8-26. DOI: 10.1007/3-540-46648-7_2 |
0.771 |
|
| 1999 |
Gelfand N, Tamassia R. Algorithmic patterns for orthogonal graph drawing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1547: 138-152. DOI: 10.1007/3-540-37623-2_11 |
0.306 |
|
| 1998 |
Bertolazzi P, Di Battista G, Mannino C, Tamassia R. Optimal upward planarity testing of single-source digraphs Siam Journal On Computing. 27: 132-169. DOI: 10.1137/S0097539794279626 |
0.372 |
|
| 1998 |
Tamassia R. Constraints in Graph Drawing Algorithms Constraints. 3: 87-120. DOI: 10.1023/A:1009760732249 |
0.478 |
|
| 1998 |
Devillers O, Liotta G, Preparata FP, Tamassia R. Checking the convexity of polytopes and the planarity of subdivisions Computational Geometry: Theory and Applications. 11: 187-208. DOI: 10.1016/S0925-7721(98)00039-X |
0.588 |
|
| 1998 |
Battista GD, Tamassia R. Geometric representations of graphs Computational Geometry: Theory and Applications. 9: 1-2. DOI: 10.1016/S0925-7721(97)00012-6 |
0.423 |
|
| 1997 |
Chiang YJ, Tamassia R. Optimal shortest path and minimum-link path queries between two convex polygons inside a simple polygonal obstacle International Journal of Computational Geometry and Applications. 7: 85-121. DOI: 10.1142/S0218195997000077 |
0.39 |
|
| 1997 |
Di Battista G, Garg A, Liotta G, Tamassia R, Tassinari E, Vargiu F. An experimental comparison of four graph drawing algorithms Computational Geometry: Theory and Applications. 7: 303-325. DOI: 10.1016/S0925-7721(96)00005-3 |
0.481 |
|
| 1997 |
Kant G, Liotta G, Tamassia R, Tollis IG. Area requirement of visibility representations of trees Information Processing Letters. 62: 81-88. DOI: 10.1016/S0020-0190(97)00048-3 |
0.328 |
|
| 1997 |
Cohen RF, Tamassia R. Combine and Conquer Algorithmica (New York). 18: 324-362. DOI: 10.1007/Pl00009160 |
0.428 |
|
| 1997 |
Bridgeman SS, Fanto J, Garg A, Tamassia R, Vismara L. Interactivegiotto: An algorithm for interactive orthogonal graph drawing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1353: 303-308. DOI: 10.1007/3-540-63938-1_73 |
0.772 |
|
| 1997 |
Garg A, Tamassia R. A new minimum cost flow algorithm with applications to graph drawing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1190: 201-216. DOI: 10.1007/3-540-62495-3_49 |
0.3 |
|
| 1997 |
Bridgeman S, Garg A, Tamassia R. A graph drawing and translation service on the WWW Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1190: 45-52. DOI: 10.1007/3-540-62495-3_36 |
0.775 |
|
| 1997 |
Goodrich MT, Tamassia R. Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations Journal of Algorithms. 23: 51-73. DOI: 10.1006/Jagm.1995.0797 |
0.391 |
|
| 1996 |
Tamassia R, Agarwal PK, Amato N, Chen DZ, Dobkin D, Drysdale S, Fortune S, Goodrich MT, Hershberger J, O'Rourke J, Preparata FP, Sack JR, Suri S, Tollis I, Vitter JS, et al. Strategic directions in computational geometry Acm Computing Surveys. 28: 591-606. DOI: 10.1145/242223.242248 |
0.588 |
|
| 1996 |
Garg A, Goodrich MT, Tamassia R. Planar upward tree drawings with optimal area International Journal of Computational Geometry and Applications. 6: 333-356. DOI: 10.1142/S0218195996000228 |
0.346 |
|
| 1996 |
Eades P, Lin X, Tamassia R. An algorithm for drawing a hierarchical graph International Journal of Computational Geometry and Applications. 6: 145-155. DOI: 10.1142/S0218195996000101 |
0.459 |
|
| 1996 |
Di Battista G, Tamassia R. On-line planarity testing Siam Journal On Computing. 25: 956-997. DOI: 10.1137/S0097539794280736 |
0.436 |
|
| 1996 |
Chiang YIJ, Preparata FP, Tamassia R. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps Siam Journal On Computing. 25: 207-233. DOI: 10.1137/S0097539792224516 |
0.61 |
|
| 1996 |
Di Battista G, Tamassia R. On-Line Maintenance of Triconnected Components with SPQR-Trees Algorithmica (New York). 15: 302-318. DOI: 10.1007/Bf01961541 |
0.404 |
|
| 1996 |
Tamassia R, Vitter JS. Optimal Cooperative Search in Fractional Cascaded Data Structures Algorithmica (New York). 15: 154-171. DOI: 10.1007/Bf01941686 |
0.452 |
|
| 1996 |
Tamassia R. On-line Planar Graph Embedding Journal of Algorithms. 21: 201-239. DOI: 10.1006/Jagm.1996.0044 |
0.443 |
|
| 1996 |
Battista GD, Tamassia R, Vismara L. Output-sensitive reporting of disjoint paths (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1090: 81-91. |
0.351 |
|
| 1995 |
Tamassia R, Tollis IG. Report on graph drawing '94 Sigact News. 26: 87-91. DOI: 10.1145/203610.203615 |
0.405 |
|
| 1995 |
Cohen RF, Di BG, Tamassia R, Tollis IG. Dynamic graph drawings: trees, series-parallel digraphs, and planar st-digraphs Siam Journal On Computing. 24: 970-1001. DOI: 10.1137/S0097539792235724 |
0.479 |
|
| 1995 |
Subramanian S, Tamassia R, Vitter JS. An efficient parallel algorithm for shortest paths in planar layered digraphs Algorithmica. 14: 322-339. DOI: 10.1007/BF01294130 |
0.333 |
|
| 1995 |
Cohen RF, Tamassia R. Dynamic expression trees Algorithmica. 13: 245-265. DOI: 10.1007/Bf01190506 |
0.376 |
|
| 1995 |
Garg A, Tamassia R. Upward planarity testing Order. 12: 109-133. DOI: 10.1007/Bf01108622 |
0.354 |
|
| 1995 |
Di Battista G, Tamassia R, Vismara L. On-line convex planarity testing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 903: 242-255. |
0.354 |
|
| 1994 |
Bertolazzi P, Cohen RF, Battista GD, Tamassia R, Tollis IG. How To Draw A Series-Parallel Digraph International Journal of Computational Geometry and Applications. 4: 385-402. DOI: 10.1142/S0218195994000215 |
0.398 |
|
| 1994 |
Battista GD, Eades P, Tamassia R, Tollis IG. Algorithms for drawing graphs: an annotated bibliography Computational Geometry: Theory and Applications. 4: 235-282. DOI: 10.1016/0925-7721(94)00014-X |
0.466 |
|
| 1994 |
Miltersen PB, Subramanian S, Vitter JS, Tamassia R. Complexity models for incremental computation Theoretical Computer Science. 130: 203-236. DOI: 10.1016/0304-3975(94)90159-7 |
0.338 |
|
| 1993 |
Miriyala K, Hornick SW, Tamassia R. An incremental approach to aesthetic graph layout Case. 297-308. DOI: 10.1109/Case.1993.634832 |
0.402 |
|
| 1993 |
Tamassia R, Tollis IG. Dynamic reachability in planar digraphs with one source and one sink Theoretical Computer Science. 119: 331-343. DOI: 10.1016/0304-3975(93)90164-O |
0.435 |
|
| 1992 |
Chiang Y, Tamassia R. Dynamization Of The Trapezoid Method For Planar Point Location In Monotone Subdivisions International Journal of Computational Geometry and Applications. 2: 311-333. DOI: 10.1142/S0218195992000184 |
0.373 |
|
| 1992 |
Preparata FP, Tamassia R. Efficient Point Location in a Convex Spatial Cell-Complex Siam Journal On Computing. 21: 267-280. DOI: 10.1137/0221020 |
0.589 |
|
| 1992 |
Eppstein D, Italiano GF, Tamassia R, Tarjan RE, Westbrook J, Yung M. Maintenance of a minimum spanning forest in a dynamic plane graph Journal of Algorithms. 13: 33-54. DOI: 10.1016/0196-6774(92)90004-V |
0.448 |
|
| 1992 |
Di Battista G, Tamassia R, Tollis IG. Constrained visibility representations of graphs Information Processing Letters. 41: 1-7. DOI: 10.1016/0020-0190(92)90072-4 |
0.44 |
|
| 1992 |
Battista GD, Tamassia R, Tollis IG. Area requirement and symmetry display of planar upward drawings Discrete & Computational Geometry. 7: 381-401. DOI: 10.1007/Bf02187850 |
0.426 |
|
| 1992 |
Cohen RF, Battista GD, Tamassia R, Tollis IG, Bertolazzi P. Framework for dynamic graph drawing Eighth Annual Symposium On Computational Geometry. 261-270. |
0.375 |
|
| 1991 |
Tamassia R, Tollis IG. Representations of graphs on a cylinder Siam Journal On Discrete Mathematics. 4: 139-149. DOI: 10.1137/0404014 |
0.445 |
|
| 1991 |
Tamassia R, Vitter JS. Parallel Transitive Closure and Point Location in Planar Structures Siam Journal On Computing. 20: 708-725. DOI: 10.1137/0220045 |
0.474 |
|
| 1991 |
Tamassia R. An incremental reconstruction method for dynamic planar point location Information Processing Letters. 37: 79-83. DOI: 10.1016/0020-0190(91)90138-8 |
0.316 |
|
| 1991 |
Tamassia R, Tollis IG, Vitter JS. Lower bounds for planar orthogonal drawings of graphs Information Processing Letters. 39: 35-40. DOI: 10.1016/0020-0190(91)90059-Q |
0.442 |
|
| 1990 |
Preparata FP, Tamassia R. Dynamic planar point location with optimal query time Theoretical Computer Science. 74: 95-114. DOI: 10.1016/0304-3975(90)90007-5 |
0.561 |
|
| 1990 |
Tamassia R, Preparata FP. Dynamic maintenance of planar digraphs, with applications Algorithmica. 5: 509-527. DOI: 10.1007/Bf01840401 |
0.652 |
|
| 1989 |
Preparata FP, Tamassia R. Fully Dynamic Point Location in a Monotone Subdivision Siam Journal On Computing. 18: 811-830. DOI: 10.1137/0218056 |
0.587 |
|
| 1989 |
Tamassia R, Tollis IG. Planar Grid Embedding in Linear Time Ieee Transactions On Circuits and Systems. 36: 1230-1234. DOI: 10.1109/31.34669 |
0.429 |
|
| 1988 |
Tamassia R, Battista GD, Batini C. Automatic Graph Drawing and Readability of Diagrams Ieee Transactions On Systems, Man and Cybernetics. 18: 61-79. DOI: 10.1109/21.87055 |
0.402 |
|
| 1988 |
Di Battista G, Tamassia R. Algorithms for plane representations of acyclic digraphs Theoretical Computer Science. 61: 175-198. DOI: 10.1016/0304-3975(88)90123-5 |
0.447 |
|
| 1987 |
Tamassia R. On embedding a graph in the grid with the minimum number of bends Siam Journal On Computing. 16: 421-444. DOI: 10.1137/0216030 |
0.483 |
|
| 1986 |
Batini C, Nardelli E, Tamassia R. A Layout Algorithm for Data Flow Diagrams Ieee Transactions On Software Engineering. 538-546. DOI: 10.1109/Tse.1986.6312901 |
0.443 |
|
| 1986 |
Tamassia R, Tollis IG. A unified approach to visibility representations of planar graphs Discrete & Computational Geometry. 1: 321-341. DOI: 10.1007/Bf02187705 |
0.449 |
|
| 1984 |
Batini C, Talamo M, Tamassia R. Computer aided layout of entity relationship diagrams The Journal of Systems and Software. 4: 163-173. DOI: 10.1016/0164-1212(84)90006-2 |
0.341 |
|
| Show low-probability matches. |