-
3
-
-
85013937365
-
Optimal upward planarity testing of single-source digraphs
-
LNCS Springer-Verlag
-
P. Bertolazzi, G. Di Battista, C. Mannino, and R. Tamassia. Optimal upward planarity testing of single-source digraphs. In Proc. European Symposium on Algorithms, LNCS vol. 726, pp. 37-48. Springer-Verlag, 1993.
-
(1993)
Proc. European Symposium on Algorithms
, vol.726
, pp. 37-48
-
-
Bertolazzi, P.1
Di Battista, G.2
Mannino, C.3
Tamassia, R.4
-
4
-
-
85005976373
-
A better heuristic for orthogonal graph drawings
-
LNCS Springer-Verlag
-
T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In Proc. European Symp. on Algorithms, LNCS vol. 855, pp. 24-35. Springer-Verlag, 1994.
-
(1994)
Proc. European Symp. on Algorithms
, vol.855
, pp. 24-35
-
-
Biedl, T.1
Kant, G.2
-
5
-
-
84947951394
-
Algorithms for drawing graphs: An annotated bibüography
-
to appear. Preprint
-
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibüography. Comput. Geom. Theory Appl., to appear. Preprint available by ftp from ftp. es. brown. edu: pub/papers/compgeo/.
-
Comput. Geom. Theory Appl
-
-
Di Battista, G.1
Eades, P.2
Tamassia, R.3
Tollis, I.G.4
-
6
-
-
85029494901
-
Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs
-
LNCS Springer-Verlag
-
G. Di Battista, G. Liotta, and F. Vargiu. Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs. In Proc. Workshop Algorithms Data Struct., LNCS vol. 709, pp. 151-162. Springer-Verlag, 1993.
-
(1993)
Proc. Workshop Algorithms Data Struct
, vol.709
, pp. 151-162
-
-
Di Battista, G.1
Liotta, G.2
Vargiu, F.3
-
8
-
-
0024108464
-
Algorithms for plane representations of acyclic digraphs
-
G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61: 175-198, 1988.
-
(1988)
Theoret. Comput. Sci
, vol.61
, pp. 175-198
-
-
Di Battista, G.1
Tamassia, R.2
-
11
-
-
0042526115
-
-
Report CS-94-10, Comput. Sci. Dept., Brown Univ., Providence, RI
-
A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Report CS-94-10, Comput. Sci. Dept., Brown Univ., Providence, RI, 1994.
-
(1994)
On the computational complexity of upward and rectilinear planarity testing
-
-
Garg, A.1
Tamassia, R.2
-
14
-
-
38249036919
-
Fundamentals of planar ordered sets
-
D. Kelly. Fundamentals of planar ordered sets. Discrete Math., 63: 197-216, 1987.
-
(1987)
Discrete Math
, vol.63
, pp. 197-216
-
-
Kelly, D.1
-
15
-
-
0009046907
-
Planar lattices
-
D. Kelly and I. Rival. Planar lattices. Canad. J. Math., 27(3): 636-665, 1975.
-
(1975)
Canad. J. Math
, vol.27
, Issue.3
, pp. 636-665
-
-
Kelly, D.1
Rival, I.2
-
18
-
-
0009048366
-
Theoretical results on at most 1-bend embeddability of graphs. Technical report, Dipartimento di Statistica, Univ. di Roma
-
Y. Liu, P. Marchioro, R. Petreschi, and B. Simeone. Theoretical results on at most 1-bend embeddability of graphs. Technical report, Dipartimento di Statistica, Univ. di Roma "La Sapienza," 1990.
-
(1990)
La Sapienza
-
-
Liu, Y.1
Marchioro, P.2
Petreschi, R.3
Simeone, B.4
-
19
-
-
0009046908
-
General theoretical results on rectilinear embeddability of graphs
-
Y. Liu, A. Morgana, and B. Simeone. General theoretical results on rectilinear embeddability of graphs. Acta Math. Appl. Sinica, 7: 187-192, 1991.
-
(1991)
Acta Math. Appl. Sinica
, vol.7
, pp. 187-192
-
-
Liu, Y.1
Morgana, A.2
Simeone, B.3
-
21
-
-
0009000345
-
Upward planarity testing of outerplanar dags
-
A. Papakostas. Upward planarity testing of outerplanar dags. In Proc. Graph Drawing '94, 1994.
-
(1994)
Proc. Graph Drawing '94
-
-
Papakostas, A.1
-
22
-
-
0009008633
-
Planar lattices and planar graphs
-
C. Platt. Planar lattices and planar graphs. J. Combin. Theory Ser. B, 21: 30-39, 1976.
-
(1976)
J. Combin. Theory Ser. B
, vol.21
, pp. 30-39
-
-
Platt, C.1
-
23
-
-
0008962406
-
Reading, drawing, and order
-
I.G. Rosenberg and G. Sabidussi, editors,Kluwer Academic Publishers
-
I. Rival. Reading, drawing, and order. In I. G. Rosenberg and G. Sabidussi, editors, Algebras and Orders, pp. 359-404. Kluwer Academic Publishers, 1993.
-
(1993)
Algebras and Orders
, pp. 359-404
-
-
Rival, I.1
-
25
-
-
0021439251
-
On minimal node-cost planar embeddings
-
J. A. Storer. On minimal node-cost planar embeddings. Networks, 14: 181-212, 1984.
-
(1984)
Networks
, vol.14
, pp. 181-212
-
-
Storer, J.A.1
-
26
-
-
0023366861
-
On embedding a graph
-
the grid with the minimum number of bends
-
R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3): 421-444, 1987.
-
(1987)
SIAM J. Comput
, vol.16
, Issue.3
, pp. 421-444
-
-
Tamassia, R.1
-
28
-
-
0008962241
-
Planar acyclic oriented graphs
-
C. Thomassen. Planar acyclic oriented graphs. Order, 5(4): 349-361, 1989.
-
(1989)
Order
, vol.5
, Issue.4
, pp. 349-361
-
-
Thomassen, C.1
-
29
-
-
0019532794
-
Universality considerations
-
VLSI circuits
-
L. Valiant. Universality considerations in VLSI circuits. IEEE Trans. Comput., C-30(2): 135-140, 1981.
-
(1981)
IEEE Trans. Comput
, vol.C-30
, Issue.2
, pp. 135-140
-
-
Valiant, L.1
-
30
-
-
0022059741
-
Rectilinear graphs and their embeddings
-
G. Vijayan and A. Wigderson. Rectilinear graphs and their embeddings. SIAM J. Comput., 14: 355-372, 1985.
-
(1985)
SIAM J. Comput
, vol.14
, pp. 355-372
-
-
Vijayan, G.1
Wigderson, A.2
|