-
1
-
-
84957552038
-
Proximity constrahts and representable trees
-
R. Tamassia and I. G. Tollis, editors, Springer-Verlag
-
P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity constrahts and representable trees. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proe. GD '94), volume 894 of Lecture Notes in Computer Science, pages 340-351. Springer-Verlag, 1995.
-
(1995)
Graph Drawing (Proe. GD '94), Volume 894 of Lecture Notes in Computer Science
, pp. 340-351
-
-
Bose, P.1
Di Battista, G.2
Lenhart, W.3
Liotta, G.4
-
4
-
-
0039581375
-
Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications, to appear
-
P. Bose, M. McAllister, and J. Snoeyink. Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications, to appear. Also appears in Proceedings of Graph Drawing GD'95, LNCS 1027, pp. 64-75, 1995.
-
(1995)
Proceedings of Graph Drawing GD'95, LNCS
, vol.1027
, pp. 64-75
-
-
Bose, P.1
McAllister, M.2
Snoeyink, J.3
-
5
-
-
84922451359
-
On the convex layers of a planar set
-
B. Chazelle. On the convex layers of a planar set. IEEE Trans. on Inf. Theory, IT-31:509-517, 1985.
-
(1985)
IEEE Trans. on Inf. Theory
, vol.IT-31
, pp. 509-517
-
-
Chazelle, B.1
-
6
-
-
0004116989
-
-
MIT Press, Cambridge, Mass
-
T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press, Cambridge, Mass., 1990.
-
(1990)
Introduction to Algorithms
-
-
Cormen, T.1
Leiserson, C.2
Rivest, R.3
-
7
-
-
84957601043
-
Optimal-area upward drawings of AVL trees
-
R. Tamassia and I. G. Tollis, editors, Springer-Verlag
-
P. Crescenzi and A. Piperno. Optimal-area upward drawings of AVL trees. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proe. GD '94), volume 894 of Lecture Notes in Computer Science, pages 307-317. Springer-Verlag, 1995.
-
(1995)
Graph Drawing (Proe. GD '94), Volume 894 of Lecture Notes in Computer Science
, pp. 307-317
-
-
Crescenzi, P.1
Piperno, A.2
-
9
-
-
43949160006
-
Algorithms for drawing graphs: An annotated bibliography
-
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235-282, 1994.
-
(1994)
Comput. Geom. Theory Appl.
, vol.4
, pp. 235-282
-
-
Di Battista, G.1
Eades, P.2
Tamassia, R.3
Tollis, I.G.4
-
10
-
-
0028022433
-
The realization problem for Euclidean minimum spanning trees is NP-hard
-
P. Eades and S. Whitesides. The realization problem for Euclidean minimum spanning trees is NP-hard. In Proc. 10th Annu. ACM Sympos. Cornput. Geom., pages 49-56, 1994.
-
(1994)
Proc. 10Th Annu. ACM Sympos. Cornput. Geom
, pp. 49-56
-
-
Eades, P.1
Whitesides, S.2
-
11
-
-
0001567493
-
On straight line representation of planar graphs
-
I. Fary. On straight line representation of planar graphs. Acta Sci. Math. Szeged, 11:229-233, 1948.
-
(1948)
Acta Sci. Math. Szeged
, vol.11
, pp. 229-233
-
-
Fary, I.1
-
12
-
-
0004489683
-
Embedding a planar triangulation with vertices at specified points (Solution to problem e3341
-
P. Gritzmann, B. Mohar, J. Pach, and R. Pollack. Embedding a planar triangulation with vertices at specified points (solution to problem e3341. American Mathematical Monthly, 98:165-166, 1991.
-
(1991)
American Mathematical Monthly
, vol.98
, pp. 165-166
-
-
Gritzmann, P.1
Mohar, B.2
Pach, J.3
Pollack, R.4
-
13
-
-
0000747134
-
Applications of a semi-dynamic convex hull algorithm
-
John Hershberger and Subhash Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32:249-267, 1992.
-
(1992)
BIT
, vol.32
, pp. 249-267
-
-
Hershberger, J.1
Suri, S.2
-
14
-
-
51249165979
-
The rooted tree embedding problem into points in the plane
-
Y. Ikebe, M. Perles, A. Tamura, and S. Tokunaga. The rooted tree embedding problem into points in the plane. Discrete & Computational Geometry, 11:51-63, 1994.
-
(1994)
Discrete & Computational Geometry
, vol.11
, pp. 51-63
-
-
Ikebe, Y.1
Perles, M.2
Tamura, A.3
Tokunaga, S.4
-
15
-
-
3042626352
-
Area requirement of visibility representations of trees
-
Waterloo, Canada
-
G. Kant, G. Liotta, R. Tamassia, and I. Toms. Area requirement of visibility representations of trees. In Proc. 5th Canad. Conf. Comput. Geom., pages 192-197, Waterloo, Canada, 1993.
-
(1993)
Proc. 5Th Canad. Conf. Comput. Geom
, pp. 192-197
-
-
Kant, G.1
Liotta, G.2
Tamassia, R.3
Toms, I.4
-
16
-
-
0342825403
-
Fast detection and display of symmetry in trees
-
J. Manning and M. J. Atallah. Fast detection and display of symmetry in trees. Congressu8 Numerantium, 64:159-169, 1988.
-
(1988)
Congressu8 Numerantium
, vol.64
, pp. 159-169
-
-
Manning, J.1
Atallah, M.J.2
-
20
-
-
0040766848
-
Layout of rooted trees
-
W. T. Trotter, editor, American Mathematical Society
-
János Pach and Jenö Töröcsik. Layout of rooted trees. In W. T. Trotter, editor, Planar Graphs, volume 9 of DIMACS Series, pages 131-137. American Mathematical Society, 1993.
-
(1993)
Planar Graphs, Volume 9 of DIMACS Series
, pp. 131-137
-
-
Pach, J.1
Töröcsik, J.2
|