-
3
-
-
84958951530
-
Generality in policy network drawings
-
In Proc. Symp. Graph Drawing GD'99, Springer-Verlag, Berlin, Kratochvíl J. Ed.
-
BRANDES, U., KENIS, P., AND WAGNER, D. 1999. Generality in policy network drawings. In Proc. Symp. Graph Drawing GD'99, Springer-Verlag, Berlin, J. Kratochvíl, Ed., vol. 1731 of Lecture Notes in Computer Science, 250-258.
-
(1999)
Lecture Notes in Computer Science
, vol.1731
, pp. 250-258
-
-
Brandes, U.1
Kenis, P.2
Wagner, D.3
-
4
-
-
0030264246
-
Drawing graphs nicely using simulated annealing
-
DAVIDSON, R., AND HAREL, D. 1996. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15, 4, 301-331.
-
(1996)
ACM Transactions on Graphics
, vol.15
, Issue.4
, pp. 301-331
-
-
Davidson, R.1
Harel, D.2
-
5
-
-
84957609661
-
Constraintdriven diagram layout
-
DENGLER, E., FRIEDELL, M., AND MARKS, J. 1993. Constraintdriven diagram layout. In Proc. IEEE Symp. Visual Languages, 330-335.
-
(1993)
Proc. IEEE Symp. Visual Languages
, pp. 330-335
-
-
Dengler, E.1
Friedell, M.2
Marks, J.3
-
6
-
-
84867485251
-
Graphs, they are changing - Dynamic graph drawing for a sequence of graphs
-
Proc. Symp. Graph Drawing GD'02, S. G. Kobourov and M. T. Goodrich, Eds.
-
DIEHL, S., AND GÖRG, C. 2002. Graphs, they are changing - dynamic graph drawing for a sequence of graphs. In Proc. Symp. Graph Drawing GD'02, S. G. Kobourov and M. T. Goodrich, Eds., vol. 2528 of Lecture Notes in Computer Science, 23-30.
-
(2002)
Lecture Notes in Computer Science
, vol.2528
, pp. 23-30
-
-
Diehl, S.1
Görg, C.2
-
7
-
-
4043157930
-
Comaide: Information visualization using cooperative 3d diagram layout
-
Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed.
-
DODSON, D. 1995. Comaide: Information visualization using cooperative 3d diagram layout. In Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 190-201.
-
(1995)
Lecture Notes in Computer Science
, vol.1027
, pp. 190-201
-
-
Dodson, D.1
-
9
-
-
0001070640
-
A heuristic for graph drawing
-
EADES, P. 1984. A heuristic for graph drawing. Congressus Numerantium 42, 149-160.
-
(1984)
Congressus Numerantium
, vol.42
, pp. 149-160
-
-
Eades, P.1
-
10
-
-
84957542241
-
A fast adaptive layout algorithm for undirected graphs
-
Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds.
-
FRICK, A., LUDWIG, A., AND MEHLDAU, H. 1995. A fast adaptive layout algorithm for undirected graphs. In Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds., vol. 894 of Lecture Notes in Computer Science, 388-403.
-
(1995)
Lecture Notes in Computer Science
, vol.894
, pp. 388-403
-
-
Frick, A.1
Ludwig, A.2
Mehldau, H.3
-
11
-
-
0141943195
-
Integration of declarative approaches
-
In Proc. Symp. Graph Drawing GD'96, S. North, Ed.
-
FRICK, A., KESKIN, C., AND VOGELMANN, V. 1996. Integration of declarative approaches. In Proc. Symp. Graph Drawing GD'96, S. North, Ed., vol. 1190 of Lecture Notes in Computer Science, 184-192.
-
(1996)
Lecture Notes in Computer Science
, vol.1190
, pp. 184-192
-
-
Frick, A.1
Keskin, C.2
Vogelmann, V.3
-
12
-
-
84867483720
-
Graph drawing in motion II
-
Proc. Symp. Graph Drawing GD'01, P. M. et al., Ed.
-
FRIEDRICH, C., AND HOULE, M. E. 2002. Graph drawing in motion II. In Proc. Symp. Graph Drawing GD'01, P. M. et al., Ed., vol. 2265 of Lecture Notes in Computer Science, 220-231.
-
(2002)
Lecture Notes in Computer Science
, vol.2265
, pp. 220-231
-
-
Friedrich, C.1
Houle, M.E.2
-
13
-
-
0026257928
-
Graph drawing by force-directed placement
-
FRUCHTERMAN, T., AND REINGOLD, E. 1991. Graph drawing by force-directed placement. Software - Practice and Experience 21, 11, 1129-1164. also as Technical Report UIUCDCS-R-90-1609, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1990.
-
(1991)
Software - Practice and Experience
, vol.21
, Issue.11
, pp. 1129-1164
-
-
Fruchterman, T.1
Reingold, E.2
-
14
-
-
0026257928
-
-
Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign
-
FRUCHTERMAN, T., AND REINGOLD, E. 1991. Graph drawing by force-directed placement. Software - Practice and Experience 21, 11, 1129-1164. also as Technical Report UIUCDCS-R-90-1609, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1990.
-
(1990)
Technical Report
, vol.UIUCDCS-R-90-1609
-
-
-
15
-
-
84957872763
-
Improved force-directed layouts
-
Proc. Symp. Graph Drawing GD'98, Springer-Verlag, Montreal, Canada, S. Whitesides, Ed.
-
GANSNER, E., AND NORTH, S. 1999. Improved force-directed layouts. In Proc. Symp. Graph Drawing GD'98, Springer-Verlag, Montreal, Canada, S. Whitesides, Ed., vol. 1547 of Lecture Notes in Computer Science, 364-373.
-
(1999)
Lecture Notes in Computer Science
, vol.1547
, pp. 364-373
-
-
Gansner, E.1
North, S.2
-
16
-
-
0027553807
-
A technique for drawing directed graphs
-
GANSNER, E. R., KOUTSOFIOS, E., NORTH, S. C., AND Vo, K.-P. 1993. A technique for drawing directed graphs. IEEE Trans. Software Engineering 19, 3, 214-230.
-
(1993)
IEEE Trans. Software Engineering
, vol.19
, Issue.3
, pp. 214-230
-
-
Gansner, E.R.1
Koutsofios, E.2
North, S.C.3
Vo, K.-P.4
-
18
-
-
84957633546
-
Constrained graph layout
-
Proc. Symp. Graph Drawing GD'96, S. North, Ed.
-
HE, W., AND MARRIOTT, K. 1997. Constrained graph layout. In Proc. Symp. Graph Drawing GD'96, S. North, Ed., vol. 1190 of Lecture Notes in Computer Science, 217-232.
-
(1997)
Lecture Notes in Computer Science
, vol.1190
, pp. 217-232
-
-
He, W.1
Marriott, K.2
-
19
-
-
0032337812
-
On-line animated visualization of huge graphs using a modified spring algorithm
-
Dec.
-
HUANG, M. L., EADES, P., AND WANG, J. 1998. On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing 9, 6 (Dec.), 623-645.
-
(1998)
Journal of Visual Languages and Computing
, vol.9
, Issue.6
, pp. 623-645
-
-
Huang, M.L.1
Eades, P.2
Wang, J.3
-
20
-
-
0032179535
-
Distributed feature composition: A virtual architecture for telecommunications services
-
Oct.
-
JACKSON, M., AND ZAVE, P. 1998. Distributed feature composition: A virtual architecture for telecommunications services. IEEE Trans. Software Engineering 24, 10 (Oct.), 831-847.
-
(1998)
IEEE Trans. Software Engineering
, vol.24
, Issue.10
, pp. 831-847
-
-
Jackson, M.1
Zave, P.2
-
21
-
-
0024640140
-
An algorithm for drawing general undirected graphs
-
Apr.
-
KAMADA, T., AND KAWAI, S. 1989. An algorithm for drawing general undirected graphs. Information Processing Letters 31, 1 (Apr.), 7-15.
-
(1989)
Information Processing Letters
, vol.31
, Issue.1
, pp. 7-15
-
-
Kamada, T.1
Kawai, S.2
-
22
-
-
84947922995
-
Constraint-based spring-model algorithm for graph layout
-
Proc. Symp. Graph Drawing GD'95, F. Brandenburg, Ed.
-
KAMPS, T., KLEINZ, J., AND READ, J. 1996. Constraint-based spring-model algorithm for graph layout. In Proc. Symp. Graph Drawing GD'95, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 349-360.
-
(1996)
Lecture Notes in Computer Science
, vol.1027
, pp. 349-360
-
-
Kamps, T.1
Kleinz, J.2
Read, J.3
-
23
-
-
84947997572
-
Upward drawings on planes and spheres
-
Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed.
-
KISIELEWICZ, S. M. H. A., AND RIVAL, I. 1995. Upward drawings on planes and spheres. In Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 277-286.
-
(1995)
Lecture Notes in Computer Science
, vol.1027
, pp. 277-286
-
-
Kisielewicz, S.M.H.A.1
Rival, I.2
-
24
-
-
84947924426
-
Grid intersection and box intersection graphs on surfaces
-
Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed.
-
KRATOCHVIL, J., AND PRZYTYCKA, T. 1995. Grid intersection and box intersection graphs on surfaces. In Proc. Symp. Graph Drawing GD'95, Springer-Verlag, Berlin, F. Brandenburg, Ed., vol. 1027 of Lecture Notes in Computer Science, 365-372.
-
(1995)
Lecture Notes in Computer Science
, vol.1027
, pp. 365-372
-
-
Kratochvil, J.1
Przytycka, T.2
-
27
-
-
0001633699
-
Layout adjustment and the mental map
-
MISUE, K., EADES, P., LAI, W., AND SUGIYAMA, K. 1995. Layout adjustment and the mental map. J. Visual Languages and Computing 6, 2, 183-210.
-
(1995)
J. Visual Languages and Computing
, vol.6
, Issue.2
, pp. 183-210
-
-
Misue, K.1
Eades, P.2
Lai, W.3
Sugiyama, K.4
-
28
-
-
84867446737
-
Online hierarchical graph drawing
-
Proc. Symp, Graph Drawing GD'01, P. M. et al., Ed.
-
NORTH, S. C., AND WOODHULL, G. C. M. 2002. Online hierarchical graph drawing. In Proc. Symp, Graph Drawing GD'01, P. M. et al., Ed., vol. 2265 of Lecture Notes in Computer Science, 232-246.
-
(2002)
Lecture Notes in Computer Science
, vol.2265
, pp. 232-246
-
-
North, S.C.1
Woodhull, G.C.M.2
-
29
-
-
84958567832
-
Clan-based incremental drawing
-
Proc. Symp. Graph Drawing GD'00, J. Marks, Ed.
-
SHIEH, F.-S., AND McCREARY, C. L. 2000. Clan-based incremental drawing. In Proc. Symp. Graph Drawing GD'00, J. Marks, Ed., vol. 1984 of Lecture Notes in Computer Science, 384-395.
-
(2000)
Lecture Notes in Computer Science
, vol.1984
, pp. 384-395
-
-
Shieh, F.-S.1
McCreary, C.L.2
-
30
-
-
84957578504
-
A simple and unified method for drawing graphs: Magnetic-spring algorithm
-
Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds.
-
SUGIYAMA, K., AND MISUE, K. 1995. A simple and unified method for drawing graphs: Magnetic-spring algorithm. In Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds., vol. 894 of Lecture Notes in Computer Science, 364-375.
-
(1995)
Lecture Notes in Computer Science
, vol.894
, pp. 364-375
-
-
Sugiyama, K.1
Misue, K.2
-
31
-
-
0019530043
-
Methods for visual understanding of hierarchical systems
-
SUGIYAMA, K., TAGAWA, S., AND TODA, M. 1981. Methods for visual understanding of hierarchical systems. IEEE Trans. Systems, Man and Cybernetics SMC-11, 2, 109-125.
-
(1981)
IEEE Trans. Systems, Man and Cybernetics
, vol.SMC-11
, Issue.2
, pp. 109-125
-
-
Sugiyama, K.1
Tagawa, S.2
Toda, M.3
-
32
-
-
0141977851
-
Representations of graphs on a cylinder
-
Feb.
-
TAMASSIA, R., AND TOLLIS, I. G. 1991. Representations of graphs on a cylinder. SIAM J. Disc. Math. 4, 1 (Feb.), 139-149.
-
(1991)
SIAM J. Disc. Math.
, vol.4
, Issue.1
, pp. 139-149
-
-
Tamassia, R.1
Tollis, I.G.2
-
33
-
-
84957547149
-
Drawing telecommunications networks
-
Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds.
-
TOLLIS, I., AND XIA, C. 1995. Drawing telecommunications networks. In Proc. Symp. Graph Drawing GD'94, R. Tamassia and I. Tollis, Eds., vol. 894 of Lecture Notes in Computer Science, 206-217.
-
(1995)
Lecture Notes in Computer Science
, vol.894
, pp. 206-217
-
-
Tollis, I.1
Xia, C.2
-
34
-
-
0141874030
-
-
C. R., www.research.att.com/projects/eclipse
-
ZAVE, P., AND ET AL., C. R., 2002. The Building Box Project. www.research.art.com/projects/ buildingbox, www.research.att.com/projects/ eclipse.
-
(2002)
The Building Box Project
-
-
Zave, P.1
|