-
1
-
-
0003925394
-
-
Prentice Hall, NJ
-
G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing, Prentice Hall, NJ (1999).
-
(1999)
Graph Drawing
-
-
Di Battista, G.1
Eades, P.2
Tamassia, R.3
Tollis, I.G.4
-
2
-
-
0004688398
-
A linear algorithm to find a rectangular dual of a planar triangulated graph
-
J. Bhasker and S. Sahni, A linear algorithm to find a rectangular dual of a planar triangulated graph, Algorithmica, 3, pp.247-278, 1988.
-
(1988)
Algorithmica
, vol.3
, pp. 247-278
-
-
Bhasker, J.1
Sahni, S.2
-
3
-
-
84957671364
-
A new minimum cost flow algorithm with applications to graph drawing
-
Lect. Notes in Computer Science
-
A. Garg and R. Tamassia, A new minimum cost flow algorithm with applications to graph drawing, Proc. of Graph Drawing'96, Lect. Notes in Computer Science, 1190, pp. 201-206, 1997.
-
(1997)
Proc. of Graph Drawing'96
, vol.1190
, pp. 201-206
-
-
Garg, A.1
Tamassia, R.2
-
4
-
-
0027833068
-
On finding the rectangular duals of planar triangulated graphs
-
X. He, On finding the rectangular duals of planar triangulated graphs, SIAM J. Comput., 22, 6, pp. 1218-1226, 1993.
-
(1993)
SIAM J. Comput.
, vol.22
, Issue.6
, pp. 1218-1226
-
-
He, X.1
-
5
-
-
0033348663
-
On floor-plan of plane graphs
-
X. He, On floor-plan of plane graphs, SIAM J. Comput., 28, 6, pp. 2150-2167, 1999.
-
(1999)
SIAM J. Comput.
, vol.28
, Issue.6
, pp. 2150-2167
-
-
He, X.1
-
6
-
-
0031069913
-
Regular edge-labeling of 4-connected plane graphs and its applications in graph drawing problems
-
G. Kant and X. He, Regular edge-labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoret. Comput. Sci., 172, pp. 175-193, 1997.
-
(1997)
Theoret. Comput. Sci.
, vol.172
, pp. 175-193
-
-
Kant, G.1
He, X.2
-
7
-
-
0021197558
-
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSIintegrated circuits
-
Albuquerque
-
K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSIintegrated circuits, Proc. of 21st DAC, Albuquerque, pp. 655-656, 1984.
-
(1984)
Proc. of 21st DAC
, pp. 655-656
-
-
Kozminski, K.1
Kinnen, E.2
-
9
-
-
31244431660
-
Rectangular drawings of plane graphs without designated corners
-
M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular drawings of plane graphs without designated corners, Computational Geometry, 21, pp. 121-138, 2002.
-
(2002)
Computational Geometry
, vol.21
, pp. 121-138
-
-
Rahman, M.S.1
Nakano, S.2
Nishizeki, T.3
-
10
-
-
0039392554
-
Rectangular grid drawings of plane graphs
-
M. S. Rahman, S. Nakano and T. Nishizeki, Rectangular grid drawings of plane graphs, Comp. Geom. Theo. Appl., 10(3), pp. 203-220, 1998.
-
(1998)
Comp. Geom. Theo. Appl.
, vol.10
, Issue.3
, pp. 203-220
-
-
Rahman, M.S.1
Nakano, S.2
Nishizeki, T.3
-
11
-
-
0013361447
-
Plane representations of graphs
-
J. A. Bondy, U. S. R. Murty (Eds.) Academic Press Canada, Don Mills, Ontario, Canada
-
C. Thomassen, Plane representations of graphs, J. A. Bondy, U. S. R. Murty (Eds.), Progress in Graph Theory, Academic Press Canada, Don Mills, Ontario, Canada, pp. 43-69, 1984.
-
(1984)
Progress in Graph Theory
, pp. 43-69
-
-
Thomassen, C.1
|