@article{gansner2000graph,
  abstract = {We describe a package of practical tools and libraries for manipulating graphs and their drawings. Our design, which aimed at facilitating the combination of the package components with other tools, includes stream and event interfaces for graph operations, high-quality static and dynamic layout algorithms, and the ability to handle sizable graphs. We conclude with a description of the applications of this package to a variety of software engineering tools.},
  acmid = {358697},
  address = {New York, NY, USA},
  author = {Gansner, Emden R. and North, Stephen C.},
  doi = {10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.3.CO;2-E},
  interhash = {fdbcae2c4f9f976058d82d409ff9b5d7},
  intrahash = {4d0cb8db8cf90029b781872d0dc84624},
  issn = {0038-0644},
  issue = {11},
  journal = {Software Practice \& Experience},
  month = sep,
  number = 11,
  numpages = {31},
  pages = {1203--1233},
  publisher = {John Wiley \& Sons, Inc.},
  title = {An open graph visualization system and its applications to software engineering},
  url = {http://dl.acm.org/citation.cfm?id=358668.358697},
  volume = 30,
  year = 2000
}

@article{gansner2009drawing,
  abstract = {Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through  dimensionality reduction techniques. However, these traditional methods often do not capture well the underlying structural information, clustering, and neighborhoods. In this paper, we describe GMap: a practical tool for visualizing relational data with geographic-like maps. We illustrate the effectiveness of this approach with examples from several domains All the maps referenced in this paper can be found in http://www.research.att.com/~yifanhu/GMap },
  author = {Gansner, Emden R. and Hu, Yifan and Kobourov, Stephen G.},
  interhash = {881280a1a2aa34d84322d3781f62ca90},
  intrahash = {3f9e522da9443c0a07c39009918a4a77},
  journal = {cs.CG},
  month = jul,
  title = {{GMap}: Drawing Graphs as Maps},
  url = {http://arxiv.org/abs/0907.2585},
  volume = {arXiv:0907.2585v1},
  year = 2009
}

@article{battista1994algorithms,
  abstract = {Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we
present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of
graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliography constitutes an attempt to encompass both theoretical and application oriented papers from disparate
areas.},
  address = {Amsterdam, The Netherlands},
  author = {Battista, Giuseppe Di and Eades, Peter and Tamassia, Roberto and Tollis, Ioannis G.},
  doi = {10.1016/0925-7721(94)00014-X},
  interhash = {c8010ae4e2e0aedf21607631ac79bed4},
  intrahash = {a62ded9eee008659ffa33d294b8de870},
  issn = {0925-7721},
  journal = {Computational Geometry: Theory and Applications},
  number = 5,
  pages = {235--282},
  publisher = {Elsevier Science Publishers B. V.},
  title = {Algorithms for drawing graphs: an annotated bibliography},
  url = {http://portal.acm.org/citation.cfm?id=195598},
  volume = 4,
  year = 1994
}

@article{kaser2007tagcloud,
  abstract = {Tag clouds provide an aggregate of tag-usage statistics. They are typically sent as in-line HTML to browsers. However, display mechanisms suited for ordinary text are not ideal for tags, because font sizes may vary widely on a line. As well, the typical layout does not account for relationships that may be known between tags. This paper presents models and algorithms to improve the display of tag clouds that con- sist of in-line HTML, as well as algorithms that use nested tables to achieve a more general 2-dimensional layout in which tag relationships are considered. The first algorithms leverage prior work in typesetting and rectangle packing, whereas the second group of algorithms leverage prior work in Electronic Design Automation. Experiments show our algorithms can be efficiently implemented and perform well. },
  author = {Kaser, Owen and Lemire, Daniel},
  date = {2008-01-02},
  interhash = {cb6ed5e3340cf684ec55299adc65e1a9},
  intrahash = {56270d1311c066a3852bea23eeb8d484},
  journal = {CoRR},
  note = {informal publication},
  title = {Tag-Cloud Drawing: Algorithms for Cloud Visualization},
  url = {http://arxiv.org/abs/cs/0703109},
  volume = {abs/cs/0703109},
  year = 2007
}