-
1
-
-
24144448986
-
Visualizing large graphs with compound-fisheye views and treemaps
-
Graph Drwing - 12th International Symposium, GD 2004
-
J. Abello, S. Kobourov, and R. Yusufov, "Visualizing Large Graphs with Compound-Fisheye Views and Treemaps," Proc. Graph Drawing (GD '04), pp. 431-441, 2004. (Pubitemid 41239586)
-
(2004)
Lecture Notes in Computer Science
, vol.3383
, pp. 431-441
-
-
Abello, J.1
Kobourov, S.G.2
Yusufov, R.3
-
2
-
-
33845621411
-
ASK-GraphView: A large scale graph visualization system
-
DOI 10.1109/TVCG.2006.120
-
J. Abello, F. van Ham, and N. Krishnan, "Ask-Graphview: A Large Scale Graph Visualization System," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5, pp. 669-676, Sept./Oct. 2006. (Pubitemid 44955590)
-
(2006)
IEEE Transactions on Visualization and Computer Graphics
, vol.12
, Issue.5
, pp. 669-676
-
-
Abello, J.1
Van Ham, F.2
Krishnan, N.3
-
3
-
-
44649090431
-
Grouse: Feature-based, steerable graph hierarchy exploration
-
D. Archambault, T. Munzner, and D. Auber, "Grouse: Feature-Based, Steerable Graph Hierarchy Exploration," Proc. Eurographics, pp. 67-74, 2007.
-
(2007)
Proc. Eurographics
, pp. 67-74
-
-
Archambault, D.1
Munzner, T.2
Auber, D.3
-
4
-
-
33846617291
-
Topolayout: Multilevel graph layout by topological features
-
Mar./Apr.
-
D. Archambault, T. Munzner, and D. Auber, "Topolayout: Multilevel Graph Layout by Topological Features," IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 2, pp. 305-317, Mar./Apr. 2007.
-
(2007)
IEEE Trans. Visualization and Computer Graphics
, vol.13
, Issue.2
, pp. 305-317
-
-
Archambault, D.1
Munzner, T.2
Auber, D.3
-
5
-
-
44649096952
-
GrouseFlocks: Steerable exploration of graph hierarchy space
-
DOI 10.1109/TVCG.2008.34, 4447668
-
D. Archambault, T. Munzner, and D. Auber, "Grouseflocks: Steerable Exploration of Graph Hierarchy Space," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 4, pp. 900-913, July/Aug. 2008. (Pubitemid 351780215)
-
(2008)
IEEE Transactions on Visualization and Computer Graphics
, vol.14
, Issue.4
, pp. 900-913
-
-
Archambault, D.1
Munzner, T.2
Auber, D.3
-
6
-
-
78649575488
-
Multiscale visualization of small world networks
-
D. Auber, Y. Chiricota, F. Jourdan, and G. Melancon, "Multiscale Visualization of Small World Networks," Proc. IEEE Symp. Information Visualization (INFOVIS '03), pp. 75-81, 2003.
-
(2003)
Proc. IEEE Symp. Information Visualization (INFOVIS '03)
, pp. 75-81
-
-
Auber, D.1
Chiricota, Y.2
Jourdan, F.3
Melancon, G.4
-
7
-
-
80052614178
-
Collapsing fc-cliques to get a planar graph Is NP-complete
-
Roma Tre Univ.
-
V. Batagelj, F.J. Brandenburg, W. Didimo, G. Liotta, P. Palladino, and M. Patrignani, "Collapsing fc-Cliques to Get a Planar Graph Is NP-Complete," Technical Report RT-DIA-174-2010, Dept. Computer Science and Automation, Roma Tre Univ., 2010.
-
(2010)
Technical Report RT-DIA-174-2010, Dept. Computer Science and Automation
-
-
Batagelj, V.1
Brandenburg, F.J.2
Didimo, W.3
Liotta, G.4
Palladino, P.5
Patrignani, M.6
-
8
-
-
84958956637
-
Partitioning approach to visualization of large networks
-
V. Batagelj, A. Mrvar, and M. Zaversnik, "Partitioning Approach to Visualization of Large Networks," Proc. Graph Drawing (GD '99), pp. 90-97, 1999.
-
(1999)
Proc. Graph Drawing (GD '99)
, pp. 90-97
-
-
Batagelj, V.1
Mrvar, A.2
Zaversnik, M.3
-
9
-
-
56849098124
-
An O(m) algorithm for cores decomposition of networks
-
V. Batagelj and M. Zaversnik, "An O(m) Algorithm for Cores Decomposition of Networks," CoRR, cs.DS/0310049, 2003.
-
(2003)
CoRR, cs.DS/0310049
-
-
Batagelj, V.1
Zaversnik, M.2
-
11
-
-
84958969766
-
A force-directed algorithm that preserves edge crossing properties
-
F. Bertault, "A Force-Directed Algorithm that Preserves Edge Crossing Properties," Proc. Graph Drawing, pp. 351-358, 1999.
-
(1999)
Proc. Graph Drawing
, pp. 351-358
-
-
Bertault, F.1
-
12
-
-
0011632190
-
The evolution of sparse graphs
-
Academic Press
-
B. Bollobas, "The Evolution of Sparse Graphs," Graph Theory and Combinatorics, pp. 35-57, Academic Press, 1984.
-
(1984)
Graph Theory and Combinatorics
, pp. 35-57
-
-
Bollobas, B.1
-
14
-
-
23044534990
-
Graphml progress report: Structural layer proposal
-
U. Brandes, M. Eiglsperger, I. Herman, M. Himsolt, and M. Marshall, "Graphml Progress Report: Structural Layer Proposal," Proc. Ninth Int'l Symp. Graph Drawing, 2002.
-
(2002)
Proc. Ninth Int'l Symp. Graph Drawing
-
-
Brandes, U.1
Eiglsperger, M.2
Herman, I.3
Himsolt, M.4
Marshall, M.5
-
15
-
-
0041710247
-
Visualization of the high level structure of the internet with Hermes
-
A. Carmignani, G.D. Battista, W. Didimo, F. Matera, and M. Pizzonia, "Visualization of the High Level Structure of the Internet with HERMES," J. Graph Algorithms and Applications, vol. 6, no. 3, pp. 281-311, 2002. (Pubitemid 39064676)
-
(2002)
Journal of Graph Algorithms and Applications
, vol.6
, Issue.3
, pp. 281-311
-
-
Carmignani, A.1
Di Battista, G.2
Didimo, W.3
Matera, F.4
Pizzonia, M.5
-
16
-
-
33749059961
-
Beyond guidelines: What can we learn from the visual information seeking mantra?
-
DOI 10.1109/IV.2005.28, 1509067, Proceedings - Ninth International Conference on Information Visualisation, iV05
-
B. Craft and P. Cairns, "Beyond Guidelines: What Can We Learn from the Visual Information Seeking Mantra?," Proc. IEEE Ninth Int'l Conf. Information Visualization, pp. 110-118, 2005. (Pubitemid 44458502)
-
(2005)
Proceedings of the International Conference on Information Visualisation
, vol.2005
, pp. 110-118
-
-
Craft, B.1
Cairns, P.2
-
17
-
-
84958970362
-
Orthogonal and quasi-upward drawings with vertices of prescribed sizes
-
G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia, "Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Sizes," Proc. Graph Drawing (GD '99), pp. 297-310, 1999.
-
(1999)
Proc. Graph Drawing (GD '99)
, pp. 297-310
-
-
Di Battista, G.1
Didimo, W.2
Patrignani, M.3
Pizzonia, M.4
-
19
-
-
33846630840
-
Graph visualization techniques for web clustering engines
-
DOI 10.1109/TVCG.2007.40
-
E. Di Giacomo, W. Didimo, L. Grilli, and G. Liotta, "Graph Visualization Techniques for Web Clustering Engines," IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 2, pp. 294-304, Mar. 2007. (Pubitemid 46183075)
-
(2007)
IEEE Transactions on Visualization and Computer Graphics
, vol.13
, Issue.2
, pp. 294-304
-
-
Di Giacomo, E.1
Didimo, W.2
Grilli, L.3
Liotta, G.4
-
20
-
-
85137964749
-
Visual analysis of one-to-many matched graphs to be published
-
E. Di Giacomo, W. Didimo, G. Liotta, and P. Palladino, "Visual Analysis of One-to-Many Matched Graphs," to be published in, J. Graph Algorithms Application-Special Issues of GD 2008, 2009.
-
(2009)
J. Graph Algorithms Application-Special Issues of GD,2008
-
-
Di Giacomo, E.1
Didimo, W.2
Liotta, G.3
Palladino, P.4
-
22
-
-
77951688786
-
K-Core Organization of Complex Networks
-
S.N. Dorogovtsev, A.V. Goltsev, and J.F.F. Mendes, "k-Core Organization of Complex Networks," CoRR, abs/cond-mat/0509102, 2005.
-
(2005)
CoRR, abs/cond-mat/0509102
-
-
Dorogovtsev, S.N.1
Goltsev, A.V.2
Mendes, J.F.F.3
-
23
-
-
54949096676
-
Topology preserving constrained graph layout
-
T. Dwyer, K. Marriott, and M. Wybrow, "Topology Preserving Constrained Graph Layout," Proc. Graph Drawing, pp. 230-241, 2008.
-
(2008)
Proc. Graph Drawing
, pp. 230-241
-
-
Dwyer, T.1
Marriott, K.2
Wybrow, M.3
-
24
-
-
0001070640
-
A heuristic for graph drawing
-
P. Eades, "A Heuristic for Graph Drawing," Proc. Congressus Numerantium, vol. 42, pp. 149-160, 1984.
-
(1984)
Proc. Congressus Numerantium
, vol.42
, pp. 149-160
-
-
Eades, P.1
-
25
-
-
84957363650
-
Online Animated Graph Drawing for Web Navigation
-
Graph Drawing
-
P. Eades, R.F. Cohen, and M.L. Huang, "Online Animated Graph Drawing for Web Navigation," Proc. Fifth Int'l Symp. Graph Drawing (GD '97), pp. 330-335, 1997. (Pubitemid 128012920)
-
(1997)
Lecture Notes in Computer Science
, Issue.1353
, pp. 330-335
-
-
Eades, P.1
Cohen, R.F.2
Mao Lin Huang3
-
26
-
-
0006767318
-
Navigating clustered graphs using force-directed methods
-
P. Eades and M.L. Huang, "Navigating Clustered Graphs Using Force-Directed Methods," J. Graph Algorithms and Applications, vol. 4, no. 3, pp. 157-181, 2000. (Pubitemid 39064648)
-
(2000)
Journal of Graph Algorithms and Applications
, vol.4
, Issue.3
, pp. 157-181
-
-
Eades, P.1
Huang, M.L.2
-
27
-
-
24144435951
-
An efficient implementation of sugiyama's algorithm for layered graph drawing
-
M. Eiglsperger, M. Siebenhaller, and M. Kaufmann, "An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing," Proc. Graph Drawing (GD '05), pp. 155-166, 2005.
-
(2005)
Proc. Graph Drawing (GD '05)
, pp. 155-166
-
-
Eiglsperger, M.1
Siebenhaller, M.2
Kaufmann, M.3
-
29
-
-
22944461462
-
Topological fisheye views for visualizing large graphs
-
DOI 10.1109/TVCG.2005.66
-
E.R. Gansner, Y. Koren, and S.C. North, "Topological Fisheye Views for Visualizing Large Graphs," IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 4, pp. 457-468, July/Aug. 2005. (Pubitemid 41049907)
-
(2005)
IEEE Transactions on Visualization and Computer Graphics
, vol.11
, Issue.4
, pp. 457-468
-
-
Gansner, E.R.1
Koren, Y.2
North, S.C.3
-
30
-
-
84993767900
-
On the readability of graphs using node-link and matrix-based representations: A controlled experiment and statistical analysis
-
M. Ghoniem, J.-D. Fekete, and P. Castagliola, "On the Readability of Graphs Using Node-Link and Matrix-Based Representations: A Controlled Experiment and Statistical Analysis," Information Visualization, vol. 4, no. 2, pp. 114-135, 2005.
-
(2005)
Information Visualization
, vol.4
, Issue.2
, pp. 114-135
-
-
Ghoniem, M.1
Fekete, J.-D.2
Castagliola, P.3
-
31
-
-
79955688885
-
K-Core (Bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
-
A.V. Goltsev, S.N. Dorogovtsev, and J.F.F. Mendes, "k-Core (Bootstrap) Percolation on Complex Networks: Critical Phenomena and Nonlocal Effects," CoRR, abs/cond-mat/0602611, 2006.
-
(2006)
CoRR, abs/cond-mat/0602611
-
-
Goltsev, A.V.1
Dorogovtsev, S.N.2
Mendes, J.F.F.3
-
32
-
-
60949105787
-
Large-Graph Layout Algorithms at Work: An Experimental Study
-
S. Hachul and M. Jü nger, "Large-Graph Layout Algorithms at Work: An Experimental Study," J. Graph Algorithms and Applications, vol. 11, no. 2, pp. 345-369, 2007.
-
(2007)
J. Graph Algorithms and Applications
, vol.11
, Issue.2
, pp. 345-369
-
-
Hachul, S.1
Jü Nger, M.2
-
33
-
-
35948954741
-
NodeTrix: A hybrid visualization of social networks
-
DOI 10.1109/TVCG.2007.70582
-
N. Henry, J.-D. Fekete, and M.J. McGuffin, "Nodetrix: A Hybrid Visualization of Social Networks," IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 6, pp. 1302-1309, Nov./Dec. 2007. (Pubitemid 350076603)
-
(2007)
IEEE Transactions on Visualization and Computer Graphics
, vol.13
, Issue.6
, pp. 1302-1309
-
-
Henry, N.1
Fekete, J.-D.2
McGuffin, M.J.3
-
34
-
-
0033872934
-
Graph visualization and navigation in information visualization: A survey
-
DOI 10.1109/2945.841119
-
I. Herman, G. Melançon, and M.S. Marshall, "Graph Visualization and Navigation in Information Visualization: A Survey," IEEE Trans. Visualization and Computer Graphics, vol. 6, no. 1, pp. 24-43, Jan.-Mar. 2000. (Pubitemid 30594718)
-
(2000)
IEEE Transactions on Visualization and Computer Graphics
, vol.6
, Issue.1
, pp. 24-43
-
-
Herman, I.1
Melancon, G.2
Marshall, M.S.3
-
35
-
-
67650542301
-
A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs
-
T. Itoh, C. Muelder, K. Ma, and J. Sese, "A Hybrid Space-Filling and Force-Directed Layout Method for Visualizing Multiple-Category Graphs," Proc. IEEE Pacific Visualization Symp. (PacificVis '09), pp. 121-128, 2009.
-
(2009)
Proc. IEEE Pacific Visualization Symp. (PacificVis '09)
, pp. 121-128
-
-
Itoh, T.1
Muelder, C.2
Ma, K.3
Sese, J.4
-
36
-
-
80052634463
-
-
Drawing Graphs, M. Kaufmann and D. Wagner, eds. Springer Verlag, 2001
-
Drawing Graphs, M. Kaufmann and D. Wagner, eds. Springer Verlag, 2001.
-
-
-
-
37
-
-
0002838419
-
String graphs ii-recognizing string graphs is np-hard
-
J. Kratochvý́l, "String Graphs II-Recognizing String Graphs Is NP-Hard," J. Combinatorial Theory, Series B, vol. 52, no. 1, pp. 67-78, 1991.
-
(1991)
J. Combinatorial Theory, Series B
, vol.52
, Issue.1
, pp. 67-78
-
-
Kratochvý́l, J.1
-
38
-
-
0030096204
-
The hyperbolic browser: A focus + context technique for visualizing large hierarchies
-
DOI 10.1006/jvlc.1996.0003
-
J. Lamping and R. Rao, "The Hyperbolic Browser: A Focus + Context Technique for Visualizing Large Hierarchies," J. Visual Languages and Computing, vol. 7, no. 1, pp. 33-55, 1996. (Pubitemid 126171007)
-
(1996)
Journal of Visual Languages and Computing
, vol.7
, Issue.1
, pp. 33-55
-
-
Lamping, J.1
Rao, R.2
-
39
-
-
0041861270
-
Splitting a graph into disjoint induced paths or cycles
-
H. Le, V. Le, and H. Mü ller, "Splitting a Graph into Disjoint Induced Paths or Cycles," Discrete Applied Math., vol. 131, pp. 199-212, 2003.
-
(2003)
Discrete Applied Math.
, vol.131
, pp. 199-212
-
-
Le, H.1
Le, V.2
Mü Ller, H.3
-
41
-
-
0002794707
-
Planar formulae and their uses
-
D. Lichtenstein, "Planar Formulae and Their Uses," SIAM J. Computing, vol. 11, pp. 185-225, 1982.
-
(1982)
SIAM J. Computing
, vol.11
, pp. 185-225
-
-
Lichtenstein, D.1
-
42
-
-
0011572855
-
Size and connectivity of the k-core of a random graph
-
T. Luczak, "Size and Connectivity of the K-Core of a Random Graph," Discrete Math., vol. 91, no. 1, pp. 61-68, 1991.
-
(1991)
Discrete Math
, vol.91
, Issue.1
, pp. 61-68
-
-
Luczak, T.1
-
44
-
-
44649128965
-
Information visualisation using composable layouts and visual sets
-
T. Pattison, R. Vernik, and M. Phillips, "Information Visualisation Using Composable Layouts and Visual Sets," Proc. Australian Symp. Information Visualisation, pp. 1-10, 2001.
-
(2001)
Proc. Australian Symp. Information Visualisation
, pp. 1-10
-
-
Pattison, T.1
Vernik, R.2
Phillips, M.3
-
45
-
-
84957362320
-
Which aesthetic has the greatest effect on human understanding?
-
H.C. Purchase, "Which Aesthetic Has the Greatest Effect on Human Understanding?," Proc. Graph Drawing (GD '97), pp. 248-261, 1998.
-
(1998)
Proc. Graph Drawing (GD '97)
, pp. 248-261
-
-
Purchase, H.C.1
-
46
-
-
0036723318
-
Empirical evaluation of aesthetics-based graph layout
-
DOI 10.1023/A:1016344215610
-
H.C. Purchase, D.A. Carrington, and J.-A. Allder, "Empirical Evaluation of Aesthetics-Based Graph Layout," Empirical Software Eng., vol. 7, no. 3, pp. 233-255, 2002. (Pubitemid 34950312)
-
(2002)
Empirical Software Engineering
, vol.7
, Issue.3
, pp. 233-255
-
-
Purchase, H.C.1
Carrington, D.2
Allder, J.-A.3
-
47
-
-
0000191191
-
Navigating hierarchically clustered networks through fisheye and full-zoom methods
-
D. Schaffer, Z. Zuo, S. Greenberg, L. Bartram, J. Dill, S. Dubs, and M. Roseman, "Navigating Hierarchically Clustered Networks through Fisheye and Full-Zoom Methods," ACM Trans. Computer-Human Interaction, vol. 3, no. 2, pp. 162-188, 1996.
-
(1996)
ACM Trans. Computer-Human Interaction
, vol.3
, Issue.2
, pp. 162-188
-
-
Schaffer, D.1
Zuo, Z.2
Greenberg, S.3
Bartram, L.4
Dill, J.5
Dubs, S.6
Roseman, M.7
-
49
-
-
0000488788
-
Network structure and minimum degree
-
S.B. Seidman, "Network Structure and Minimum Degree," Social Networks, vol. 5, pp. 269-287, 1983.
-
(1983)
Social Networks
, vol.5
, pp. 269-287
-
-
Seidman, S.B.1
-
50
-
-
67650524724
-
HiMap: Adaptive visualization of large-scale online social networks
-
L. Shi, N. Cao, S. Liu, W. Qian, L. Tan, G Wang, J. Sun, and C. Lin, "HiMap: Adaptive Visualization of Large-Scale Online Social Networks," Proc. IEEE Pacific Visualization Symp. (PacificVis '09), pp. 41-48, 2009.
-
(2009)
Proc. IEEE Pacific Visualization Symp. (PacificVis '09)
, pp. 41-48
-
-
Shi, L.1
Cao, N.2
Liu, S.3
Qian, W.4
Tan, L.5
Wang, G.6
Sun, J.7
Lin, C.8
-
51
-
-
0029725135
-
The eyes have it: A task by data type taxonomy for information visualizations
-
B. Shneiderman, "The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations," Proc. Visual Languages Conf, pp. 336-343, 1996.
-
(1996)
Proc. Visual Languages Conf
, pp. 336-343
-
-
Shneiderman, B.1
-
52
-
-
84875347155
-
Onion graphs: Aesthetics and layout
-
G Sindre, B. Gulla, and H.G Jokstad, "Onion Graphs: Aesthetics and Layout," Proc. IEEE Symp. Visual Languages, pp. 287-291,1993.
-
(1993)
Proc. IEEE Symp. Visual Languages
, pp. 287-291
-
-
Sindre, G.1
Gulla, B.2
Jokstad, H.G.3
-
53
-
-
0023366861
-
On embedding a graph in 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. Computing, vol. 16, no. 3, pp. 421-444, 1987. (Pubitemid 17583644)
-
(1987)
SIAM Journal on Computing
, vol.16
, Issue.3
, pp. 421-444
-
-
Tamassia Roberto1
-
55
-
-
13844310836
-
Peeling the yeast protein network
-
DOI 10.1002/pmic.200400962
-
S. Wuchty and E. Almaas, "Peeling the Yeast Protein Network," Proteomics, vol. 5, no. 2, pp. 444-449, 2005. (Pubitemid 40262062)
-
(2005)
Proteomics
, vol.5
, Issue.2
, pp. 444-449
-
-
Wuchty, S.1
Almaas, E.2
-
56
-
-
33749409413
-
Elastic hierarchies: Combining Treemaps and node-link diagrams
-
DOI 10.1109/INFVIS.2005.1532129, 1532129, IEEE Symposium on Information Visualization, InfoVis 05, Proceedings
-
S. Zhao, M.J. McGuffin, and M.H. Chignell, "Elastic Hierarchies: Combining Treemaps and Node-Link Diagrams," Proc. IEEE Symp. Information Visualization (INFOVIS '05), pp. 57-64, 2005. (Pubitemid 44500038)
-
(2005)
Proceedings - IEEE Symposium on Information Visualization, INFO VIS
, pp. 57-64
-
-
Zhao, S.1
McGuffin, M.J.2
Chignell, M.H.3
|