@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{Hays:2007,
  abstract = {What can you do with a million images? In this paper we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. The algorithm patches up holes in images by finding similar image regions in the database that are not only seamless but also semantically valid. Our chief insight is that while the space of images is effectively infinite, the space of semantically differentiable scenes is actually not that large. For many image completion tasks we are able to find similar scenes which contain image fragments that will convincingly complete the image. Our algorithm is entirely data-driven, requiring no annotations or labelling by the user. Unlike existing image completion methods, our algorithm can generate a diverse set of image completions and we allow users to select among them. We demonstrate the superiority of our algorithm over existing image completion approaches.},
  author = {Hays, James and Efros, Alexei A},
  interhash = {14b4c5d079014159245fbeb4691cd3e4},
  intrahash = {2ecc9437051abcfb07bb54201894c08c},
  journal = {ACM Transactions on Graphics (SIGGRAPH 2007)},
  number = 3,
  title = {Scene Completion Using Millions of Photographs},
  url = {http://graphics.cs.cmu.edu/projects/scene-completion/},
  volume = 26,
  year = 2007
}