-
1
-
-
70350055708
-
An algorithm for drawing compound graphs
-
J. Kratochvíl, editor, number 1731 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
F. Bertault and M. Miller. An algorithm for drawing compound graphs. In J. Kratochvíl, editor, Proc. 7th Int. Symp. Graph Drawing (GD 1999), number 1731 in Lecture Notes in Computer Science, LNCS, pages 197-204. Springer-Verlag, 2000.
-
(2000)
Proc. 7th Int. Symp. Graph Drawing (GD 1999)
, pp. 197-204
-
-
Bertault, F.1
Miller, M.2
-
5
-
-
84956704500
-
Drawing graphs with nonuniform nodes using potential fields
-
G. Liotta, editor, number 2912 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
J. H. Chuang, C. C. Lin, and H. C. Yen. Drawing graphs with nonuniform nodes using potential fields. In G. Liotta, editor, Proc. 11th Int. Symp. Graph Drawing (GD 2003), number 2912 in Lecture Notes in Computer Science, LNCS, pages 460-465. Springer-Verlag, 2004.
-
(2004)
Proc. 11th Int. Symp. Graph Drawing (GD 2003)
, pp. 460-465
-
-
Chuang, J.H.1
Lin, C.C.2
Yen, H.C.3
-
7
-
-
0141894907
-
A system for graph-based visualization of the evolution of software
-
S. Diehl, J. T. Stasko, and S. N. Spencer, editors. ACM
-
C. Collberg, S. Kobourov, J. Nagra, J. Pitts, and K. Wampler. A system for graph-based visualization of the evolution of software. In S. Diehl, J. T. Stasko, and S. N. Spencer, editors, Proceedings ACM 2003 Symposium on Software Visualization, pages 77-86. ACM, 2003.
-
(2003)
Proceedings ACM 2003 Symposium on Software Visualization
, pp. 77-86
-
-
Collberg, C.1
Kobourov, S.2
Nagra, J.3
Pitts, J.4
Wampler, K.5
-
8
-
-
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. Computational Geometry: Theory and Applications, 4(5):235-282, 1994.
-
(1994)
Computational Geometry: Theory and Applications
, vol.4
, Issue.5
, pp. 235-282
-
-
Di Battista, G.1
Eades, P.2
Tamassia, R.3
Tollis, I.G.4
-
9
-
-
84867485251
-
Graphs, they are changing - Dynamic graph drawing for a sequence of graphs
-
M. T. Goodrich and S. G. Kobourov, editors, number 2528 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
S. Diehl and C. Gorg. Graphs, They Are Changing - Dynamic Graph Drawing for a Sequence of Graphs. In M. T. Goodrich and S. G. Kobourov, editors, Proc. 10th Int. Symp. Graph Drawing (GD 2002), number 2528 in Lecture Notes in Computer Science, LNCS, pages 23-31. Springer-Verlag, 2002.
-
(2002)
Proc. 10th Int. Symp. Graph Drawing (GD 2002)
, pp. 23-31
-
-
Diehl, S.1
Gorg, C.2
-
10
-
-
16244416748
-
Three dimensional UML using force directed layout
-
P. Eades and T. Pattison, editors, Australian Symposium on Information Visualisation, (invis.au 2001), Sydney, Australia. ACS
-
T. Dwyer. Three dimensional UML using force directed layout. In P. Eades and T. Pattison, editors, Australian Symposium on Information Visualisation, (invis.au 2001), volume 9 of Conferences in Research and Practice in Information Technology, pages 77-85, Sydney, Australia, 2001. ACS.
-
(2001)
Conferences in Research and Practice in Information Technology
, vol.9
, pp. 77-85
-
-
Dwyer, T.1
-
11
-
-
84957692275
-
Multilevel visualization of clustered graphs
-
S. C. North, editor, number 1190 in Lecture Notes in Computer Science, LNCS. Springer-Verlag, 18-20 September
-
P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. In S. C. North, editor, Proc. 4th Int. Symp. Graph Drawing (GD 1996), number 1190 in Lecture Notes in Computer Science, LNCS, pages 101-112. Springer-Verlag, 18-20 September 1996.
-
(1996)
Proc. 4th Int. Symp. Graph Drawing (GD 1996)
, pp. 101-112
-
-
Eades, P.1
Feng, Q.W.2
-
12
-
-
84867453337
-
Graphviz - Open source graph drawing tools
-
P. Mutzel, M. Jünger, and S. Leipert, editors, number 2265 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
J. Ellson, E. R. Gansner, L. Koutsofios, S. C. North, and G. Woodhull. Graphviz - open source graph drawing tools. In P. Mutzel, M. Jünger, and S. Leipert, editors, Proc. 9th Int. Symp. Graph Drawing (GD 2001), number 2265 in Lecture Notes in Computer Science, LNCS, pages 483-484. Springer-Verlag, 2002.
-
(2002)
Proc. 9th Int. Symp. Graph Drawing (GD 2001)
, pp. 483-484
-
-
Ellson, J.1
Gansner, E.R.2
Koutsofios, L.3
North, S.C.4
Woodhull, G.5
-
13
-
-
84957872763
-
Improved force-directed layouts
-
S. Whitesides, editor, number 1547 in Lecture Notes in Computer. Science, LNCS. Springer-Verlag
-
E. R. Gansner and S. C. North. Improved force-directed layouts. In S. Whitesides, editor, Proc. 6th Int. Symp. Graph Drawing (GD 1998), number 1547 in Lecture Notes in Computer. Science, LNCS, pages 364-373. Springer-Verlag, 1998.
-
(1998)
Proc. 6th Int. Symp. Graph Drawing (GD 1998)
, pp. 364-373
-
-
Gansner, E.R.1
North, S.C.2
-
14
-
-
4043171150
-
A fast multi-scale algorithm for drawing large graphs
-
D. Harel and Y Koren. A Fast Multi-Scale Algorithm for Drawing Large Graphs. J. Graph Algorithms Appl., 6(3):179-202, 2002.
-
(2002)
J. Graph Algorithms Appl.
, vol.6
, Issue.3
, pp. 179-202
-
-
Harel, D.1
Koren, Y.2
-
16
-
-
0033872934
-
Graph visualization and navigation in information visualization: A survey
-
I. Herman, G. Melançon, and M. S. Marshall. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1):24-43, 2000.
-
(2000)
IEEE Transactions on Visualization and Computer Graphics
, vol.6
, Issue.1
, pp. 24-43
-
-
Herman, I.1
Melançon, G.2
Marshall, M.S.3
-
18
-
-
84957873474
-
A fully animated interactive system for clustering and navigating huge graphs
-
S. Whitesides, editor, number 1547 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
M. L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In S. Whitesides, editor, Proc. 6th Int. Symp. Graph Drawing (GD 1998), number 1547 in Lecture Notes in Computer Science, LNCS, pages 374-383. Springer-Verlag, 1998.
-
(1998)
Proc. 6th Int. Symp. Graph Drawing (GD 1998)
, pp. 374-383
-
-
Huang, M.L.1
Eades, P.2
-
19
-
-
0024640140
-
An algorithm for drawing general undirected graphs
-
April
-
T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15, April 1989.
-
(1989)
Information Processing Letters
, vol.31
, Issue.1
, pp. 7-15
-
-
Kamada, T.1
Kawai, S.2
-
20
-
-
0038636794
-
-
Number 2025 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
M. Kaufmann and D. Wagner, editors. Drawing Graphs: Methods and Models. Number 2025 in Lecture Notes in Computer Science, LNCS. Springer-Verlag, 2001.
-
(2001)
Drawing Graphs: Methods and Models
-
-
Kaufmann, M.1
Wagner, D.2
-
21
-
-
85014167243
-
Seven good reasons for mobile agents
-
D. Lange and M. Oshima. Seven Good Reasons for Mobile Agents. Communications of the ACM, 42(3):88-89, 1999.
-
(1999)
Communications of the ACM
, vol.42
, Issue.3
, pp. 88-89
-
-
Lange, D.1
Oshima, M.2
-
22
-
-
0001633699
-
Layout adjustment and the mental map
-
K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6(2):183-210, 1995.
-
(1995)
Journal of Visual Languages and Computing
, vol.6
, Issue.2
, pp. 183-210
-
-
Misue, K.1
Eades, P.2
Lai, W.3
Sugiyama, K.4
-
23
-
-
84947918909
-
Incremental layout in dynadag
-
F. J. Brandenburg, editor, number 1027 in Lecture Notes in Computer Science, LNCS, Springer-Verlag
-
S. C. North. Incremental layout in dynadag. In F. J. Brandenburg, editor, Proc. 3rd Int. Symp. Graph Drawing (GD 1995), number 1027 in Lecture Notes in Computer Science, LNCS, pages 409-418. Springer-Verlag, 1995.
-
(1995)
Proc. 3rd Int. Symp. Graph Drawing (GD 1995)
, pp. 409-418
-
-
North, S.C.1
-
25
-
-
0019530043
-
Methods for visual understanding of hierachical system structures
-
February
-
K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierachical system structures. IEEE Transactions on Systems, Man, and Cybernetics, SMC-11(2): 109-125, February 1981.
-
(1981)
IEEE Transactions on Systems, Man, and Cybernetics
, vol.SMC-11
, Issue.2
, pp. 109-125
-
-
Sugiyama, K.1
Tagawa, S.2
Toda, M.3
-
29
-
-
4043141349
-
A multilevel algorithm for force-directed graph drawing
-
C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. J. Graph Algorithms Appl., 7(3):253-285, 2003.
-
(2003)
J. Graph Algorithms Appl.
, vol.7
, Issue.3
, pp. 253-285
-
-
Walshaw, C.1
-
30
-
-
84947901056
-
Generating customized layouts
-
F. J. Brandenburg, editor, number 1027 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
X. Wang and I. Miyamoto. Generating customized layouts. In F. J. Brandenburg, editor, Proc. 3rd Int. Symp. Graph Drawing (GD 1995), number 1027 in Lecture Notes in Computer Science, LNCS, pages 504-515. Springer-Verlag, 1996.
-
(1996)
Proc. 3rd Int. Symp. Graph Drawing (GD 1995)
, pp. 504-515
-
-
Wang, X.1
Miyamoto, I.2
-
31
-
-
77956545247
-
Yfiles: Visualization and automatic layout of graphs
-
P. Mutzel, M. Jünger, and S. Leipert, editors, number 2265 in Lecture Notes in Computer Science, LNCS. Springer-Verlag
-
R. Wiese, M. Eiglsperger, and M. Kaufmann, yfiles: Visualization and automatic layout of graphs. In P. Mutzel, M. Jünger, and S. Leipert, editors, Proc. 9th Int. Symp. Graph Drawing (GD 2001), number 2265 in Lecture Notes in Computer Science, LNCS, pages 453-454. Springer-Verlag, 2001.
-
(2001)
Proc. 9th Int. Symp. Graph Drawing (GD 2001)
, pp. 453-454
-
-
Wiese, R.1
Eiglsperger, M.2
Kaufmann, M.3
|