[b0]
via grobid
|
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
D Archambault, H Purchase, B Pinaud
2011
IEEE Transactions on Visualization and Computer Graphics
doi:10.1109/tvcg.2010.78
pmid:20498503
|
web.archive.org [PDF]
|
[b1]
via grobid
|
D. Auber and Y. Chiricota. Improved efficiency of spring embedders: Taking advantage of GPU programming. In The Seventh IASTED International Confer- ence on Visualization, Imaging and Image Processing, VIIP '07, pages 169-175. ACTA Press, 2007.
|
|
[b2]
via grobid
|
GraphDiaries: Animated Transitions andTemporal Navigation for Dynamic Networks
Benjamin Bach, Emmanuel Pietriga, Jean-Daniel Fekete
2014
IEEE Transactions on Visualization and Computer Graphics
doi:10.1109/tvcg.2013.254
pmid:26357296
|
web.archive.org [PDF]
|
[b3]
via grobid
|
The State of the Art in Visualizing Dynamic Graphs
[article]
Fabian Beck, Michael Burch, Stephan Diehl, Daniel Weiskopf
2014
Eurographics Conference on Visualization
doi:10.2312/eurovisstar.20141174
dblp:conf/vissym/0001B0W14
|
|
[b4]
via fuzzy
|
The Aesthetics of Graph Visualization
[article]
Chris Bennett, Jody Ryall, Leo Spalteholz, Amy Gooch
2007
Computational Aesthetics in Graphics
doi:10.2312/compaesth/compaesth07/057-064
|
web.archive.org [PDF]
|
[b5]
via grobid
|
Visualizing Internet Evolution on the Autonomous Systems Level
[chapter]
Krists Boitmanis, Ulrik Brandes, Christian Pich
International Symposium Graph Drawing and Network Visualization
doi:10.1007/978-3-540-77537-9_36
dblp:conf/gd/BoitmanisBP07
|
web.archive.org [PDF]
|
[b6]
via grobid
|
Dynamic Spectral Layout with an Application to Small Worlds
Ulrik Brandes, Daniel Fleischer, Thomas Puppe
2007
Journal of Graph Algorithms and Applications
doi:10.7155/jgaa.00149
|
web.archive.org [PDF]
|
[b7]
via grobid
|
A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
[chapter]
Ulrik Brandes, Martin Mader
2012
Lecture Notes in Computer Science
doi:10.1007/978-3-642-25878-7_11
|
web.archive.org [PDF]
|
[b8]
via grobid
|
A bayesian paradigm for dynamic graph layout
[chapter]
Ulrik Brandes, Dorothea Wagner
1997
Lecture Notes in Computer Science
doi:10.1007/3-540-63938-1_66
|
web.archive.org [PDF]
|
[b9]
via grobid
|
Parallel Edge Splatting for Scalable Dynamic Graph Visualization
M. Burch, C. Vehlow, F. Beck, S. Diehl, D. Weiskopf
2011
IEEE Transactions on Visualization and Computer Graphics
doi:10.1109/tvcg.2011.226
pmid:22034355
|
web.archive.org [PDF]
|
[b10]
via grobid
|
C. S. Collberg, S. G. 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, ACM 2003 Symposium on Software Visual- ization, pages 77-86, 212-213. ACM, 2003.
|
|
[b11]
via grobid
|
An Incremental Layout Method for Visualizing Online Dynamic Graphs
[chapter]
Tarik Crnovrsanin, Jacqueline Chu, Kwan-Liu Ma
2015
Lecture Notes in Computer Science
doi:10.1007/978-3-319-27261-0_2
|
web.archive.org [PDF]
|
[b12]
via grobid
|
Graphs, They Are Changing
[chapter]
Stephan Diehl, Carsten Görg
2002
Lecture Notes in Computer Science
doi:10.1007/3-540-36151-0_3
|
web.archive.org [PDF]
|
[b13]
via grobid
|
C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. V. Yee. GraphAEL: Graph animations with evolving layouts. In G. Liotta, editor, 11th International Symposium on Graph Drawing, GD 2003, volume 2912 of LNCS, pages 98-110.
|
|
[b14]
via grobid
|
GraphAEL: Graph Animations with Evolving Layouts
[chapter]
Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary Yee
2004
Lecture Notes in Computer Science
doi:10.1007/978-3-540-24595-7_9
|
web.archive.org [PDF]
|
[b15]
via grobid
|
Dynamic Drawing of Clustered Graphs
Y. Frishman, Ayellet Tal
IEEE Information Visualization Conference
doi:10.1109/infvis.2004.18
dblp:conf/infovis/FrishmanT04
|
web.archive.org [PDF]
|
[b16]
via grobid
|
Multi-Level Graph Layout on the GPU
Yaniv Frishman, Ayellet Tal
2007
IEEE Transactions on Visualization and Computer Graphics
doi:10.1109/tvcg.2007.70580
pmid:17968079
|
web.archive.org [PDF]
|
[b17]
via grobid
|
Online Dynamic Graph Drawing
Y. Frishman, A. Tal
2008
IEEE Transactions on Visualization and Computer Graphics
doi:10.1109/tvcg.2008.11
pmid:18467750
|
web.archive.org [PDF]
|
[b18]
via grobid
|
A multi-dimensional approach to force-directed layouts of large graphs
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
2004
Computational geometry
doi:10.1016/j.comgeo.2004.03.014
|
web.archive.org [PDF]
|
[b19]
via grobid
|
A. Godiyal, J. Hoberock, M. Garland, and J. C. Hart. Rapid multipole graph drawing on the GPU. In I. G. Tollis and M. Patrignani, editors, 16th International Symposium on Graph Drawing, GD 2008, volume 5417 of LNCS, pages 90-101.
|
|
[b20]
via grobid
|
Rapid Multipole Graph Drawing on the GPU
[chapter]
Apeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart
2009
Lecture Notes in Computer Science
doi:10.1007/978-3-642-00219-9_10
|
web.archive.org [PDF]
|
[b21]
via grobid
|
C. Görg, P. Birke, M. Pohl, and S. Diehl. Dynamic graph drawing of sequences of orthogonal and hierarchical graphs. In J. Pach, editor, 12th International Sym- posium on Graph Drawing, GD 2004, volume 3383 of LNCS, pages 228-238.
|
|
[b22]
via grobid
|
Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
[chapter]
Carsten Görg, Peter Birke, Mathias Pohl, Stephan Diehl
2005
Lecture Notes in Computer Science
doi:10.1007/978-3-540-31843-9_24
|
web.archive.org [PDF]
|
[b23]
via grobid
|
Using Aging to Visually Uncover Evolutionary Processes on Networks
T. E. Gorochowski, M. di Bernardo, C. S. Grierson
2012
IEEE Transactions on Visualization and Computer Graphics
doi:10.1109/tvcg.2011.142
pmid:21860063
|
|
[b24]
via grobid
|
Visualizing the Evolution of Compound Digraphs with TimeArcTrees
Martin Greilich, Michael Burch, Stephan Diehl
2009
Computer graphics forum (Print)
doi:10.1111/j.1467-8659.2009.01451.x
|
web.archive.org [PDF]
|
[b25]
via grobid
|
Fast multipole methods on graphics processors
Nail A. Gumerov, Ramani Duraiswami
2008
Journal of Computational Physics
doi:10.1016/j.jcp.2008.05.023
|
web.archive.org [PDF]
|
[b26]
via grobid
|
Large-Graph Layout Algorithms at Work: An Experimental Study
Stefan Hachul, Michael Jünger
2007
Journal of Graph Algorithms and Applications
doi:10.7155/jgaa.00150
|
web.archive.org [PDF]
|
[b27]
via grobid
|
A Fast Multi-Scale Method for Drawing Large Graphs
David Harel, Yehuda Koren
2002
Journal of Graph Algorithms and Applications
doi:10.7155/jgaa.00051
|
web.archive.org [PDF]
|
[b28]
via grobid
|
Graph Drawing by High-Dimensional Embedding
David Harel, Yehuda Koren
2004
Journal of Graph Algorithms and Applications
doi:10.7155/jgaa.00089
|
web.archive.org [PDF]
|
[b29]
via grobid
|
Initial Positioning Method for Online and Real-Time Dynamic Graph Drawing of Time Varying Data
Aki Hayashi, Tatsushi Matsubayashi, Takahide Hoshide, Tadasu Uchiyama
2013
International Conference on Information Visualisation
doi:10.1109/iv.2013.57
dblp:conf/iv/HayashiMHU13
|
|