text:
@article{Abello2013Modular,
  abstract = {Large dynamic networks are targets of analysis in many fields. Tracking temporal changes at scale in these networks is challenging due in part to the fact that small changes can be missed or drowned-out by the rest of the network. For static networks, current approaches allow the identification of specific network elements within their context. However, in the case of dynamic networks, the user is left alone with finding salient local network elements and tracking them over time. In this work, we introduce a modular DoI specification to flexibly define what salient changes are and to assign them a measure of their importance in a time-varying setting. The specification takes into account neighborhood structure information, numerical attributes of nodes/edges, and their temporal evolution. A tailored visualization of the DoI specification complements our approach. Alongside a traditional node-link view of the dynamic network, it serves as an interface for the interactive definition of a DoI function. By using it to successively refine and investigate the captured details, it supports the analysis of dynamic networks from an initial view until pinpointing a user's analysis goal. We report on applying our approach to scientific co-authorship networks and give concrete results for the DBLP dataset.},
  address = {Los Alamitos, CA, USA},
  author = {Abello, James and Hadlak, Steffen and Schumann, Heidrun and Schulz, Hans-J\"org},
  doi = {10.1109/TVCG.2013.109},
  issn = {1077-2626},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:node-link, time:animation, evaluation:case\_study, application:document, force-directed\_layout, network\_metrics, online_problem, special-purpose_layout, compound_graph},
  number = {3},
  pages = {337--350},
  publisher = {IEEE Computer Society},
  series = {TVCG},
  title = {A Modular Degree-of-Interest Specification for the Visual Analysis of Large Dynamic Networks},
  volume = {20},
  year = {2013}
}

@inproceedings{Ahlers2014Replicable,
  author = {Ahlers, Volker and Heine, Felix and Hellmann, Bastian and Kleiner, Carsten and Renners, Leonard and Rossow, Thomas and Steuerwald, Ralf},
  booktitle = {Joint Proceedings of the Fourth International Workshop on Euler Diagrams and the First International Workshop on Graph Visualization in Practice},
  keywords = {type:application, application:infrastructure, paradigm:node-link, time:animation, graph_difference, evaluation:none},
  pages = {32--41},
  publisher = {CEUR-WS.org},
  series = {GraphViP},
  title = {Replicable Security Monitoring: Visualizing Time-Variant Graphs of Network Metadata},
  url = {http://ceur-ws.org/Vol-1244/GViP-paper1.pdf},
  year = {2014}
}

@incollection{Ahmed2010Visual,
  abstract = {In this paper, we present new visual analysis methods for history of the FIFA World Cup competition data, a social network from Graph Drawing 2006 Competition. Our methods are based on the use of network analysis method, and new visualization methods for dynamic graphs with dynamic hierarchy and geographic clustering. More specifically, we derive a dynamic network with geographic clustering from the history of the FIFA World Cup competition data, based on who-beats-whom relationship. Combined with the centrality analysis (which defines dynamic hierarchy) and the use of the union of graphs (which determines the overall layout topology), we present three new visualization methods for dynamic graphs with dynamic hierarchy and geographic clustering: wheel layout, radial layout and hierarchical layout. Our experimental results show that our visual analysis methods can clearly reveal the overall winner of the World Cup competition history as well as the strong and weak countries. Furthermore, one can analyze and compare the performance of each country for each year along the context with their overall performance. This enables us to confirm the expected and discover the unexpected.},
  author = {Ahmed, Adel and Fu, Xiaoyan and Hong, Seok-Hee and Nguyen, Quan Hoang and Xu, Kai},
  booktitle = {Visual Information Communication},
  doi = {10.1007/978-1-4419-0312-9_2},
  keywords = {type:application, time:timeline, paradigm:node-link, compound_graph, evaluation:case_study, application:sports, 3d, clustering, superimposed_node-link, radial},
  pages = {25--39},
  publisher = {Springer},
  series = {VINCI},
  title = {Visual analysis of history of {World Cup}: A dynamic network with dynamic hierarchy and geographic clustering},
  year = {2010}
}

@incollection{Ahn2011Temporal,
  abstract = {Information visualization is a powerful tool for analyzing the dynamic nature of social communities. Using Nation of Neighbors community network as a testbed, we propose five principles of implementing temporal visualizations for social networks and present two research prototypes: NodeXL and TempoVis. Three different states are defined in order to visualize the temporal changes of social networks. We designed the prototypes to show the benefits of the proposed ideas by letting users interactively explore temporal changes of social networks.},
  author = {Ahn, Jae-wook and Taieb-Maimon, Meirav and Sopan, Awalin and Plaisant, Catherine and Shneiderman, Ben},
  booktitle = {Social Computing, Behavioral-Cultural Modeling and Prediction},
  doi = {10.1007/978-3-642-19656-0_43},
  keywords = {paradigm:node-link, application:social, type:application, time:animation, time:timeline, evaluation:expert, directed_graph},
  pages = {309--316},
  publisher = {Springer},
  series = {SBP},
  title = {Temporal Visualization of Social Network Dynamics: Prototypes for Nation of Neighbors},
  year = {2011}
}

@article{Ahn2013Task,
  abstract = {Visualization has proven to be a useful tool for understanding network structures. Yet the dynamic nature of social media networks requires powerful visualization techniques that go beyond static network diagrams. In order to provide strong temporal network visualization tools, designers need to understand what tasks the users have to accomplish. This paper describes a taxonomy of temporal network visualization tasks. We identify the (1) entities, (2) properties, and (3) temporal features, which were extracted by surveying 53 existing temporal network visualization systems. By building and examining the task taxonomy, we report which tasks are well covered by existing systems and make suggestions for designing future visualization tools. The feedback from 12 network analysts helped refine the taxonomy.},
  author = {Ahn, Jae-wook and Plaisant, Catherine and Shneiderman, Ben},
  doi = {10.1109/TVCG.2013.238},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:evaluation, taxonomy, tasks, evaluation:expert, time:generic, evaluation_framework, paradigm:generic, application:generic},
  number = {3},
  pages = {365--376},
  series = {TVCG},
  title = {A Task Taxonomy for Network Evolution Analysis},
  volume = {20},
  year = {2013}
}

@inproceedings{Alencar2012TimeAware,
  abstract = {Scientific articles are the major mechanism for researchers to report their results, and a collection of papers on a discipline can reveal a lot about its evolution, such as the emergence of new topics. Nonetheless, given a broad collection of papers it is typically very difficult to grasp important information that could help readers to globally interpret, navigate and then focus on the relevant items for their task. Content-based document maps are visual representations created from evaluating the (dis)similarity amongst the documents, and have been shown to support exploratory tasks in this scenario. Documents are represented by visual markers placed in the 2D space so that documents close share similar content. Albeit the maps allow visually identifying groups of related documents and frontiers between groups, they do not explicitly convey the temporal evolution of a collection. We propose a technique for creating content-based similarity maps of document collections that highlight temporal changes along time. Our solution constructs a sequence of maps from time-stamped sub-sets of the data. It adopts a cumulative backwards strategy to preserve user context across successive time-stamps, i.e., maps do not change drastically from one time stamp to the next, favouring user perception of changes.},
  author = {Alencar, Aretha B and B\"orner, Katy and Paulovich, Fernando V and de Oliveira, Maria Cristina F},
  booktitle = {Proceedings of the 27th Annual ACM Symposium on Applied Computing},
  doi = {10.1145/2245276.2245469},
  keywords = {paradigm:node-link, application:document, type:application, time:animation, evaluation:case_study},
  pages = {997--1004},
  publisher = {ACM},
  series = {SAC},
  title = {Time-Aware Visualization of Document Collections},
  year = {2012}
}

@article{Archambault2011Animation,
  abstract = {In this paper, we present the results of a human-computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small multiples and the effect that mental map preservation had on the two conditions. Questions used in the experiment were selected to test both local and global properties of graph evolution over time. The data sets used in this experiment were derived from standard benchmark data sets of the information visualization community. We found that small multiples gave significantly faster performance than animation overall and for each of our five graph comprehension tasks. In addition, small multiples had significantly more errors than animation for the tasks of determining sets of nodes or edges added to the graph during the same timeslice, although a positive time-error correlation coefficient suggests that, in this case, faster responses did not lead to more errors. This result suggests that, for these two tasks, animation is preferable if accuracy is more important than speed. Preserving the mental map under either the animation or the small multiples condition had little influence in terms of error rate and response time.},
  author = {Archambault, Daniel and Purchase, Helen C and Pinaud, Bruno},
  doi = {10.1109/tvcg.2010.78},
  issn = {1077-2626},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {mental\_map, type:evaluation, paradigm:node-link, time:animation, time:timeline, application:generic, evaluation:user\_study},
  number = {4},
  pages = {539--552},
  publisher = {IEEE},
  series = {TVCG},
  title = {Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs},
  volume = {17},
  year = {2011}
}

@incollection{Archambault2011Difference,
  abstract = {Difference maps are one way to show changes between timeslices in a dynamic graph. They highlight, using colour, the nodes and edges that were added, removed, or persisted between every pair of adjacent timeslices. Although some work has used difference maps for visualization, no user study has been performed to gauge their performance. In this paper, we present a user study to evaluate the effectiveness of difference maps in comparison with presenting the evolution of the dynamic graph over time on three interfaces. We found evidence that difference maps produced significantly fewer errors when determining the number of edges inserted or removed from a graph as it evolves over time. Also, difference maps were significantly preferred on all tasks.},
  author = {Archambault, Daniel and Purchase, Helen C and Pinaud, Bruno},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-642-18469-7\_5},
  isbn = {978-3-642-18468-0},
  keywords = {paradigm:node-link, type:evaluation, application:social, time:timeline, time:animation, evaluation:user\_study, graph\_difference},
  pages = {50--61},
  publisher = {Springer},
  series = {GD},
  title = {Difference Map Readability for Dynamic Graphs},
  year = {2011}
}

@inproceedings{Archambault2012Mental,
  abstract = {In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not change significantly as the information evolves over time is considered an important property by algorithm designers. Many prior experiments have attempted to verify this principle, with surprisingly little success. These experiments have used several different algorithmic methods, a variety of graph interpretation questions on both real and fabricated data, and different presentation methods. However, none of the results have conclusively demonstrated the importance of mental map preservation on task performance. Our experiment measures the efficacy of the dynamic graph drawing in a different manner: we look at how memorable the evolving graph is, rather than how easy it is to interpret. As observed in the previous studies, we found no significant difference in terms of response time or error rate when preserving the mental map. While preserving the mental map is a good idea in principle, we find that it may not always support performance. However, our qualitative data suggests that, in terms of the user's perception, preserving the mental map makes memorability tasks easier. Our qualitative data also suggests that there may be two features of the dynamic graph drawing that may assist in their memorability: interesting subgraphs that remain visible over time and interesting patterns in node movement. The former is supported by preserving the mental map while the latter is not.},
  author = {Archambault, Daniel and Purchase, Helen C},
  booktitle = {Proceeding of the IEEE Pacific Visualization Symposium},
  doi = {10.1109/PacificVis.2012.6183578},
  keywords = {mental\_map, paradigm:node-link, type:evaluation, time:animation, application:social, evaluation:user_study},
  pages = {89--96},
  publisher = {IEEE},
  series = {PacificVis},
  title = {The Mental Map and Memorability in Dynamic Graphs},
  year = {2012}
}

@article{Archambault2013Map,
  abstract = {Abstract Preserving the mental map is frequently cited by dynamic graph drawing algorithm designers as an important optimization criterion. There have been a number of definitions for mental map preservation and many different algorithmic approaches to drive dynamic graph drawing to satisfy these definitions. One of the most frequently used definitions is that of Coleman and Parker where “the placement of existing nodes and edges should change as little as possible when a change is made to the graph.” A number of experiments have been run to test the effectiveness of this definition from a usability perspective. To date, no experiment has found conclusive evidence that supports the effectiveness of the mental map in the comprehension of a dynamic graph series. In this paper, we summarize the experiments conducted on this definition of mental map preservation and provide recommendations to designers and researchers to fully understand when the mental map supports user tasks.},
  author = {Archambault, Daniel and Purchase, Helen C},
  doi = {10.1016/j.ijhcs.2013.08.004},
  journal = {International Journal of Human-Computer Studies},
  keywords = {type:evaluation, paradigm:node-link, time:animation, evaluation:survey, application:generic, mental_map, aesthetic_criteria},
  number = {11},
  pages = {1044 - 1055},
  title = {The ``{Map}" in the mental map: Experimental results in dynamic graph drawing},
  volume = {71},
  year = {2013}
}

@inproceedings{Archambault2013Mental,
  abstract = {We present the results of a formal experiment that tests the ability of a participant to orient themselves in a dynamically evolving graph. Examples of these tasks include finding a specific location or route between two locations. We find that preserving the mental map for the tasks tested is significantly faster and produces fewer errors. As the number of targets increase, this result holds.},
  author = {Archambault, Daniel and Purchase, Helen C},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-642-36763-2_42},
  keywords = {type:evaluation, paradigm:node-link, time:animation, mental_map, evaluation:user_study, application:generic, time:timeline},
  organization = {Springer},
  pages = {475--486},
  series = {GD},
  title = {Mental map preservation helps user orientation in dynamic graphs},
  year = {2013}
}

@inproceedings{Archambault2014Application,
  author = {Archambault, Daniel and Purchase, Helen C},
  booktitle = {Joint Proceedings of the Fourth International Workshop on Euler Diagrams and the First International Workshop on Graph Visualization in Practice},
  keywords = {evaluation:survey, type:evaluation, time:animation, time:timeline, paradigm:node-link, application:generic, mental_map, juxtaposed_node-link},
  pages = {73--77},
  publisher = {CEUR-WS.org},
  series = {GraphViP},
  title = {On the Application of Experimental Results in Dynamic Graph Drawing},
  url = {http://ceur-ws.org/Vol-1244/GViP-paper5.pdf},
  year = {2014}
}

@incollection{Archambault2014Temporal,
  abstract = {Networks that evolve over time, or dynamic graphs, have been of interest to the areas of information visualization and graph drawing for many years. Typically, its the structure of the dynamic graph that evolves as vertices and edges are added or removed from the graph. In a multivariate scenario, however, attributes play an important role and can also evolve over time. In this chapter, we characterize and survey methods for visualizing temporal multivariate networks. We also explore future applications and directions for this emerging area in the fields of information visualization and graph drawing.},
  author = {Archambault, Daniel and Abello, James and Kennedy, Jessie and Kobourov, Stephen G and Ma, Kwan-Liu and Miksch, Silvia and Muelder, Chris and Telea, Alexandru},
  booktitle = {Multivariate Network Visualization},
  chapter = {8},
  doi = {10.1007/978-3-319-06793-3_8},
  keywords = {type:evaluation, time:generic, paradigm:node-link, evaluation:survey, application:software_engineering, mental_map, application:generic, multivariate_graph, taxonomy},
  pages = {151--175},
  publisher = {Springer},
  title = {Temporal Multivariate Networks},
  year = {2014}
}

@article{Bach2014GraphDiaries,
  abstract = {Identifying, tracking and understanding changes in dynamic networks are complex and cognitively demanding tasks. We present GraphDiaries, a visual interface designed to improve support for these tasks in any node-link based graph visualization system. GraphDiaries relies on animated transitions that highlight changes in the network between time steps, thus helping users identify and understand those changes. To better understand the tasks related to the exploration of dynamic networks, we first introduce a task taxonomy, that informs the design of GraphDiaries, presented afterwards. We then report on a user study, based on representative tasks identified through the taxonomy, and that compares GraphDiaries to existing techniques for temporal navigation in dynamic networks, showing that it outperforms them in terms of both task time and errors for several of these tasks.},
  author = {Bach, Benjamin and Pietriga, Emmanuel and Fekete, Jean-Daniel},
  doi = {10.1109/TVCG.2013.254},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, time:animation, paradigm:node-link, evaluation:user_study, application:generic, taxonomy, tasks, offline_problem, transition_problem, general-purpose_layout},
  number = {5},
  pages = {740--754},
  publisher = {IEEE},
  series = {TVCG},
  title = {{GraphDiaries}: Animated Transitions and Temporal Navigation for Dynamic Networks},
  volume = {20},
  year = {2014}
}

@inproceedings{Bach2014Review,
  abstract = {We review a range of temporal data visualization techniques through a new lens, by describing them as series of operations performed on a conceptual space-time cube. These operations include extracting subparts of a space-time cube, flattening it across space or time, or transforming the cube's geometry or content. We introduce a taxonomy of elementary space-time cube operations, and explain how they can be combined to turn a three-dimensional space-time cube into an easily-readable two-dimensional visualization. Our model captures most visualizations showing two or more data dimensions in addition to time, such as geotemporal visualizations, dynamic networks, time-evolving scatterplots, or videos. We finally review interactive systems that support a range of operations. By introducing this conceptual framework we hope to facilitate the description, criticism and comparison of existing temporal data visualizations, as well as encourage the exploration of new techniques and systems.},
  author = {Bach, Benjamin and Dragicevic, Pierre and Archambault, Daniel and Hurter, Christophe and Carpendale, Sheelagh},
  booktitle = {EuroVis-STARs},
  doi = {10.2312/eurovisstar.20141171},
  keywords = {type:evaluation, evaluation:survey, time:generic, paradigm:generic, application:generic},
  pages = {23--41},
  publisher = {The Eurographics Association},
  series = {EuroVis},
  title = {A Review of Temporal Data Visualizations Based on Space-Time Cube Operations},
  year = {2014}
}

@inproceedings{Bach2014Visualizing,
  abstract = {Designing visualizations of dynamic networks is challenging, both because the data sets tend to be complex and because the tasks associated with them are often cognitively demanding. We introduce the Matrix Cube, a novel visual representation and navigation model for dynamic networks, inspired by the way people comprehend and manipulate physical cubes. Users can change their perspective on the data by rotating or decomposing the 3D cube. These manipulations can produce a range of different 2D visualizations that emphasize specific aspects of the dynamic network suited to particular analysis tasks. We describe Matrix Cubes and the interactions that can be performed on them in the Cubix system. We then show how two domain experts, an astronomer and a neurologist, used Cubix to explore and report on their own network data.},
  author = {Bach, Benjamin and Pietriga, Emmanuel and Fekete, Jean-Daniel},
  booktitle = {Procceedings of the SICCHI Conference on Human Factors in Computing Systems},
  doi = {10.1145/2556288.2557010},
  keywords = {type:technique, time:timeline, paradigm:matrix, evaluation:case_study, evaluation:expert, application:infrastructure, application:biology, 3d, layered_matrices, weighted_graph},
  series = {CHI},
  title = {Visualizing Dynamic Networks with Matrix Cubes},
  year = {2014}
}

@inproceedings{Bastian2009Gephi,
  abstract = {Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real-time and to speed up the exploration. A flexible and multi-task architecture brings new possibilities to work with complex data sets and produce valuable visual results. We present several key features of Gephi in the context of interactive exploration and interpretation of networks. It provides easy and broad access to network data and allows for spatializing, filtering, navigating, manipulating and clustering. Finally, by presenting dynamic features of Gephi, we highlight key aspects of dynamic network visualization.},
  author = {Bastian, Mathieu and Heymann, Sebastien and Jacomy, Mathieu},
  booktitle = {International AAAI Conference on Weblogs and Social Media},
  keywords = {type:application, time:animation, paradigm:node-link, evaluation:none, application:generic, online_problem, clustering, network_metrics},
  pages = {361--362},
  publisher = {The AAAI Press},
  series = {ICWSM},
  title = {Gephi: an open source software for exploring and manipulating networks},
  url = {http://aaai.org/ocs/index.php/ICWSM/09/paper/view/154},
  year = {2009}
}

@techreport{Baur2008Dynamic,
  abstract = {In early 2008 a new testing branch of the network analysis software visone has been made publicly available [Baur et al., 2008]. This realease includes the ability to process dynamic networks. A central feature is a dedicated dynamic layout algorithm which we present here from a methological and application oriented point of view. We first describe this algorithm from an algorithmic perspective. More precisely we show how the local majorant method of the related layout algorithm given by Kamada and Kawai can be adapted to layout dynamic networks. Following the methodological part we also address some problems and some other features of our implementation. Given the information in this document users of the dynamic layout procedure in visone should be able to employ the various available options efficiently to get the desired results.},
  author = {Baur, Michael and Schank, Thomas},
  institution = {Fakult\"at f\"ur Informatik, Universit\"at Karlsruhe},
  issn = {1432-7864},
  keywords = {type:technique, paradigm:node-link, time:animation, evaluation:none, offline_problem, application:generic, general-purpose_layout},
  title = {Dynamic Graph Drawing in {Visone}},
  url = {http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007990},
  year = {2008}
}

@inproceedings{Beck2009Aesthetic,
  abstract = {Most research on the readability of graph visualization focuses on node-link diagrams of static graphs. But in many applications graphs are not static, but change over time, or graphs are too dense to be drawn as node-link diagrams. In this paper we look at dynamic graph visualizations: We translate the general goal of graph visualization-to convey the underlying information of a graph-into aesthetic dimensions that are applicable in practice. These aesthetic dimensions help to design, compare, and evaluate dynamic graph visualizations.},
  author = {Beck, Fabian and Burch, Michael and Diehl, Stephan},
  booktitle = {Proceedings of the 13th International Conference on Information Visualisation},
  doi = {10.1109/IV.2009.42},
  keywords = {paradigm:generic, time:generic, type:evaluation, aesthetic_criteria, mental_map, evaluation:case\_study, evaluation_framework, application:document},
  pages = {592--597},
  publisher = {IEEE},
  series = {IV},
  title = {Towards an Aesthetic Dimensions Framework for Dynamic Graph Visualisations},
  year = {2009}
}

@inproceedings{Beck2012Rapid,
  abstract = {Rapid Serial Visual Presentation is an effective approach for browsing and searching large amounts of data. By presenting subsequent images at high frequency, we utilize the perceptual abilities of the human visual system to rapidly process certain visual features. While this concept is successfully used in video and image browsing, we demonstrate how it can be applied to dynamic graph visualization. In this paper, we introduce a visualization technique for time-varying graphs that is scalable with respect to the number of time steps. The graph visualization is based on the Parallel Edge Splatting technique, which employs a space-efficient display of a sequence of dynamically changing graphs. To illustrate the usefulness of our approach we analyzed method call graphs recorded during the execution of the open source software system JHotDraw. Furthermore, we studied a time-varying social network representing researchers and their dynamic communication structure while attending the ACM Hypertext 2009 conference.},
  author = {Beck, Fabian and Burch, Michael and Vehlow, Corinna and Diehl, Stephan and Weiskopf, Daniel},
  booktitle = {Proceedings of the 2012 IEEE Symposium on Visual Languages and Human-Centric Computing},
  doi = {10.1109/vlhcc.2012.6344514},
  keywords = {paradigm:node-link, mental\_map, application:social, application:software\_engineering, type:technique, compound_graph, directed_graph, weighted_graph, bipartite, evaluation:case\_study, time:timeline, time:animation, animated_timeline, time_aggregation},
  pages = {185--192},
  publisher = {IEEE},
  series = {VL/HCC},
  survey:data = {(n:982, e:32259, t:1077), (n:982, e:1757, t:1757), (n:113, e:20818, t:236)},
  title = {Rapid Serial Visual Presentation in Dynamic Graph Visualization},
  year = {2012}
}

@inproceedings{Beck2013Matching,
  abstract = {Mapping a dynamic graph dataset to an inappropriate visualization leads to a degradation of visualization performance at some task. To tap the full potential of existing dynamic graph visualization techniques, we propose a methodology for matching application requirements with dynamic graph visualization profiles. We target at supporting experts choosing the right visualization technique. Our methodology describes both the application requirements and the visualization techniques as profiles covering important aesthetic criteria for visualizing dynamic graphs. Characteristics of the graph and task are used to derive the application profile. The probably most appropriate visualization technique is the one whose profile matches best the required application profile. We compile exemplary visualization profiles for representatives of dynamic graph visualization approaches and demonstrate the methodology in a case study.},
  author = {Beck, Fabian and Burch, Michael and Diehl, Stephan},
  booktitle = {Proceedings of the 17th International Conference on Information Visualisation},
  doi = {10.1109/IV.2013.2},
  keywords = {type:evaluation, paradigm:generic, evaluation:case\_study, application:document, aesthetic_criteria, mental\_map, taxonomy, time:generic, evaluation_framework, tasks},
  pages = {11--18},
  publisher = {IEEE},
  series = {IV},
  title = {Matching Application Requirements with Dynamic Graph Visualization Profiles},
  year = {2013}
}

@inproceedings{Beck2014State,
  abstract = {Dynamic graph visualization focuses on the challenge of representing the evolution of relationships between entities in readable, scalable, and effective diagrams. This work surveys the growing number of approaches in this discipline. We derive a hierarchical taxonomy of techniques by systematically categorizing and tagging publications. While static graph visualizations are often divided into node-link and matrix representations, we identify the representation of time as the major distinguishing feature for dynamic graph visualizations: either graphs are represented as animated diagrams or as static charts based on a timeline. Evaluations of animated approaches focus on dynamic stability for preserving the viewer's mental map or, in general, compare animated diagrams to timeline-based ones. Finally, we identify and discuss challenges for future research.},
  author = {Beck, Fabian and Burch, Michael and Diehl, Stephan and Weiskopf, Daniel},
  booktitle = {EuroVis - STARs},
  doi = {10.2312/eurovisstar.20141174},
  keywords = {type:evaluation, time:generic, paradigm:generic, evaluation:survey, application:generic},
  pages = {83-103},
  publisher = {Eurographics Association},
  series = {EuroVis},
  title = {The State of the Art in Visualizing Dynamic Graphs},
  url = {http://www.visus.uni-stuttgart.de/uploads/tx_vispublications/eurovis14-star.pdf},
  year = {2014}
}

@article{Bender-deMoll2006Science,
  abstract = {If graph drawing is to become a methodological tool instead of an illustrative art, many concerns need to be overcome. We discuss the problems of social network visualization, and particularly, problems of dynamic network visualization. We consider issues that arise from the aggregation of continuous-time relational data ("streaming" interactions) into a series of networks. We discuss our experience developing SoNIA (Social Network Image Animator, http://sonia.stanford.edu) as a prototype platform for testing and comparing layouts and techniques, and as a tool for browsing attribute-rich network data and for animating network dynamics over time. We discuss strengths and weakness of existing layout algorithms and suggest ways to adapt them to sequential layout tasks. As such, we propose a framework for visualizing social networks and their dynamics, and we present a tool that enables debate and reflection on the quality of visualizations used in empirical research.},
  author = {Bender-deMoll, Skye and McFarland, Daniel A},
  journal = {Journal of Social Structure},
  keywords = {application:social, type:application, time:animation, paradigm:node-link, evaluation:case_study, mental_map, radial},
  number = {2},
  pages = {1--38},
  title = {The Art and Science of Dynamic Network Visualization},
  url = {http://www.cmu.edu/joss/content/articles/volume7/deMollMcFarland/},
  volume = {7},
  year = {2006}
}

@inproceedings{Beyer2006Animated,
  abstract = {The understanding of the structure of a software system can be improved by analyzing the system's evolution during development. Visualizations of software history that provide only static views do not capture the dynamic nature of software evolution. We present a new visualization technique, the Evolution Storyboard, which provides dynamic views of the evolution of a software's structure. An evolution storyboard consists of a sequence of animated panels, which highlight the structural changes in the system; one panel for each considered time period. Using storyboards, engineers can spot good design, signs of structural decay, or the spread of cross cutting concerns in the code. We implemented our concepts in a tool, which automatically extracts software dependency graphs from version control repositories and computes storyboards based on panels for different time periods. For applying our approach in practice, we provide a step by step guide that others can follow along the storyboard visualizations, in order to study the evolution of large systems. We have applied our method to several large open source software systems. In this paper, we demonstrate that our method provides additional information (compared to static views) on the ArgoUML project, an open source UML modeling tool.},
  author = {Beyer, Dirk and Hassan, Ahmed E},
  booktitle = {Proceedings of the 13th Working Conference on Reverse Engineering},
  doi = {10.1109/wcre.2006.14},
  isbn = {0-7695-2719-1},
  keywords = {type:application, paradigm:node-link, time:animation, evaluation:case\_study, application:software_engineering, software_evolution},
  pages = {199--210},
  publisher = {IEEE Computer Society},
  series = {WCRE},
  title = {Animated Visualization of Software History using {Evolution Storyboards}},
  year = {2006}
}

@inproceedings{Boitmanis2008Visualizing,
  abstract = {We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of representation in a single-level visualization rather than abstractions of lower levels of detail. This is useful for non-interactive display and eases dynamic layout, which we address in the online scenario. Our approach is illustrated on a family of large networks featuring all of the above structural characteristics, the physical Internet on the autonomous systems level over time.},
  author = {Boitmanis, Krists and Brandes, Ulrik and Pich, Christian},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-540-77537-9_36},
  keywords = {paradigm:node-link, application:infrastructure, type:application, evaluation:case\_study, time:animation},
  pages = {365--376},
  publisher = {Springer},
  series = {GD},
  title = {Visualizing Internet Evolution on the Autonomous Systems Level},
  year = {2008}
}

@article{Boyack2009Mapping,
  abstract = {How does our collective scholarly knowledge grow over time? What major areas of science exist and how are they interlinked? Which areas are major knowledge producers; which ones are consumers? Computational scientometrics — the application of bibliometric/scientometric methods to large-scale scholarly datasets — and the communication of results via maps of science might help us answer these questions. This paper represents the results of a prototype study that aims to map the structure and evolution of chemistry research over a 30 year time frame. Information from the combined Science (SCIE) and Social Science (SSCI) Citations Indexes from 2002 was used to generate a disciplinary map of 7,227 journals and 671 journal clusters. Clusters relevant to study the structure and evolution of chemistry were identified using JCR categories and were further clustered into 14 disciplines. The changing scientific composition of these 14 disciplines and their knowledge exchange via citation linkages was computed. Major changes on the dominance, influence, and role of Chemistry, Biology, Biochemistry, and Bioengineering over these 30 years are discussed. The paper concludes with suggestions for future work.},
  author = {Boyack, Kevin W and B{\"o}rner, Katy and Klavans, Richard},
  doi = {10.1007/s11192-009-0403-5},
  journal = {Scientometrics},
  keywords = {type:application, time:timeline, paradigm:node-link, evaluation:case_study, application:document},
  number = {1},
  pages = {45--60},
  publisher = {Akad{\'e}miai Kiad{\'o} co-published with Springer Science+ Business Media BV, Formerly Kluwer Academic Publishers BV},
  title = {Mapping the structure and evolution of chemistry research},
  volume = {79},
  year = {2009}
}

@article{Boyandin2012Qualitative,
  abstract = {We present a qualitative user study analyzing findings made while exploring changes over time in spatial interactions. We analyzed findings made by the study participants with flow maps, one of the most popular representations of spatial interactions, using animation and small-multiples as two alternative ways of representing temporal changes. Our goal was not to measure the subjects’ performance with the two views, but to find out whether there are qualitative differences between the types of findings users make with these two representations. To achieve this goal we performed a deep analysis of the collected findings, the interaction logs, and the subjective feedback from the users. We observed that with animation the subjects tended to make more findings concerning geographically local events and changes between subsequent years. With small-multiples more findings concerning longer time periods were made. Besides, our results suggest that switching from one view to the other might lead to an increase in the numbers of findings of specific types made by the subjects which can be beneficial for certain tasks.},
  author = {Boyandin, Ilya and Bertini, Enrico and Lalanne, Denis},
  doi = {10.1111/j.1467-8659.2012.03093.x},
  journal = {Computer Graphics Forum},
  keywords = {type:evaluation, time:animation, time:timeline, paradigm:node-link, evaluation:user_study, application:social, fixed_nodes},
  number = {3pt2},
  pages = {1005--1014},
  publisher = {Blackwell Publishing Ltd},
  series = {CGF},
  title = {A Qualitative Study on the Exploration of Temporal Changes in Flow Maps with Animation and Small-Multiples},
  volume = {31},
  year = {2012}
}

@inproceedings{Brandes1997Bayesian,
  abstract = {Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e. they build a mental map [ELMS91]. To retain this map at least partially, consecutive layouts of similar graphs should not differ significantly. Still, each of these layouts should adhere to constraints and criteria that have been specified to improve meaning and readability of a drawing. In [BW97], we introduced random field models for graph layout. As a major advantage of this formulation, many different layout models can be represented uniformly by random variables. This uniformity enables us to now present a framework for dynamic layout of arbitrary random field models. Our approach is based on Bayesian decision theory and formalizes common sense procedures. Example applications of our framework are dynamic versions of two well-known layout models: Eades' spring embedder [Ead84], and Tamassia's bend-minimum orthogonal layout model for plane graphs [Tam87].},
  author = {Brandes, Ulrik and Wagner, Dorothea},
  booktitle = {Graph Drawing},
  doi = {10.1007/3-540-63938-1_66},
  keywords = {paradigm:node-link, time:animation, type:technique, force-directed\_layout, orthogonal\_layout, evaluation:none, application:generic, mental\_map, online_problem, general-purpose_layout},
  pages = {236--247},
  publisher = {Springer},
  series = {GD},
  title = {A {Bayesian} Paradigm for Dynamic Graph Layout},
  year = {1997}
}

@article{Brandes2003Visual,
  abstract = {We introduce a method for visualizing evolving networks. In addition to the intermediate states of the network, it conveys the nature of change between states by unrolling the dynamics of the network. Each modification is shown in a separate layer of a three-dimensional representation, where the stack of layers corresponds to a time line of the evolution. We focus on networks of dynamic discourse as the driving application, but the method extends to any type of networks evolving in similar ways.},
  author = {Brandes, Ulrik and Corman, Steven R},
  doi = {10.1057/palgrave.ivs.9500037},
  issn = {1473-8724},
  journal = {Information Visualization},
  keywords = {application:social, 3d, time:timeline, paradigm:node-link, evaluation:case\_study, type:technique, superimposed_node-link, force-directed_layout, fixed_nodes},
  number = {1},
  pages = {40--50},
  publisher = {SAGE Publications},
  title = {Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse},
  volume = {2},
  year = {2003}
}

@inproceedings{Brandes2006Affiliation,
  abstract = {We propose a visualization approach for dynamic affiliation networks in which events are characterized by a set of descriptors. It uses a radial ripple metaphor to display the passing of time and conveys relations among the different constituents through appropriate layout. Our method is particularly suitable when assuming an egocentric perspective, and we illustrate it on movie-actor biographies.},
  author = {Brandes, Ulrik and Hoefer, Martin and Pich, Christian},
  booktitle = {Proceedings of the 8th Joint Eurographics / IEEE VGTC Conference on Visualization},
  doi = {10.2312/VisSym/EuroVis06/179-186},
  keywords = {ego_network, type:application, application:media, time:timeline, time:animation, evaluation:case_study, paradigm:node-link, radial},
  pages = {179--186},
  publisher = {Eurographics Association},
  series = {EuroVis},
  title = {Affiliation Dynamics with an Application to Movie-Actor Biographies.},
  year = {2006}
}

@inproceedings{Brandes2006Dynamic,
  abstract = {Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models.},
  author = {Brandes, Ulrik and Fleischer, Daniel and Puppe, Thomas},
  booktitle = {Graph Drawing},
  doi = {10.1007/11618058_3},
  keywords = {type:technique, paradigm:node-link, time:animation, evaluation:case_study, application:generic, online_problem, special-purpose_layout},
  pages = {25--36},
  publisher = {Springer},
  series = {GD},
  title = {Dynamic Spectral Layout of Small Worlds},
  year = {2006}
}

@article{Brandes2011Asymmetric,
  author = {Brandes, Ulrik and Nick, Bobo},
  doi = {10.1109/TVCG.2011.169},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:matrix, time:timeline, evaluation:case\_study, evaluation:expert, application:social, gestalt\_laws, sparklines, directed_graph, multivariate_graph, intra-cell_timelines},
  number = {12},
  pages = {2283--2290},
  publisher = {IEEE},
  series = {TVCG},
  title = {Asymmetric Relations in Longitudinal Social Networks},
  volume = {17},
  year = {2011}
}

@inproceedings{Brandes2012Quantitative,
  abstract = {In dynamic graph drawing, the input is a sequence of graphs for which a sequence of layouts is to be generated such that the quality of individual layouts is balanced with layout stability over time. Qualitatively different extensions of drawing algorithms for static graphs to the dynamic case have been proposed, but little is known about their relative utility. We report on a quantitative study comparing the three prototypical extensions via their adaptation for the stress-minimization framework. While some findings are more subtle, the linking approach connecting consecutive instances of the same vertex is found to be the overall method of choice.},
  author = {Brandes, Ulrik and Mader, Martin},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-642-25878-7_11},
  keywords = {type:evaluation, paradigm:node-link, time:animation, evaluation:algorithmic, application:social, offline\_problem, mental\_map},
  organization = {Springer},
  pages = {99--110},
  series = {GD},
  title = {A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing},
  year = {2012}
}

@article{Brandes2012Visualization,
  abstract = {As a consequence of the rising interest in longitudinal social networks and their analysis, there is also an increasing demand for tools to visualize them. We argue that similar adaptations of state-of-the-art graph-drawing methods can be used to visualize both, longitudinal networks and predictions of stochastic actor-oriented models (SAOMs), the most prominent approach for analyzing such networks. The proposed methods are illustrated on a longitudinal network of acquaintanceship among university freshmen.},
  author = {Brandes, Ulrik and Indlekofer, Natalie and Mader, Martin},
  doi = {10.1016/j.socnet.2011.06.002},
  journal = {Social Networks},
  keywords = {type:application, paradigm:node-link, time:animation, evaluation:case\_study, application:social},
  number = {3},
  pages = {291--308},
  publisher = {Elsevier},
  title = {Visualization methods for longitudinal social networks and stochastic actor-oriented modeling},
  volume = {34},
  year = {2012}
}

@incollection{Branke2001Dynamic,
  abstract = {Many graph drawing (GD) scenarios are dynamic inasmuch as they involve a repeated redrawing of the graph after frequently occurring changes to the graph structure and/or some layout properties.},
  author = {Branke, J\"urgen},
  booktitle = {Drawing graphs},
  doi = {10.1007/3-540-44969-8_9},
  keywords = {type:evaluation, paradigm:node-link, time:animation, evaluation:survey, application:generic, mental_map, orthogonal_layout, 3D, force-directed_layout, hierarchical_layout, directed_graph},
  pages = {228--246},
  publisher = {Springer},
  title = {Dynamic Graph Drawing},
  year = {2001}
}

@incollection{Brasch2012VENLO,
  abstract = {To understand life, it is fundamental to elucidate the evolution and function of biological networks in multiple species. Recently it has become possible to reconstruct the evolution of specific biological networks for several species. The data resulting from these reconstructions consists of ancestral networks and gene trees. To analyze such data, interactive visual methods are needed. We present a system that is able to visualize the evolution of biological networks in many species. We start with providing a comprehensible overview of the entire data set and provide details of the data upon demand via interaction mechanisms to select interesting subsets of the data. The selected subsets can be visualized using two main visualization types: (a) as network alignments in 2.5D (or other known) layouts or (b) as an animation of evolving networks. We developed a graph layout algorithm supporting the comparison of networks across both species and time steps without changing the graph layout while switching between the overview, the animated view, and the alignment view.We evaluate our system by applying it to real-world data.},
  author = {Brasch, Steffen and Fuellen, Georg and Linsen, Lars},
  booktitle = {Visualization in Medicine and Life Sciences II},
  doi = {10.1007/978-3-642-21608-4_13},
  keywords = {application:biology, type:application, paradigm:node-link, time:timeline, time:animation, 3D, evaluation:none, superimposed_node-link},
  pages = {229--247},
  publisher = {Springer},
  title = {{VENLO}: Interactive Visual Exploration of Aligned Biological Networks and Their Evolution},
  year = {2012}
}

@article{Burch2008TimeRadarTrees,
  abstract = {The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize such sequences of graphs. It uses radial tree layout to draw the hierarchy, and circle sectors to represent the temporal change of edges in the digraphs. We have developed several interaction techniques that allow the users to explore the structural and temporal data. Smooth animations help them to track the transitions between views. The usefulness of the approach is illustrated by examples from very different application domains.},
  author = {Burch, Michael and Diehl, Stephan},
  doi = {10.1111/j.1467-8659.2008.01213.x},
  journal = {Computer Graphics Forum},
  keywords = {radial, paradigm:matrix, time:timeline, directed_graph, weighted_graph, compound_graph,  application:sports, application:business, type:technique, evaluation:case\_study, application:software\_engineering, layered_matrices},
  number = {3},
  pages = {823--830},
  publisher = {Blackwell Publishing Ltd},
  series = {CGF},
  survey:data = {(n:21, e:1300, t:14)},
  title = {{TimeRadarTrees}: Visualizing dynamic compound digraphs},
  volume = {27},
  year = {2008}
}

@inproceedings{Burch2010TimeSpiderTrees,
  abstract = {Graphs are a mathematical method to model relations between objects. The most common metaphor to visualize graphs is the node-link technique, which typically suffers from visual clutter caused by many edge crossings. Much research has been done on the development of sophisticated algorithms aimed at enhancing the layout with respect to edge crossings and a series of other aesthetic criteria. In this paper we propose a novel visual metaphor, called Time-SpiderTrees, which is based on a radial layout. In our technique, relations are visually indicated by orientation instead of connectedness to circumvent the problem of edge crossings. The strength of this novel visualization technique lies in the visual encoding of time-series relational data in a single view without animation, which helps to preserve the mental map and hence to reduce cognitive efforts.},
  author = {Burch, Michael and Fritz, Michael and Beck, Fabian and Diehl, Stephan},
  booktitle = {Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing},
  doi = {10.1109/vlhcc.2010.31},
  isbn = {978-0-7695-4206-5},
  keywords = {application:document, application:sports, radial, paradigm:node-link, directed_graph, weighted_graph, compound_graph, time:timeline, evaluation:case\_study, type:technique, juxtaposed_node-link, omitted_links},
  pages = {168--175},
  publisher = {IEEE},
  series = {VL/HCC},
  survey:data = {(n:15, e:?, t:5), (n:21, e:1300, t:14)},
  title = {{TimeSpiderTrees}: A Novel Visual Metaphor for Dynamic Compound Graphs},
  year = {2010}
}

@inproceedings{Burch2011Layered,
  abstract = {We introduce a novel technique for visualizing dense time-varying directed and weighted multi-graphs with an additional hierarchical organization of the graph nodes. Combining Indented Tree Plots and TimeRadarTrees, we show the temporal evolution of relations in a static view. The graph edges are layered around thumbnail wheels consisting of color-coded sectors that are representatives of the graph nodes. These sectors generate implicit representations of graph edges. Start and target vertices are perceived by inspecting the color coding of sectors in the context of other sectors and their orientations. The technique puts emphasis on newer relations and hence, these are mapped to a larger display space in the radial diagram. The benefit of our technique is reduction of visual clutter from which node-link diagrams typically suffer. The visualization focuses on an easy exploration of trends, countertrends, periodicity, temporal shifts, and anomalies in time-varying relational data. We demonstrate the usefulness of the approach by applying it to dense dynamic graph data acquired from a soccer match of the 2D Soccer Simulation League.},
  author = {Burch, Michael and H\"oferlin, Markus and Weiskopf, Daniel},
  booktitle = {Proceedings of the 15th International Conference on Information Visualisation},
  doi = {10.1109/IV.2011.93},
  keywords = {application:sports, paradigm:matrix, radial, compound_graph, weighted_graph, directed_graph, type:technique, evaluation:case\_study, time:timeline, layered_matrices},
  pages = {18--25},
  publisher = {IEEE},
  series = {IV},
  survey:data = {(n:34, e:complete, t:6000)},
  title = {Layered {TimeRadarTrees}},
  year = {2011}
}

@article{Burch2011Parallel,
  abstract = {We present a novel dynamic graph visualization technique based on node-link diagrams. The graphs are drawn side-byside from left to right as a sequence of narrow stripes that are placed perpendicular to the horizontal time line. The hierarchically organized vertices of the graphs are arranged on vertical, parallel lines that bound the stripes; directed edges connect these vertices from left to right. To address massive overplotting of edges in huge graphs, we employ a splatting approach that transforms the edges to a pixel-based scalar field. This field represents the edge densities in a scalable way and is depicted by non-linear color mapping. The visualization method is complemented by interaction techniques that support data exploration by aggregation, filtering, brushing, and selective data zooming. Furthermore, we formalize graph patterns so that they can be interactively highlighted on demand. A case study on software releases explores the evolution of call graphs extracted from the JUnit open source software project. In a second application, we demonstrate the scalability of our approach by applying it to a bibliography dataset containing more than 1.5 million paper titles from 60 years of research history producing a vast amount of relations between title words.},
  author = {Burch, Michael and Vehlow, Corinna and Beck, Fabian and Diehl, Stephan and Weiskopf, Daniel},
  doi = {10.1109/tvcg.2011.226},
  issn = {1077-2626},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {paradigm:node-link, application:document, application:software\_engineering, mental\_map, time:timeline, bipartite, compound_graph, weighted_graph, directed_graph, graph\_difference, type:technique, evaluation:case\_study, juxtaposed_node-link},
  number = {12},
  pages = {2344--2353},
  publisher = {IEEE},
  series = {TVCG},
  survey:data = {(n:2817, e:15339, t:21), (n:?, e:264311, t:21), (n:?, e:412416, t:21)},
  title = {{Parallel Edge Splatting} for Scalable Dynamic Graph Visualization},
  volume = {17},
  year = {2011}
}

@inproceedings{Burch2012Radial,
  abstract = {We describe and discuss a novel radial version of a scalable dynamic graph visualization. The radial layout encodes dynamic directed graphs on narrow rings of a circle. The temporal evolution of the graph is mapped to rings that grow outward from the center of the circle. Graph vertices are placed equidistantly at the borderlines of each ring. Graph edges are displayed as curved lines starting from a source on the inner borderline of the ring and pointing to a target on the outer borderline. To better perceive link directions and structures of large datasets, visual clutter is reduced by exploiting an edge splatting approach that generates density fields of the displayed edges. The radial layout emphasizes newer graphs, displayed in the larger, outer parts of the circle. As a benefit, edge lengths are reduced in comparison to the non-radial visualization. Moreover, the radial layout guarantees the symmetry of the visualization under shifting of vertices. We illustrate the usefulness of the diagrams by applying them to call graph data of the open source software project Cobertura.},
  author = {Burch, Michael and Beck, Fabian and Weiskopf, Daniel},
  booktitle = {Proceedings of the 4th International Conference on Information Visualization Theory and Applications},
  keywords = {paradigm:node-link, radial, application:software\_engineering, type:technique, evaluation:case\_study, time:timeline, bipartite, compound_graph, weighted_graph, directed_graph, juxtaposed_node-link},
  pages = {603--612},
  publisher = {SciTePress},
  series = {IVAPP},
  survey:data = {(n:4812, e:27208, t:14)},
  title = {{Radial Edge Splatting} For Visualizing Dynamic Directed Graphs},
  year = {2012}
}

@inproceedings{Burch2012Visualizing,
  abstract = {Visualizing time-varying call graphs is challenging due to vast amounts of data at many dimensions to be displayed: Hierarchically organized vertices with attributes, directed or undirected edges with weights, and time. In this paper, we introduce a novel overview representation that shows dynamic graphs as a timeline- and pixel-based aggregated view targeting the preservation of a viewer's mental map by encoding the time-varying data into a static diagram. This view allows comparisons of dynamic call graphs on different levels of hierarchical granularity. Our data extraction and visualization system uses this overview as a starting point for further investigations by applying existing dynamic graph visualization techniques that show the graph structures and properties more clearly. These more task-specific visualizations show the dynamic graph data from different perspectives such as curved node-link diagrams or glyph-based representations combined by linking and brushing. Intermediate analysis steps can be stored and rebuilt at any time by using corresponding thumbnail representations.},
  author = {Burch, Michael and M\"uller, Christoph and Reina, Guido and Schmauder, Hansj\"org and Greis, Miriam and Weiskopf, Daniel},
  booktitle = {Vision, Modeling \& Visualization},
  doi = {10.2312/PE/VMV/VMV12/207-214},
  keywords = {type:application, application:software_engineering, time:timeline, paradigm:node-link, evaluation:none},
  organization = {The Eurographics Association},
  pages = {207--214},
  series = {VMV},
  title = {Visualizing Dynamic Call Graphs},
  year = {2012}
}

@inproceedings{Burch2013MatrixBased,
  abstract = {We introduce a matrix-based visualization technique for exploring time-varying directed and weighted graphs. Two overview representations are shown: one for the time-aggregated relations with attached quantitative weighted attributes and one for the results of an automatic dynamic pattern identification algorithm, i.e., relations accompanied by categorical attributes. Apart from a dynamic edge pattern categorization, our tool can also compute graph-specific properties---such as shortest paths or the existence of cliques---and highlight their evolution over time. The visualization method is complemented by interaction techniques that allow the user to navigate, explore, and browse the data, based on the Visual Information Seeking Mantra---overview first, zoom and filter, then details-on-demand. If an additional hierarchical organization of the vertices is available, this is attached to the matrix by vertical and horizontal layered icicle plots allowing one to explore the data on different levels of hierarchical granularity. The usefulness of the tool is demonstrated by applying it to time-varying migration data in the hierarchically structured world.},
  author = {Burch, Michael and Schmidt, Benjamin and Weiskopf, Daniel},
  booktitle = {Proceedings of the 17th International Conference Information Visualisation},
  doi = {10.1109/IV.2013.8},
  keywords = {type:technique, time:timeline, paradigm:matrix, application:social, evaluation:case_study, compound_graph, directed_graph, sparklines, intra-cell_timelines},
  pages = {66-73},
  publisher = {IEEE},
  series = {IV},
  title = {A Matrix-Based Visualization for Exploring Dynamic Compound Digraphs},
  year = {2013}
}

@inproceedings{Burch2014Dynamic,
  abstract = {During eye tracking studies, vast amounts of spatio-temporal data in the form of eye gaze trajectories are recorded. Finding insights into these time-varying data sets is a challenging task. Visualization techniques such as heat maps or gaze plots help find patterns in the data but either highly aggregate the data (heat maps) or are difficult to read due to overplotting (gaze plots). In this paper, we propose transforming eye movement data into a dynamic graph data structure to explore the visualization problem from a new perspective. By aggregating gaze trajectories of participants over time periods or Areas of Interest (AOIs), a fair trade-off between aggregation and details is achieved. We show that existing dynamic graph visualizations can be used to display the transformed data and illustrate the approach by applying it to eye tracking data recorded for investigating the readability of tree diagrams.},
  author = {Burch, Michael and Beck, Fabian and Raschke, Michael and Blascheck, Tanja and Weiskopf, Daniel},
  booktitle = {Proceedings of the Symposium on Eye Tracking Research and Applications},
  doi = {10.1145/2578153.2578175},
  keywords = {type:application, time:generic, paradigm:generic, evaluation:case_study, application:eye_tracking},
  pages = {151--158},
  series = {ETRA},
  title = {A Dynamic Graph Visualization Perspective on Eye Movement Data},
  year = {2014}
}

@inproceedings{Burch2014FlipBook,
  abstract = {Dynamic graph visualization techniques can be based on animated or static diagrams showing the evolution over time. In this paper, we apply the concept of small multiples representations to visually illustrate the dynamics of a graph. Node-link diagrams are used as the basic visual metaphor for displaying individual graphs of the sequence. To improve the readability of the diagram and reduce visual clutter we apply an edge splatting technique. Here, we discuss the benefits of splatted radial graph layouts on a modifiable 2D grid. Moreover, to obtain a more scalable dynamic graph visualization we interactively support a graph analyst by a Rapid Serial Visual Presentation (RSVP) feature to rapidly flip between the sequences of displayed graphs. The usefulness of the technique is illustrated in two case studies investigating a dynamic call graph and an evolving social network that consists of more than 1,000 graphs.},
  author = {Burch, Michael and Weiskopf, Daniel},
  booktitle = {Proceedings of the 7th International Symposium on Visual Information Communication and Interaction},
  doi = {10.1145/2636240.2636839},
  keywords = {type:technique, time:timeline, time:animation, paradigm:node-link, juxtaposed_node-link, evaluation:case_study, application:software_engineering, application:social, fixed_nodes, radial, linear_arrangement, offline_problem, software_evolution},
  pages = {29--38},
  publisher = {ACM},
  series = {VINCI},
  title = {A Flip-Book of Edge-Splatted Small Multiples for Visualizing Dynamic Graphs},
  year = {2014}
}

@article{Cengiz2013Visualization,
  abstract = {Visualisations of temporal social network datasets have the potential to be complex and require a lot of cognitive input. In this paper, we present a novel visualisation approach that depicts both relational and statistical information of evolving social structures. The underlying framework is implemented by the usage of Hyperbolic Geometry to support focus context rendering. The proposed method guarantees representing prominent social actors through scaling their representations, preserves user's mental map, and provides the user to reduce visual clutter by means of filtering.},
  author = {Cengiz Turker, Uraz and Balcisoy, Selim},
  doi = {10.1016/j.jvlc.2013.10.008},
  journal = {Journal of Visual Languages \& Computing},
  keywords = {paradigm:node-link, mental\_map, type:application, time:animation, evaluation:case\_study, evaluation:user\_study, evaluation:algorithmic, application:social, network\_metrics, radial},
  number = {3},
  pages = {227--242},
  publisher = {Elsevier},
  title = {A Visualization Technique for Large Temporal Social Network Datasets in Hyperbolic Space},
  volume = {25},
  year = {2013}
}

@inproceedings{Chen2003Visualizing,
  abstract = {Network evolution is an ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such as small-world networks and scale-free networks. In this article, we address a practical issue concerning the visualizations of co-citation networks of scientific publications derived by two widely known link reduction algorithms, namely minimum spanning trees (MSTs) and pathfinder networks (PFNETs). Our primary goal is to identify the strengths and weaknesses of the two methods in fulfilling the need for visualizing evolving networks. Two criteria are derived for assessing visualizations of evolving networks in terms of topological properties and dynamical properties. We examine the animated visualization models of the evolution of botulinum toxin research in terms of its co-citation structure across a 58-year span (1945-2002). The results suggest that although high-degree nodes dominate the structure of MST models, such structures can be inadequate in depicting the essence of how the network evolves because MST removes potentially significant links from high-order shortest paths. In contrast, PFNET models clearly demonstrate their superiority in maintaining the cohesiveness of some of the most pivotal paths, which in turn make the growth animation more predictable and interpretable. We suggest that the design of visualization and modeling tools for network evolution should take the cohesiveness of critical paths into account.},
  author = {Chen, Chaomei and Morris, Steven},
  booktitle = {Proceedings of the 2003 IEEE Symposium on Information Visualization},
  doi = {10.1109/INFVIS.2003.1249010},
  keywords = {type:evaluation, time:animation, paradigm:node-link, evaluation:case_study, application:document, 3d},
  pages = {67--74},
  publisher = {IEEE},
  series = {InfoVis},
  title = {Visualizing evolving networks: Minimum spanning trees versus pathfinder networks},
  year = {2003}
}

@article{Chen2006CiteSpace,
  abstract = {This article describes the latest development of a generic approach to detecting and visualizing emerging trends and transient patterns in scientific literature. The work makes substantial theoretical and methodological contributions to progressive knowledge domain visualization. A specialty is conceptualized and visualized as a time-variant duality between two fundamental concepts in information science: research fronts and intellectual bases. A research front is defined as an emergent and transient grouping of concepts and underlying research issues. The intellectual base of a research front is its citation and co-citation footprint in scientific literature—an evolving network of scientific publications cited by research-front concepts. Kleinberg's (2002) burst-detection algorithm is adapted to identify emergent research-front concepts. Freeman's (1979) betweenness centrality metric is used to highlight potential pivotal points of paradigm shift over time. Two complementary visualization views are designed and implemented: cluster views and time-zone views. The contributions of the approach are that (a) the nature of an intellectual base is algorithmically and temporally identified by emergent research-front terms, (b) the value of a co-citation cluster is explicitly interpreted in terms of research-front concepts, and (c) visually prominent and algorithmically detected pivotal points substantially reduce the complexity of a visualized network. The modeling and visualization process is implemented in CiteSpace II, a Java application, and applied to the analysis of two research fields: mass extinction (1981–2004) and terrorism (1990–2003). Prominent trends and pivotal points in visualized networks were verified in collaboration with domain experts, who are the authors of pivotal-point articles. Practical implications of the work are discussed. A number of challenges and opportunities for future studies are identified.},
  author = {Chen, Chaomei},
  doi = {10.1002/asi.20317},
  journal = {Journal of the American Society for Information Science and Technology},
  keywords = {type:application, application:document, paradigm:node-link, time:timeline, evaluation:case_study, evaluation:expert},
  number = {3},
  pages = {359--377},
  publisher = {Wiley Subscription Services, Inc., A Wiley Company},
  title = {{CiteSpace II}: Detecting and visualizing emerging trends and transient patterns in scientific literature},
  volume = {57},
  year = {2006}
}

@inproceedings{Cohen1992Framework,
  abstract = {In this paper we give a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing. We present dynamic algorithms for drawing planar graphs that use a variety of drawing standards (such as polyline, straight-line, orthogonal, grid, upward, and visibility drawings), and address aesthetic criteria that are important for readability, such as the display of planarity, symmetry, and reachability. Also, we provide techniques that are especially tailored for important subclasses of planar graphs such as trees and series-parallel digraphs. Our dynamic drawing algorithms have the important property of performing "smooth updates" of the drawing. Of special geometric interest is the possibility of performing point-location and window queries on the implicit representation of the drawing.},
  author = {Cohen, Robert F and Di Battista, Giuseppe and Tamassia, Roberto and Tollis, Ioannis G and Bertolazzi, Paola},
  booktitle = {Proceedings of the 8th Annual Symposium on Computational Geometry},
  doi = {10.1145/142675.142728},
  keywords = {paradigm:node-link, time:animation, planar_graph, evaluation:theoretical, type:technique, application:generic, online_problem, special-purpose_layout},
  organization = {ACM},
  pages = {261--270},
  series = {SoCG},
  title = {A Framework for Dynamic Graph Drawing},
  year = {1992}
}

@article{Cohen1995Dynamic,
  abstract = {Drawing graphs is an important problem that combines elements of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. We present efficient dynamic drawing algorithms for trees and series-parallel digraphs. As further applications of the model, we give dynamic drawing algorithms for planar st-digraphs and planar graphs. Our algorithms adopt a variety of representations (e.g., straight line, polyline, visibility) and update the drawing in a smooth way.},
  author = {Cohen, Robert F and Di Battista, Giuseppe and Tamassia, Roberto and Tollis, Ioannis G},
  comment = {appeared as a technical report in 1992; is an extended version of [Cohen1992Framework]},
  doi = {10.1137/S0097539792235724},
  journal = {SIAM Journal on Computing},
  keywords = {paradigm:node-link, time:animation, planar_graph, evaluation:theoretical, type:technique, application:generic, online_problem, special-purpose_layout},
  number = {5},
  pages = {970--1001},
  publisher = {SIAM},
  title = {Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and st-Digraphs},
  volume = {24},
  year = {1995}
}

@inproceedings{Collberg2003System,
  abstract = {We describe GEVOL, a system that visualizes the evolution of software using a novel graph drawing technique for visualization of large graphs with a temporal component. GEVOL extracts information about a Java program stored within a CVS version control system and displays it using a temporal graph visualizer. This information can be used by programmers to understand the evolution of a legacy program: Why is the program structured the way it is? Which programmers were responsible for which parts of the program during which time periods? Which parts of the program appear unstable over long periods of time and may need to be rewritten? This type of information will complement that produced by more static tools such as source code browsers, slicers, and static analyzers.},
  author = {Collberg, Christian and Kobourov, Stephen G and Nagra, Jasvir and Pitts, Jacob and Wampler, Kevin},
  booktitle = {Proceedings of the 2003 ACM Symposium on Software Visualization},
  doi = {10.1145/774833.774844},
  keywords = {type:application, paradigm:node-link, time:animation, evaluation:case_study, application:software_engineering, offline_problem, fixed_nodes, software_evolution},
  organization = {ACM},
  pages = {77--86},
  series = {SoftVis},
  title = {A system for graph-based visualization of the evolution of software},
  year = {2003}
}

@article{Curtis2012Enabling,
  abstract = {Many biological processes are context-dependent or temporally specific. As a result, relationships between molecular constituents evolve across time and environments. While cutting-edge machine learning techniques can recover these networks, exploring and interpreting the rewiring behavior is challenging. Information visualization shines in this type of exploratory analysis, motivating the development ofTVNViewer (http://sailing.cs.cmu.edu/tvnviewer webcite), a visualization tool for dynamic network analysis. In this paper, we demonstrate visualization techniques for dynamic network analysis by using TVNViewer to analyze yeast cell cycle and breast cancer progression datasets. TVNViewer is a powerful new visualization tool for the analysis of biological networks that change across time or space.},
  author = {Curtis, Ross E and Xiang, Jing and Parikh, Ankur and Kinnaird, Peter and Xing, Eric P},
  doi = {10.1186/1471-2105-13-204},
  journal = {BMC Bioinformatics},
  keywords = {type:application, paradigm:node-link, application:biology, evaluation:case_study, time:timeline, radial},
  number = {204},
  pages = {1--13},
  publisher = {BioMed Central Ltd},
  title = {Enabling dynamic network analysis through visualization in {TVNViewer}},
  volume = {13},
  year = {2012}
}

@inproceedings{Diehl2001Preserving,
  abstract = {First we introduce the concept of graph animations as a sequence of evolving graphs and a generic algorithm which computes a Foresighted Layout for dynamically drawing these graphs while preserving the mental map. The algorithm is generic in the sense that it takes a static graph drawing algorithm as a parameter. In other words, trees can be animated with a static tree layouter, graphs with a static Sugiyama-style layouter or a spring embedder, etc. Second we discuss applications of Foresighted Layout in algorithm animation and visualization of navigation behaviour.},
  author = {Diehl, Stephan and G\"org, Carsten and Kerren, Andreas},
  booktitle = {Proceedings of the 3rd Joint Eurographics--IEEE TCVG Conference on Visualization},
  comment = {appeared as a technical report in 2000},
  doi = {10.2312/VisSym/VisSym01/175-184},
  keywords = {type:technique, offline_problem, paradigm:node-link, time:animation, application:software_engineering, mental_map, 3d, evaluation:case_study, general-purpose_layout},
  organization = {Eurographics Association},
  pages = {175--184},
  series = {VisSym},
  title = {Preserving the mental map using foresighted layout},
  year = {2001}
}

@incollection{Diehl2002Graphs,
  abstract = {In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We introduce several general adjustment strategies and give examples of these strategies in the context of force-directed graph layout. Finally some results from our first prototype implementation are discussed.},
  author = {Diehl, Stephan and G\"org, Carsten},
  booktitle = {Graph Drawing},
  doi = {10.1007/3-540-36151-0_3},
  isbn = {3-540-00158-1},
  journal = {Graph Drawing},
  keywords = {paradigm:node-link, mental\_map, time:animation, offline\_problem, evaluation:case\_study, type:technique, application:generic, general-purpose_layout},
  pages = {23--31},
  posted-at = {2009-07-07 09:50:35},
  priority = {0},
  publisher = {Springer-Verlag},
  series = {GD},
  title = {Graphs, They are Changing -- Dynamic Graph Drawing for a Sequence of Graphs},
  year = {2002}
}

@inproceedings{Dutot2007GraphStream,
  abstract = {The notion of complex systems is common to many domains, from Biology to Economy, Computer Science, Physics, etc. Often, these systems are made of sets of entities moving in an evolving environment. One of their major characteristics is the emergence of some global properties stemmed from local interactions between the entities themselves and between the entities and the environment. The structure of these systems as sets of interacting entities leads researchers to model them as graphs. However, their understanding requires most often to consider the dynamics of their evolution. It is indeed not relevant to study some properties out of any temporal consideration. Thus, dynamic graphs seem to be a very suitable model for investigating the emergence and the conservation of some properties. GraphStream is a Java-based library whose main purpose is to help researchers and developers in their daily tasks of dynamic problem modeling and of classical graph management tasks: creation, processing, display, etc. It may also be used, and is indeed already used, for teaching purpose. GraphStream relies on an event-based engine allowing several event sources. Events may be included in the core of the application, read from a file or received from an event handler.},
  author = {Dutot, Antoine and Guinand, Fr{\'e}d{\'e}ric and Olivier, Damien and Pign{\'e} Yoann},
  booktitle = {Emergent Properties in Natural and Artificial Complex Systems, Satellite Conference within the 4th European Conference on Complex Systems (ECCS'2007)},
  keywords = {paradigm:node-link, type:application, paradigm:node-link, time:animation, evaluation:case_study, application:infrastructure},
  pages = {1--10},
  series = {ECCS},
  title = {{GraphStream}: A tool for bridging the gap between complex systems and dynamic graphs},
  url = {http://hal.archives-ouvertes.fr/hal-00264043/},
  year = {2007}
}

@inproceedings{Dwyer2002Visualising,
  abstract = {We describe a paradigm for visualising time dependent flow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We show two variants of the paradigm, one in which the elements of the graph are shown as vertical columns of varying width and another which emphasises centrality with bending "worms". We demonstrate these techniques by visualising the movements of Fund Managers within the UK Stock Market in terms of their changing share ownership over time.},
  author = {Dwyer, Tim and Eades, Peter},
  booktitle = {Proceedings of the 6th International Conference on Information Visualisation},
  doi = {10.1109/IV.2002.1028770},
  keywords = {type:technique, time:timeline, paradigm:node-link, evaluation:case_study, application:business, 3d, superimposed_node-link, force-directed_layout, fixed_nodes},
  pages = {147--152},
  publisher = {IEEE},
  series = {IV},
  title = {Visualising a fund manager flow graph with columns and worms},
  year = {2002}
}

@article{Dwyer2004Visualising,
  abstract = {We explore a multiple view, or overview and detail, method for visualising a high-dimensional portfolio holdings data set with attributes that change over time. The method employs techniques from multidimensional scaling and graph visualisation to find a two-dimensional mapping for high-dimensional data. In both the overview and detail views, time is mapped to the third dimension providing a two and a half-dimensional view of changes in the data. We demonstrate the utility of the paradigm with a prototype system for visualisation of movements within a large set of UK fund managers’ stock portfolios.},
  author = {Dwyer, Tim and Gallagher, David R},
  doi = {10.1057/palgrave.ivs.9500081},
  journal = {Information Visualization},
  keywords = {time:timeline, paradigm:node-link, application:business, 3d, fixed_nodes, force-directed_layout, superimposed_node-link, type:application, evaluation:expert, evaluation:case_study, multivariate_graph, hierarchical_layout},
  number = {4},
  pages = {227--244},
  publisher = {SAGE Publications},
  title = {Visualising changes in fund manager holdings in two and a half-dimensions},
  volume = {3},
  year = {2004}
}

@inproceedings{Elmqvist2003Causality,
  abstract = {We present Growing Polygons, a novel visualization technique for the graphical representation of causal relations and information flow in a system of interacting processes. Using this method, individual processes are displayed as partitioned polygons with color-coded segments showing dependencies to other processes. The entire visualization is also animated to communicate the dynamic execution of the system to the user. The results from a comparative user study of the method show that the Growing Polygons technique is significantly more efficient than the traditional Hasse diagram visualization for analysis tasks related to deducing information flow in a system for both small and large executions. Furthermore, our findings indicate that the correctness when solving causality tasks is significantly improved using our method. In addition, the subjective ratings of the users rank the method as superior in all regards, including usability, efficiency, and enjoyability.},
  author = {Elmqvist, Niklas and Tsigas, Philippas},
  booktitle = {Proceedings of the 2003 IEEE Symposium on Information Visualization},
  doi = {10.1109/INFVIS.2003.1249025},
  keywords = {type:application, paradigm:node-link, time:timeline, time:animation, evaluation:user_study, application:software_engineering, program_execution},
  pages = {189--196},
  publisher = {IEEE},
  series = {InfoVis},
  title = {Causality visualization using animated growing polygons},
  year = {2003}
}

@article{Ens2014ChronoTwigger,
  abstract = {Applying visual analytics to large software systems can help users comprehend the wealth of information produced by source repository mining. One concept of interest is the co-evolution of test code with source code, or how source and test files develop together over time. For example, understanding how the testing pace compares to the development pace can help test managers gauge the effectiveness of their testing strategy. A useful concept that has yet to be effectively incorporated into a co-evolution visualization is co-change. Co-change is a quantity that identifies correlations between software artifacts, and we propose using this to organize our visualization in order to enrich the analysis of co-evolution. In this paper, we create, implement, and study an interactive visual analytics tool that displays source and test file changes over time (co-evolution) while grouping files that change together (co-change). Our new technique improves the analyst’s ability to infer information about the software development process and its relationship to testing. We discuss the development of our system and the results of a small pilot study with three participants. Our findings show that our visualization can lead to inferences that are not easily made using other techniques alone.},
  author = {Ens, Barrett and Rea, Daniel and Shpaner, Roiy and Hemmati, Hadi and Young, James E and Irani, Pourang},
  booktitle = {Proceedings of the 2nd IEEE Working Conference on Software Visualization},
  keywords = {type:application, time:timeline, 3d, paradigm:node-link, application:software_engineering, omitted_links, evaluation:user_study, software_evolution},
  pages = {117--126},
  publisher = {IEEE},
  series = {VISSOFT},
  title = {{ChronoTwigger}: A Visual Analytics Tool for Understanding Source and Test Co-Evolution},
  url = {http://conferences.computer.org/vissoft/2014/papers/6150a117.pdf},
  year = {2014}
}

@inproceedings{Erten2004Exploring,
  abstract = {We present a system for the visualization of computing literature with an emphasis on collaboration patterns, interactions between related research specialties and the evolution of these characteristics through time. Our computing literature visualization system, has four major components: A mapping of bibliographical data to relational schema coupled with an RDBMS to store the relational data, an interactive GUI that allows queries and the dynamic construction of graphs, a temporal graph layout algorithm, and an interactive visualization tool. We use a novel technique for visualization of large graphs that evolve through time. Given a dynamic graph, the layout algorithm produces two-dimensional representations of each timeslice, while preserving the mental map of the graph from one slice to the next. A combined view, with all the timeslices can also be viewed and explored. For our analysis we use data from the Association of Computing Machinery's Digital Library of Scientific Literature which contains more than one hundred thousand research papers and authors. Our system can be found online at http://tgrip.cs.arizona.edu.},
  author = {Erten, Cesim and Harding, Philip J and Kobourov, Stephen G and Wampler, Kevin and Yee, Gary V},
  booktitle = {Visualization and Data Analysis},
  doi = {10.1117/12.539245},
  keywords = {paradigm:node-link, 3d, time:timeline, type:application, evaluation:case\_study, application:document, application:social},
  pages = {45-56},
  series = {VDA},
  title = {Exploring the Computing Literature Using Temporal Graph Visualization},
  year = {2004}
}

@incollection{Erten2004GraphAEL,
  abstract = {GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic graphs, and collaboration graphs. We also create difference graphs which capture the nature of change between two given time periods. GraphAEL can be accessed online at http://graphael.cs.arizona.edu .},
  author = {Erten, Cesim and Harding, Philip J and Kobourov, Stephen G and Wampler, Kevin and Yee, Gary V},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-540-24595-7_9},
  isbn = {978-3-540-20831-0},
  keywords = {3d, time:animation, paradigm:node-link, type:technique, evaluation:case\_study, application:social, force-directed_layout, graph_difference, mental_map, application:document, offline_problem, general-purpose_layout},
  pages = {98--110},
  publisher = {Springer},
  series = {GD},
  title = {{GraphAEL}: Graph Animations with Evolving Layouts Graph Drawing},
  year = {2004}
}

@inproceedings{Erten2004Simultaneous,
  abstract = {In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different algorithms for simultaneous graph drawing and three different visualization schemes. The algorithms are based on a modification of the force-directed algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining individually readable drawings. The implementation is in Java and the system can be downloaded at http://simg.cs.arizona.edu/.},
  author = {Erten, Cesim and Kobourov, Stephen G and Le, Vu and Navabi, Armand},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-540-24595-7_41},
  keywords = {type:technique, force-directed_layout, paradigm:node-link, time:timeline, 3d, evaluation:none, application:generic, superimposed_node-link},
  organization = {Springer},
  pages = {437--449},
  series = {GD},
  title = {Simultaneous graph drawing: Layout algorithms and visualization schemes},
  year = {2004}
}

@article{Farrugia2011Effective,
  abstract = {Graph drawing algorithms have classically addressed the layout of static graphs. However, the need to draw evolving or dynamic graphs has brought into question many of the assumptions, conventions and layout methods designed to date. For example, social scientists studying evolving social networks have created a demand for visual representations of graphs changing over time. Two common approaches to represent temporal information in graphs include animation of the network and use of static snapshots of the network at different points in time. Here, we report on two experiments, one in a laboratory environment and another using an asynchronous remote web-based platform, Mechanical Turk, to compare the efficiency of animated displays versus static displays. Four tasks are studied with each visual representation, where two characterise overview level information presentation, and two characterise micro level analytical tasks. For the tasks studied in these experiments and within the limits of the experimental system, the results of this study indicate that static representations are generally more effective particularly in terms of time performance, when compared to fully animated movie representations of dynamic networks.},
  author = {Farrugia, Michael and Quigley, Aaron J},
  doi = {10.1057/ivs.2010.10},
  journal = {Information Visualization},
  keywords = {time:animation, time:timeline, type:evaluation, paradigm:node-link, evaluation:user_study, application:generic},
  number = {1},
  pages = {47--64},
  publisher = {SAGE Publications},
  title = {Effective temporal graph layout: A comparative study of animation versus static display methods},
  volume = {10},
  year = {2011}
}

@inproceedings{Farrugia2011Exploring,
  abstract = {Many of the current dynamic network visualisations methods or techniques rely on node-link force-based models that were originally developed for visualising static network snapshots. In this study, we diverge from this traditional layout approach and develop a layout for ego networks that places the time dimension in the foreground, by turning time into an element of shape. In addition to this we develop an interactive system that enables the visualisation of multiple networks simultaneously by employing small multiples. Using the proposed layout and analytical system as a grounding visual structure, we visually characterise dynamic network events in 3 different networks; the evolution of the biotechnology field, a phone call data set and a network of passenger connections of an airline. From this analysis we propose a range of ego network visual motifs that can be used as templates to identify and characterise events that are occurring in a dynamic network.},
  author = {Farrugia, Michael and Hurley, Neil and Quigley, Aaron J},
  booktitle = {Proceedings of the 4th International Conference on Advances in Computer-Human Interactions},
  keywords = {application:infrastructure, application:social, radial, paradigm:node-link, time:timeline, type:technique, ego\_network, juxtaposed_node-link, evaluation:case_study},
  pages = {79--88},
  series = {ACHI},
  title = {Exploring temporal ego networks using small multiples and tree-ring layouts},
  url = {http://hcibib.org/ACHI11},
  year = {2011}
}

@inproceedings{Federico2011Visual,
  abstract = {The visualization and analysis of dynamic networks have become increasingly important in several fields, for instance sociology or economics. The dynamic and multi-relational nature of this data poses the challenge of understanding both its topological structure and how it changes over time. In this paper we propose a visual analytics approach for analyzing dynamic networks that integrates: a dynamic layout with user-controlled trade-off between stability and consistency; three temporal views based on different combinations of node-link diagrams (layer superimposition, layer juxtaposition, and two-and-a-half-dimensional view); the visualization of social network analysis metrics; and specific interaction techniques for tracking node trajectories and node connectivity over time. This integration of visual, interactive, and automatic methods supports the multi-faceted analysis of dynamically changing networks.},
  author = {Federico, Paolo and Aigner, Wolfgang and Miksch, Silvia and Windhager, Florian and Zenk, Lukas},
  booktitle = {Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies},
  doi = {10.1145/2024288.2024344},
  keywords = {type:technique, paradigm:node-link, time:timeline, evaluation:none, application:social, 3d, superimposed_node-link, juxtaposed_node-link},
  pages = {47},
  series = {i-KNOW},
  title = {A Visual Analytics Approach to Dynamic Social Networks},
  year = {2011}
}

@article{Feng2012Coherent,
  abstract = {We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach utilizes existing graph layout algorithms to produce the initial graph layout, and formulates the problem of generating coherent time-varying graph visualization with the focus+context capability as a specially tailored deformation optimization problem. We adopt the concept of the super graph to maintain spatiotemporal coherence and further balance the needs for aesthetic quality and dynamic stability when interacting with time-varying graphs through focus+context visualization. Our method is particularly useful for multifocus+context visualization of time-varying graphs where we can preserve the mental map by preventing nodes in the focus from undergoing abrupt changes in size and location in the time sequence. Experiments demonstrate that our method strikes a good balance between maintaining spatiotemporal coherence and accentuating visual foci, thus providing a more engaging viewing experience for the users.},
  address = {Los Alamitos, CA, USA},
  author = {Feng, Kun-Chuan and Wang, Chaoli and Shen, Han-Wei and Lee, Tong-Yee},
  doi = {10.1109/TVCG.2011.128},
  issn = {1077-2626},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:node-link, time:animation, evaluation:algorithmic, application:social, application:document, mental\_map, offline_problem, general-purpose_layout},
  number = {8},
  pages = {1330-1342},
  publisher = {IEEE Computer Society},
  series = {TVCG},
  title = {Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction},
  volume = {18},
  year = {2012}
}

@inproceedings{Forrester2005graphael,
  abstract = {The graphael system implements several traditional force-directed layout methods, as well as several novel layout methods for non-Euclidean geometries, including hyperbolic and spherical. The system can handle large graphs, using multi-scale variations of the force-directed methods. Moreover, graphael can layout and visualize graphs that evolve though time, using static views, animation, and morphing. The implementation includes a powerful interface that allows the user to put together existing algorithms and visualization techniques, and to easily add new ones. The system is written in Java and is available as a downloadable program or as an applet at http://graphael.cs.arizona.edu.},
  author = {Forrester, David and Kobourov, Stephen G and Navabi, Armand and Wampler, Kevin and Yee, Gary V},
  booktitle = {Graph drawing},
  doi = {10.1007/978-3-540-31843-9_47},
  keywords = {type:technique, time:animation, paradigm:node-link, evaluation:case_study, force-directed_layout, offline_problem, mental_map, radial, 3d, application:document, general-purpose_layout},
  pages = {454--464},
  publisher = {Springer},
  series = {GD},
  title = {{graphael}: A system for generalized force-directed layouts},
  year = {2005}
}

@inproceedings{Friedrich2001Marey,
  abstract = {Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present Marey, a system that can smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm.},
  author = {Friedrich, Carsten and Eades, Peter},
  booktitle = {Graph Drawing},
  doi = {10.1007/3-540-44541-2_37},
  keywords = {type:technique, time:animation, paradigm:node-link, application:generic, evaluation:case_study, transition_problem, general-purpose_layout},
  pages = {396--406},
  publisher = {Springer},
  series = {GD},
  title = {The {Marey} graph animation tool demo},
  year = {2001}
}

@article{Friedrich2002Graph,
  abstract = {Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm.},
  author = {Friedrich, Carsten and Eades, Peter},
  doi = {10.7155/jgaa.00057},
  journal = {Journal of Graph Algorithms and Applications},
  keywords = {type:technique, paradigm:node-link, time:animation, mental_map, evaluation:case_study, application:generic, transition_problem, general-purpose_layout},
  number = {3},
  pages = {353--370},
  title = {Graph drawing in motion},
  volume = {6},
  year = {2002}
}

@inproceedings{Friedrich2002GraphII,
  abstract = {Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. Whenever a layout in a graph drawing system is modified, the mental map of the user must be preserved. One way in which the user can be helped in understanding a change of layout is through animation of the change. In this paper, we present clustering-based strategies for identifying groups of nodes sharing a common, simple motion from initial layout to final layout. Transformation of these groups is then handled separately in order to generate a smooth animation.},
  author = {Friedrich, Carsten and Houle, Michael E},
  booktitle = {Graph Drawing},
  doi = {10.1007/3-540-45848-4_18},
  keywords = {type:technique, time:animation, paradigm:node-link, evaluation:case_study, application:generic, mental_map, clustering, transition_problem, general-purpose_layout},
  pages = {220--231},
  publisher = {Springer},
  series = {GD},
  title = {Graph Drawing in Motion {II}},
  year = {2002}
}

@inproceedings{Frishman2004Dynamic,
  abstract = {This paper presents an algorithm for drawing a sequence of graphs that contain an inherent grouping of their vertex set into clusters. It differs from previous work on dynamic graph drawing in the emphasis that is put on maintaining the clustered structure of the graph during incremental layout. The algorithm works online and allows arbitrary modifications to the graph. It is generic and can be implemented using a wide range of static force-directed graph layout tools. The paper introduces several metrics for measuring layout quality of dynamic clustered graphs. The performance of our algorithm is analyzed using these metrics. The algorithm has been successfully applied to visualizing mobile object software.},
  author = {Frishman, Yaniv and Tal, Ayellet},
  booktitle = {Proceedings of the 2004 IEEE Symposium on Information Visualization},
  doi = {10.1109/INFVIS.2004.18},
  keywords = {time:animation, paradigm:node-link, online\_problem, mental\_map, evaluation:case\_study, application:infrastructure, compound_graph, type:technique, force-directed\_layout, 3d, application:software\_engineering, evaluation:algorithmic, special-purpose_layout},
  pages = {191--198},
  publisher = {IEEE},
  series = {InfoVis},
  title = {Dynamic Drawing of Clustered Graphs},
  year = {2004}
}

@article{Frishman2008MOVIS,
  abstract = {This paper presents MOVIS---a system for visualizing mobile object frameworks. In such frameworks, the objects can migrate to remote hosts, along with their state and behavior, while the application is running. An innovative graph-based visualization is used to depict the physical and the logical connections in the distributed object network. Scalability is achieved by using a focus+context technique jointly with a user-steered clustering algorithm. In addition, an event synchronization model for mobile objects is presented. The system has been applied to visualizing several mobile object applications.},
  author = {Frishman, Yaniv and Tal, Ayellet},
  doi = {10.1016/j.jvlc.2007.07.006},
  journal = {Journal of Visual Languages \& Computing},
  keywords = {type:application, compound_graph, 3d, paradigm:node-link, evaluation:case_study, time:animation, application:software_engineering, clustering, program_execution},
  number = {3},
  pages = {303--320},
  publisher = {Elsevier},
  title = {{MOVIS}: A system for visualizing distributed mobile object environments},
  volume = {19},
  year = {2008}
}

@article{Frishman2008Online,
  abstract = {This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and, thus, the user's mental map while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.},
  author = {Frishman, Yaniv and Tal, Ayellet},
  doi = {10.1109/tvcg.2008.11},
  issn = {1077-2626},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {paradigm:node-link, time:animation, online\_problem, mental\_map, type:technique, application:social, evaluation:algorithmic, evaluation:case\_study, general-purpose_layout},
  number = {4},
  pages = {727--740},
  publisher = {IEEE},
  series = {TVCG},
  title = {Online Dynamic Graph Drawing},
  volume = {14},
  year = {2008}
}

@inproceedings{Fu2007Visualization,
  abstract = {This paper presents various methods for visualization and analysis of email networks; visualization on the surface of a sphere to reveal communication patterns between different groups, a hierarchical drawing displaying the centrality analysis of nodes to emphasize important nodes, a 2.5D visualization for temporal email networks to analyze the evolution of email relationships changing over time, and an ambient display for finding social circles derived from the email network. Each method was evaluated with various data sets from a research organization. We also extended our method for visual analysis of an email virus network.},
  author = {Fu, Xiaoyan and Hong, Seok-Hee and Nikolov, Nikola S and Shen, Xiaobin and Wu, Yingxin and Xu, Kai},
  booktitle = {Proceedings of the 6th International Asia-Pacific Symposium on Visualization},
  doi = {10.1109/APVIS.2007.329302},
  keywords = {type:application, time:timeline, paradigm:node-link, application:social, evaluation:case_study, 3d, superimposed_node-link},
  pages = {1--8},
  publisher = {IEEE},
  series = {APVis},
  title = {Visualization and analysis of email networks},
  year = {2007}
}

@inproceedings{Gaertler2006Hybrid,
  abstract = {Dynamic processes frequently occur in many applications. Visualizations of dynamically evolving data, for example as part of the data analysis, are typically restricted to a cumulative static view or an animation/sequential view. Both methods have their benefits and are often complementary in their use. In this article, we present a hybrid model that combines the two techniques. This is accomplished by 2.5D drawings which are calculated in an incremental way. The method has been evaluated on collaboration networks.},
  author = {Gaertler, Marco and Wagner, Dorothea},
  booktitle = {Graph Drawing},
  doi = {10.1007/11618058_18},
  keywords = {type:technique, time:timeline, 3d, paradigm:node-link, evaluation:case_study, application:document},
  pages = {189--200},
  publisher = {Springer},
  series = {GD},
  title = {A hybrid model for drawing dynamic and evolving graphs},
  year = {2006}
}

@article{Gansner2013Interactive,
  abstract = {The many endless rivers of text now available present a serious challenge in the task of gleaning, analyzing and discovering useful information. In this paper, we describe a methodology for visualizing a text stream in real-time, modeled as a dynamic graph and its derived map. The approach automatically groups similar messages into clusters displayed as "countries", with keyword summaries, using semantic analysis, graph clustering and map generation techniques. It handles the need for visual stability across time by dynamic graph layout and Procrustes projection, enhanced with a novel stable component packing algorithm. The result provides a continuous, succinct view of ever-changing topics of interest. To make these ideas concrete, we describe their application to an experimental web service called TwitterScope.},
  author = {Gansner, Emden R. and Hu, Yifan and North, Stephen C},
  comment = {extended version of a paper that appeared at Graph Drawing 2012},
  doi = {10.7155/jgaa.00302},
  journal = {Journal of Graph Algorithms and Applications},
  keywords = {type:application, paradigm:node-link, time:animation, evaluation:case\_study, application:document, map\_metaphor},
  number = {4},
  pages = {515--540},
  title = {Interactive Visualization of Streaming Text Data with Dynamic Maps},
  volume = {17},
  year = {2013}
}

@article{Ghani2012Perception,
  abstract = {Effective visualization of dynamic graphs remains an open research topic, and many state-of-the-art tools use animated node-link diagrams for this purpose. Despite its intuitiveness, the effectiveness of animation in node-link diagrams has been questioned, and several empirical studies have shown that animation is not necessarily superior to static visualizations. However, the exact mechanics of perceiving animated node-link diagrams are still unclear. In this paper, we study the impact of different dynamic graph metrics on user perception of the animation. After deriving candidate visual graph metrics, we perform an exploratory user study where participants are asked to reconstruct the event sequence in animated node-link diagrams. Based on these findings, we conduct a second user study where we investigate the most important visual metrics in depth. Our findings show that node speed and target separation are prominent visual metrics to predict the performance of event sequencing tasks.},
  author = {Ghani, Sohaib and Elmqvist, Niklas and Yi, Ji Soo},
  doi = {10.1111/j.1467-8659.2012.03113.x},
  journal = {Computer Graphics Forum},
  keywords = {time:animation, paradigm:node-link, type:evaluation, force-directed\_layout, evaluation:user_study, application:generic, mental_map},
  number = {3pt3},
  pages = {1205--1214},
  publisher = {Blackwell Publishing Ltd},
  series = {CGF},
  title = {Perception of Animated Node-Link Diagrams for Dynamic Graphs},
  volume = {31},
  year = {2012}
}

@article{Gilbert2011Communities,
  abstract = {Detection of community structures in social networks has attracted lots of attention in the domain of sociology and behavioral sciences. Social networks also exhibit dynamic nature as these networks change continuously with the passage of time. Social networks might also present a hierarchical structure led by individuals who play important roles in a society such as managers and decision makers. Detection and visualization of these networks that are changing over time is a challenging problem where communities change as a function of events taking place in the society and the role people play in it. In this paper, we address these issues by presenting a system to analyze dynamic social networks. The proposed system is based on dynamic graph discretization and graph clustering. The system allows detection of major structural changes taking place in social communities over time and reveals hierarchies by identifying influential people in social networks. We use two different data sets for the empirical evaluation and observe that our system helps to discover interesting facts about the social and hierarchical structures present in these social networks.},
  author = {Gilbert, Fr{\'e}d{\'e}ric and Simonetto, Paolo and Zaidi, Faraz and Jourdan, Fabien and Bourqui, Romain},
  doi = {10.1007/s13278-010-0002-8},
  journal = {Social Network Analysis and Mining},
  keywords = {type:application, application:social, time:timeline, time:animation, evaluation:case_study, paradigm:node-link, force-directed_layout, compound_graph},
  number = {2},
  pages = {83--95},
  publisher = {Springer},
  title = {Communities and hierarchical structures in dynamic social networks: analysis and visualization},
  volume = {1},
  year = {2011}
}

@inproceedings{Gorg2005Dynamic,
  abstract = {In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parameterized to trade layout quality for dynamic stability. In particular, we had to develop new metrics which work upon the intermediate results of layout phases. We discuss some properties of the resulting animations by means of examples.},
  author = {G\"org, Carsten and Birke, Peter and Pohl, Mathias and Diehl, Stephan},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-540-31843-9_24},
  keywords = {type:technique, paradigm:node-link, time:animation, orthogonal_layout, hierarchical_layout, evaluation:case_study, application:software_engineering, mental_map, offline_problem, general-purpose_layout},
  pages = {228--238},
  publisher = {Springer},
  series = {GD},
  title = {Dynamic graph drawing of sequences of orthogonal and hierarchical graphs},
  year = {2005}
}

@article{Gorochowski2012Using,
  abstract = {Networks are widely used to describe many natural and technological systems. Understanding how these evolve over time poses a challenge for existing visualization techniques originally developed for fixed network structures. We describe a method of incorporating the concept of aging into evolving networks, where nodes and edges store information related to the amount of local evolutionary change they have experienced. This property is used to generate visualizations that ensure stable substructures maintain relatively fixed spatial positions, allowing them to act as visual markers and providing context for evolutionary change elsewhere. By further supplementing these visualizations with color cues, the resultant animations enable a clearer portrayal of the underlying evolutionary process.},
  author = {Gorochowski, Thomas E and di Bernardo, Mario and Grierson, Claire S},
  doi = {10.1109/TVCG.2011.142},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:node-link, time:animation, evaluation:algorithmic, application:generic, force-directed_layout, online_problem, general-purpose_layout},
  number = {8},
  pages = {1343--1352},
  publisher = {IEEE},
  series = {TVCG},
  title = {Using Aging to Visually Uncover Evolutionary Processes on Networks},
  volume = {18},
  year = {2012}
}

@inproceedings{Greevy2006Visualizing,
  abstract = {The analysis of the runtime behavior of a software system yields vast amounts of information, making accurate interpretations difficult. Filtering or compression techniques are often applied to reduce the volume of data without loss of key information vital for a specific analysis goal. Alternatively, visualization is generally accepted as a means of effectively representing large amounts of data. The challenge lies in creating effective and expressive visual representations that not only allows for a global picture, but also enables us to inspect the details of the large data sets. We define the focus of our analysis to be the runtime behavior of features. Static structural visualizations of a system are typically represented in two dimensions. We exploit a third dimension to visually represent the dynamic information, namely object instantiations and message sends. We introduce a novel 3D visualization technique that supports animation of feature behavior and integrates zooming, panning, rotating and on-demand details. As proof of concept, we apply our visualization technique to feature execution traces of an example system.},
  author = {Greevy, Orla and Lanza, Michele and Wysseier, Christoph},
  booktitle = {Proceedings of the 2006 ACM Symposium on Software Visualization},
  doi = {10.1145/1148493.1148501},
  isbn = {1-59593-464-2},
  keywords = {type:application, paradigm:node-link, 3d, time:timeline, application:software\_engineering, evaluation:case\_study, program_execution},
  pages = {47--56},
  publisher = {ACM},
  series = {SoftVis},
  title = {Visualizing live software systems in {3D}},
  year = {2006}
}

@article{Greilich2009Visualizing,
  abstract = {Compound digraphs are a widely used model in computer science. In many application domains these models evolve over time. Only few approaches to visualize such dynamic compound digraphs exist and mostly use animation to show the dynamics. In this paper we present a new visualization tool called TimeArcTrees that visualizes weighted, dynamic compound digraphs by drawing a sequence of node-link diagrams in a single view. Compactness is achieved by aligning the nodes of a graph vertically. Edge crossings are reduced by drawing upward and downward edges separately as colored arcs. Horizontal alignment of the instances of the same node in different graphs facilitates comparison of the graphs in the sequence. Many interaction techniques allow to explore the given graphs. Smooth animation supports the user to better track the transitions between views and to preserve his or her mental map. We illustrate the usefulness of the tool by looking at the particular problem of how shortest paths evolve over time. To this end, we applied the system to an evolving graph representing the German Autobahn and its traffic jams.},
  author = {Greilich, Martin and Burch, Michael and Diehl, Stephan},
  doi = {10.1111/j.1467-8659.2009.01451.x},
  issn = {1467-8659},
  journal = {Computer Graphics Forum},
  keywords = {paradigm:node-link, compound_graph, weighted_graph, directed_graph, time:timeline, evaluation:case\_study, application:infrastructure, type:technique, linear\_arrangement, juxtaposed_node-link},
  number = {3},
  pages = {975--982},
  publisher = {Blackwell Publishing},
  series = {CGF},
  survey:data = {(n:30, e:700, t:7)},
  title = {Visualizing the Evolution of Compound Digraphs with {TimeArcTrees}},
  volume = {28},
  year = {2009}
}

@inproceedings{Groh2009Interactively,
  abstract = {The dynamic social network visualizer “DySoN” (Dynamic Social Networks) aims at understanding patterns and structural changes in dynamic social networks that evolve over time via an interactive visualization approach. As an alternative and supplementation to the numerous other approaches to visualization of social network data and as an attempt to overcome some of the drawbacks of these approaches, DySoN interactively visualizes streaming event data of social interactions by an interactive three-dimensional model of interpolated NURBS ”tubes”, representing activity and social proximity within a given set of actors during a given time period by using three dimensions of temporal information mapping: spatial density (tube distance), tubecolor and tube-diameter. We use a self assembled large collaboration network of Jazz musicians with a straightforward  semantics for the computation of relation strengths for the evaluation of the approach. We also discuss applications of the concept for awareness services in mobile peer to peer social networks, which exhibit a vivid measurable social micro dynamics in time and space.},
  author = {Groh, Georg and Hanstein, Holger and W\"orndl, Wolfgang},
  booktitle = {Proceedings of the 2009 Workshop on Visual Interfaces to the Social and the Semantic Web},
  comment = {a first version appeared at GI Jahrestagung 2008},
  keywords = {type:technique, paradigm:node-link, time:timeline, evaluation:case\_study, application:social, 3d, superimposed_node-link, force-directed_layout},
  series = {VISSW},
  title = {Interactively Visualizing Dynamic Social Networks with {DySoN}},
  url = {http://data.semanticweb.org/workshop/VISSW/2009/paper/main/10/html},
  year = {2009}
}

@article{Hadlak2011Situ,
  abstract = {The analysis of large dynamic networks poses a challenge in many fields, ranging from large bot-nets to social networks. As dynamic networks exhibit different characteristics, e.g., being of sparse or dense structure, or having a continuous or discrete time line, a variety of visualization techniques have been specifically designed to handle these different aspects of network structure and time. This wide range of existing techniques is well justified, as rarely a single visualization is suitable to cover the entire visual analysis. Instead, visual representations are often switched in the course of the exploration of dynamic graphs as the focus of analysis shifts between the temporal and the structural aspects of the data. To support such a switching in a seamless and intuitive manner, we introduce the concept of in situ visualization- a novel strategy that tightly integrates existing visualization techniques for dynamic networks. It does so by allowing the user to interactively select in a base visualization a region for which a different visualization technique is then applied and embedded in the selection made. This permits to change the way a locally selected group of data items, such as nodes or time points, are shown - right in the place where they are positioned, thus supporting the user's overall mental map. Using this approach, a user can switch seamlessly between different visual representations to adapt a region of a base visualization to the specifics of the data within it or to the current analysis focus. This paper presents and discusses the in situ visualization strategy and its implications for dynamic graph visualization. Furthermore, it illustrates its usefulness by employing it for the visual exploration of dynamic networks from two different fields: model versioning and wireless mesh networks.},
  author = {Hadlak, Steffen and Schulz, Hans-J\"org and Schumann, Heidrun},
  doi = {10.1109/TVCG.2011.213},
  issn = {1077-2626},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:node-link, paradigm:matrix, evaluation:case\_study, application:infrastructure, application:software\_engineering, time:timeline, taxonomy, juxtaposed_node-link, integrated_node-link, time:animation},
  number = {12},
  pages = {2334--2343},
  publisher = {IEEE},
  series = {TVCG},
  title = {In Situ Exploration of Large Dynamic Networks},
  volume = {17},
  year = {2011}
}

@inproceedings{Hayashi2013Initial,
  abstract = {Microblogging services generate huge histories that suit animated visualization based on graph drawing, but response speeds are insufficient. This paper proposes an effective updating method for the real-time visualization of time varying data. We propose an initial positioning method by combining Additional Edge Resizing (AER) with Sorted Sequential Barycenter Merging (SSBM). AER resizes edges between existing nodes when new edges are added before updating the visualization. SSBM initially positions multiple new nodes sequentially through priority based on the degree of connections to the existing graph. The proposed method prevents a decrease in readability at data update and achieves fast convergence with high accuracy. Quantitative and qualitative evaluations using the energy function and RMSE are detailed along with some visualization results. A graph drawing tool based on HTML5 is also introduced as an implementation of the proposed method and present some use cases for twitter data.},
  author = {Hayashi, Aki and Matsubayashi, Tatsushi and Hoshide, Takahide and Uchiyama, Tadasu},
  booktitle = {Proceedings of the 17th International Conference on Information Visualisation},
  doi = {10.1109/IV.2013.57},
  keywords = {type:technique, time:animation, paradigm:node-link, online_problem, application:document, evaluation:algorithmic, general-purpose_layout},
  pages = {435-444},
  publisher = {IEEE},
  series = {IV},
  title = {Initial Positioning Method for Online and Real-Time Dynamic Graph Drawing of Time Varying Data},
  year = {2013}
}

@inproceedings{Hindle2007YARN,
  abstract = {A problem that faces the study of software evolution is how to explore the aggregated and cumulative effects of changes that occur within a software system over time. In this paper we describe an approach to modeling, extracting, and animating the architectural evolution of a software system. We have built a prototype tool called YARN (yet another reverse-engineering narrative) that implements our approach; YARN mines the source code changes of the target system, and generates YARN "balls" (animations) that a viewer can unravel (watch). The animation is based on a static layout of the modules connected by animated edges that model the changing dependencies. The edges can be weighted by the number of dependencies or the importance of the change. We demonstrate our approach by visualizing the evolution of PostgreSQL DBMS.},
  author = {Hindle, Abram and Jiang, Zhen Ming and Koleilat, Walid and Godfrey, Michael W and Holt, Richard C},
  booktitle = {4th IEEE International Workshop on Visualizing Software for Understanding and Analysis},
  doi = {10.1109/VISSOF.2007.4290711},
  keywords = {type:application, application:software_engineering, software_evolution, time:animation, fixed_nodes, paradigm:node-link, radial, evaluation:case_study, weighted_graph, offline_problem, directed_graph},
  pages = {129--136},
  publisher = {IEEE},
  series = {VISSOFT},
  title = {{YARN}: Animating software evolution},
  year = {2007}
}

@article{Hlawatsch2014Visual,
  abstract = {We present a visual representation for dynamic, weighted graphs based on the concept of adjacency lists. Two orthogonal axes are used: one for all nodes of the displayed graph, the other for the corresponding links. Colors and labels are employed to identify the nodes. The usage of color allows us to scale the visualization to single pixel level for large graphs. In contrast to other techniques, we employ an asymmetric mapping that results in an aligned and compact representation of links. Our approach is independent of the specific properties of the graph to be visualized, but certain graphs and tasks benefit from the asymmetry. As we show in our results, the strength of our technique is the visualization of dynamic graphs. In particular, sparse graphs benefit from the compact representation. Furthermore, our approach uses visual encoding by size to represent weights and therefore allows easy quantification and comparison. We evaluate our approach in a quantitative user study that confirms the suitability for dynamic and weighted graphs. Finally, we demonstrate our approach for two examples of dynamic graphs.},
  author = {Hlawatsch, Marcel and Burch, Michael and Weiskopf, Daniel},
  doi = {10.1109/TVCG.2014.2322594},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:list, time:timeline, evaluation:user_study, application:social, application:software_engineering, weighted_graph, evaluation:case_study, directed_graph, linear_arrangement},
  pages = {1590--1603},
  publisher = {IEEE},
  series = {TVCG},
  title = {Visual Adjacency Lists for Dynamic Graphs},
  year = {2014}
}

@inproceedings{Hu2012Embedding,
  abstract = {We describe a practical approach for visualizing multiple relationships defined on the same dataset using a geographic map metaphor, where clusters of nodes form countries and neighboring countries correspond to nearby clusters. Our aim is to provide a visualization that allows us to compare two or more such maps (showing an evolving dynamic process, or obtained using different relationships). In the case where we are considering multiple relationships, e.g., different similarity metrics, we also provide an interactive tool to visually explore the effect of combining two or more such relationships. Our method ensures good readability and mental map preservation, based on dynamic node placement with node stability, dynamic clustering with cluster stability, and dynamic coloring with color stability.},
  author = {Hu, Yifan and Kobourov, Stephen G and Veeramoni, Sankar},
  booktitle = {Proceedings of the 2012 IEEE Pacific Visualization Symposium},
  doi = {10.1109/PacificVis.2012.6183571},
  isbn = {978-1-4673-0863-2},
  keywords = {map\_metaphor, type:technique, time:animation, omitted_links, clustering, paradigm:node-link, mental_map, evaluation:case_study, application:generic, special-purpose_layout, compound_graph},
  pages = {33--40},
  publisher = {IEEE Computer Society},
  series = {PacificVis},
  title = {Embedding, Clustering and Coloring for Dynamic Maps},
  year = {2012}
}

@article{Huang1998Online,
  abstract = {On-line graph drawing deals with huge graphs which are partially unknown. At any time, a tiny part of the graph is displayed on the screen. Examples include web graphs and graphs of links in distributed file systems. This paper discusses issues arising in the presentation of such graphs. The paper describes a system for dealing with web graphs using on-line graph drawing.},
  author = {Huang, Mao Lin and Eades, Peter and Wang, Junhu},
  doi = {10.1006/jvlc.1998.0094},
  journal = {Journal of Visual Languages \& Computing},
  keywords = {paradigm:node-link, type:technique, time:animation, online_problem, mental_map, force-directed_layout, evaluation:case_study, application:document, transition_problem, general-purpose_layout},
  number = {6},
  pages = {623--645},
  publisher = {Elsevier},
  title = {On-line animated visualization of huge graphs using a modified spring algorithm},
  volume = {9},
  year = {1998}
}

@article{Hurter2013Bundled,
  abstract = {Depicting change captured by dynamic graphs and temporal paths, or trails, is hard. We present two techniques for simplified visualization of such datasets using edge bundles. The first technique uses an efficient image-based bundling method to create smoothly changing bundles from streaming graphs. The second technique adds edge-correspondence data atop of any static bundling algorithm, and is best suited for graph sequences. We show how these techniques can produce simplified visualizations of streaming and sequence graphs. Next, we show how several temporal attributes can be added atop of our dynamic graphs. We illustrate our techniques with datasets from aircraft monitoring, software engineering, and eye-tracking of static and dynamic scenes.},
  author = {Hurter, Christophe and Ersoy, Ozan and Fabrikant, Sara I and Klein, Tijmen and Telea, Alexandru},
  comment = {extended version of a PacificVis 2013 paper},
  doi = {10.1109/TVCG.2013.246},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:node-link, edge\_bundling, time:animation, evaluation:case\_study, application:eye\_tracking, application:software\_engineering, application:infrastructure, fixed_nodes, transition_problem, general-purpose_layout},
  publisher = {IEEE},
  series = {TVCG},
  title = {Bundled Visualization of Dynamic Graph and Trail Data},
  year = {2013}
}

@inproceedings{Itoh2010Interactive,
  abstract = {We propose an interactive framework for the 3D visualization of the time-series of Web graphs. The purpose of our framework is to enable users to examine the evolution of Web graphs by comparing multiple graphs that have different timings and topics. To achieve this, we provide TimeSlices that are 2D planes to visualize Web graphs in a 3D environment. Users can interactively add new TimeSlices along the timeline, and they can manipulate them to animate Web graphs. Visualized Web graphs on TimeSlices are snapshots of different timings. Moreover, we provide mechanisms to generate and manipulate overlay views and parallel views in the 3D environment to enable Web graphs to be compared. Users can seamlessly change these viewing modes. Our system can also visualize two Web graphs created from different keywords to display the evolutional correlation between them. This system enables us to observe structural and temporal changes in multiple Web graphs such as shifts in influential blogs or power shifts in the diffusion of blogs between topics.},
  author = {Itoh, Masahiko and Toyoda, Masashi and Kitsuregawa, Masaru},
  booktitle = {Proceedings of the 14th International Conference on Information Visualisation},
  doi = {10.1109/IV.2010.18},
  keywords = {3d, type:technique, paradigm:node-link, time:timeline, evaluation:none, application:document, superimposed_node-link},
  pages = {54--60},
  publisher = {IEEE},
  series = {IV},
  title = {An Interactive Visualization Framework for Time-Series of Web Graphs in a {3D} Environment},
  year = {2010}
}

@inproceedings{Itoh2012Analysis,
  abstract = {Social media such as blogs and microblogs enable users to easily and rapidly publish information on their personal activities and interests. They are considered to provide valuable information from the viewpoints of sociology, linguistics, and marketing. This paper proposes a novel system for analyzing temporal changes in the activities and interests of bloggers through a 3D visualization of phrase dependency structures in sentences. We first extract events that represent bloggers' activities and interests through analyzing the phrase dependencies of sentences in a blog archive. We roughly categorize the retrieved events according to the thematic roles (such as the experiencer, agent, and location) of the noun within the events, and then store them in a dependency database so that we can retrieve events that involve a given topic. Second, we present a 3D visualization framework for exploring temporal changes in events related to a topic. Our framework enables users to find events about a topic that appear within a specific timing, and drill down details of the events. It also enables users to compare events with different timings and/or on multiple topics. Moreover, it allows them to observe an overview of temporal changes in sets of events, and long-term changes in the frequency of events to assist users in finding trends. We implement the proposed system on our own five-year blog archive that focused on Japanese, and we report the usefulness of our system by using various examples.},
  author = {Itoh, Masahiko and Yoshinaga, Naoki and Toyoda, Masashi and Kitsuregawa, Masaru},
  booktitle = {Proceeding of the 2012 IEEE Pacific Visualization Symposium},
  doi = {10.1109/PacificVis.2012.6183574},
  keywords = {type:application, paradigm:node-link, time:timeline, evaluation:case\_study, application:social, social_media},
  organization = {IEEE},
  pages = {57--64},
  series = {PacificVis},
  title = {Analysis and Visualization of Temporal Changes in Bloggers' Activities and Interests},
  year = {2012}
}

@inproceedings{Itoh2012Visualization,
  ISSN = {1550-6037},
  abstract = {A huge number of historical documents that have been accumulated for a long time are currently being digitized. However, it is difficult for us to analyze and obtain insight into the past from such documents. This paper proposes an interactive visualization system to extract networks of historical figures from historical data and to show time-varying changes in their relationships. It enables users to explore changes in the structure of the network interactively. Moreover, it extracts characteristics of each relationship, such as hostile or friendly relations, and visualizes them on the network. It enables us to understand changes in past society better by exploring changes in relationships between people.},
  author = {Itoh, Masahiko and Akaishi, Mina},
  booktitle = {Proceedings of the 16th International Conference on Information Visualisation},
  doi = {10.1109/IV.2012.55},
  keywords = {application:social, paradigm:node-link, time:timeline, evaluation:case\_study, type:application, social_media},
  pages = {283-290},
  publisher = {IEEE},
  series = {IV},
  title = {Visualizing for Changes in Relationships between Historical Figures in Chronicles},
  year = {2012}
}

@article{John2011Constructing,
  abstract = {The π-calculus, in particular its stochastic version the stochastic π-calculus, is a common modeling formalism to concisely describe the chemical reactions occurring in biochemical systems. However, it remains largely unexplored how to transform a biochemical model expressed in the stochastic π-calculus back into a set of meaningful reactions. To this end, we present a two step approach of first translating model states to reaction sets and then visualizing sequences of reaction sets, which are obtained from state trajectories, in terms of reaction networks. Our translation from model states to reaction sets is formally defined and shown to be correct, in the sense that it reflects the states and transitions as they are derived from the continuous time Markov chain-semantics of the stochastic π-calculus. Our visualization concept combines high level measures of network complexity with interactive, table-based network visualizations. It directly reflects the structures introduced in the first step and allows modelers to explore the resulting simulation traces by providing both: an overview of a network’s evolution and a detail inspection on demand.},
  author = {John, Mathias and Schulz, Hans-J\"org and Schumann, Heidrun and Uhrmacher, Adelinde M and Unger, Andrea},
  doi = {10.1007/s00165-011-0209-0},
  journal = {Formal Aspects of Computing},
  keywords = {type:application, paradigm:node-link, time:timeline, application:biology, evaluation:case\_study},
  number = {5},
  pages = {723-742},
  publisher = {Springer},
  title = {Constructing and Visualizing Chemical Reaction Networks From Pi-Calculus Models},
  volume = {25},
  year = {2012}
}

@article{Kang2007Visual,
  abstract = {C-Group is a tool for analyzing dynamic group membership in temporal social networks over time. Unlike most network visualization tools, which show the group structure within an entire network, or the group membership for a single actor, C-Group allows users to focus their analysis on a pair of individuals. While C

repository: cybernetics/Keshif

repo_name: cybernetics/Keshif