AAAAAA
Results:
1-21
|
Results: 21
Authors:
LIOTTA G
PREPARATA FP
TAMASSIA R
Citation: G. Liotta et al., ROBUST PROXIMITY QUERIES - AN ILLUSTRATION OF DEGREE-DRIVEN ALGORITHMDESIGN, SIAM journal on computing (Print), 28(3), 1999, pp. 864-889
Authors:
GOODRICH MT
TAMASSIA R
Citation: Mt. Goodrich et R. Tamassia, DYNAMIC TREES AND DYNAMIC POINT LOCATION, SIAM journal on computing (Print), 28(2), 1999, pp. 612-636
Authors:
BERTOLAZZI P
DIBATTISTA G
MANNINO C
TAMASSIA R
Citation: P. Bertolazzi et al., OPTIMAL UPWARD PLANARITY TESTING OF SINGLE-SOURCE DIGRAPHS, SIAM journal on computing, 27(1), 1998, pp. 132-169
Authors:
GOODRICH MT
TAMASSIA R
Citation: Mt. Goodrich et R. Tamassia, DYNAMIC RAY SHOOTING AND SHORTEST PATHS IN PLANAR SUBDIVISIONS VIA BALANCED GEODESIC TRIANGULATIONS, Journal of algorithms, 23(1), 1997, pp. 51-73
Authors:
COHEN RF
TAMASSIA R
Citation: Rf. Cohen et R. Tamassia, COMBINE AND CONQUER, Algorithmica, 18(3), 1997, pp. 324-362
Authors:
BEIGEL R
TAMASSIA R
Citation: R. Beigel et R. Tamassia, 26TH ANNUAL ACM SYMPOSIUM ON THE THEORY OF COMPUTING (STOC94) - MAY 23-25, 1994 - GUEST EDITORS FOREWORD, Journal of computer and system sciences, 55(1), 1997, pp. 1-1
Authors:
KANT G
LIOTTA G
TAMASSIA R
TOLLIS IG
Citation: G. Kant et al., AREA REQUIREMENT OF VISIBILITY REPRESENTATIONS OF TREES, Information processing letters, 62(2), 1997, pp. 81-88
Authors:
TAMASSIA R
AGARWAL PK
AMATO N
CHEN DZ
DOBKIN D
DRYSDALE S
FORTUNE S
GOODRICH MT
HERSHBERGER J
OROURKE J
PREPARATA MP
SACK JR
SURI S
TOLLIS I
VITTER JS
WHITESIDES S
Citation: R. Tamassia et al., STRATEGIC DIRECTIONS IN COMPUTATIONAL GEOMETRY, ACM computing surveys, 28(4), 1996, pp. 591-606
Authors:
TAMASSIA R
Citation: R. Tamassia, ONLINE PLANAR GRAPH EMBEDDING, Journal of algorithms, 21(2), 1996, pp. 201-239
Authors:
DIBATTISTA G
TAMASSIA R
Citation: G. Dibattista et R. Tamassia, UNTITLED, Algorithmica, 16(1), 1996, pp. 1-3
Authors:
DIBATTISTA G
TAMASSIA R
Citation: G. Dibattista et R. Tamassia, ONLINE MAINTENANCE OF TRICONNECTED COMPONENTS WITH SPQR-TREES, Algorithmica, 15(4), 1996, pp. 302-318
Authors:
TAMASSIA R
VITTER JS
Citation: R. Tamassia et Js. Vitter, OPTIMAL COOPERATIVE SEARCH IN FRACTIONAL CASCADED DATA-STRUCTURES, Algorithmica, 15(2), 1996, pp. 154-171
Authors:
DIBATTISTA G
TAMASSIA R
Citation: G. Dibattista et R. Tamassia, ONLINE PLANARITY TESTING, SIAM journal on computing, 25(5), 1996, pp. 956-997
Authors:
CHIANG YJ
PREPARATA FP
TAMASSIA R
Citation: Yj. Chiang et al., A UNIFIED APPROACH TO DYNAMIC POINT LOCATION, RAY SHOOTING, AND SHORTEST PATHS IN PLANAR MAPS, SIAM journal on computing, 25(1), 1996, pp. 207-233
Authors:
BAKER JE
CRUZ SF
LIOTTA G
TAMASSIA R
Citation: Je. Baker et al., A NEW MODEL FOR ALGORITHM ANIMATION OVER THE WWW, ACM computing surveys, 27(4), 1995, pp. 568-572
Authors:
SUBRAMANIAN S
TAMASSIA R
VITTER JS
Citation: S. Subramanian et al., AN EFFICIENT PARALLEL ALGORITHM FOR SHORTEST PATHS IN PLANAR LAYERED DIGRAPHS, Algorithmica, 14(4), 1995, pp. 322-339
Authors:
COHEN RF
TAMASSIA R
Citation: Rf. Cohen et R. Tamassia, DYNAMIC EXPRESSION-TREES, Algorithmica, 13(3), 1995, pp. 245-265
Authors:
COHEN RF
DIBATTISTA G
TAMASSIA R
TOLLIS IG
Citation: Rf. Cohen et al., DYNAMIC GRAPH DRAWINGS - TREES, SERIES-PARALLEL DIGRAPHS, AND PLANAR ST-DIGRAPHS, SIAM journal on computing, 24(5), 1995, pp. 970-1001
Authors:
MILTERSEN PB
SUBRAMANIAN S
VITTER JS
TAMASSIA R
Citation: Pb. Miltersen et al., COMPLEXITY MODELS FOR INCREMENTAL COMPUTATION, Theoretical computer science, 130(1), 1994, pp. 203-236
Authors:
TAMASSIA R
TOLLIS IG
Citation: R. Tamassia et Ig. Tollis, DYNAMIC REACHABILITY IN PLANAR DIGRAPHS WITH ONE SOURCE AND ONE SINK, Theoretical computer science, 119(2), 1993, pp. 331-343
Authors:
PREPARATA FP
TAMASSIA R
Citation: Fp. Preparata et R. Tamassia, EFFICIENT POINT LOCATION IN A CONVEX SPATIAL CELL-COMPLEX, SIAM journal on computing, 21(2), 1992, pp. 267-280
Risultati:
1-21
|