default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmden R. Gansner
- > Home > Persons > Emden R. Gansner
Publications
- 2014
[p2]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
Viewing Abstract Data as Maps. Handbook of Human Centric Visualization 2014: 63-89- 2013
- [j16]Emden R. Gansner, Yifan Hu, Stephen C. North:
Interactive Visualization of Streaming Text Data with Dynamic Maps. J. Graph Algorithms Appl. 17(4): 515-540 (2013) - [j15]Emden R. Gansner, Yifan Hu, Stephen C. North:
A Maxent-Stress Model for Graph Layout. IEEE Trans. Vis. Comput. Graph. 19(6): 927-940 (2013) - [c32]Emden R. Gansner, Yifan Hu, Shankar Krishnan:
COAST: A Convex Optimization Approach to Stress-Based Embedding. GD 2013: 268-279 - [i8]Emden R. Gansner, Yifan Hu, Shankar Krishnan:
COAST: A Convex Optimization Approach to Stress-Based Embedding. CoRR abs/1308.5218 (2013) - 2012
- [j14]Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov
:
Optimal Polygonal Representation of Planar Graphs. Algorithmica 63(3): 672-691 (2012) - [c31]Emden R. Gansner, Yifan Hu, Stephen C. North:
A maxent-stress model for graph layout. PacificVis 2012: 73-80 - [c30]Emden R. Gansner, Yifan Hu, Stephen C. North:
Visualizing Streaming Text Data with Dynamic Graphs and Maps. GD 2012: 439-450 - [i7]Emden R. Gansner, Yifan Hu, Stephen C. North:
Visualizing Streaming Text Data with Dynamic Maps. CoRR abs/1206.3980 (2012) - 2011
- [c29]Emden R. Gansner, Yifan Hu, Stephen C. North, Carlos Eduardo Scheidegger:
Multilevel agglomerative edge bundling for visualizing large graphs. PacificVis 2011: 187-194 - [i6]Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov:
Optimal Polygonal Representation of Planar Graphs. CoRR abs/1104.1482 (2011) - 2010
- [j12]Yifan Hu, Emden R. Gansner, Stephen G. Kobourov:
Visualizing Graphs and Clusters as Maps. IEEE Computer Graphics and Applications 30(6): 54-66 (2010) - [j11]Emden R. Gansner, Yifan Hu:
Efficient, Proximity-Preserving Node Overlap Removal. J. Graph Algorithms Appl. 14(1): 53-74 (2010) - [c26]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
GMap: Visualizing graphs and clusters as maps. PacificVis 2010: 201-208 - [c25]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
On Touching Triangle Graphs. GD 2010: 250-261 - [c24]Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov:
Optimal Polygonal Representation of Planar Graphs. LATIN 2010: 417-432 - [i4]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
On Touching Triangle Graphs. CoRR abs/1001.2862 (2010) - 2009
- [c23]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
GMap: Drawing Graphs as Maps. GD 2009: 405-407 - [c22]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov, Chris Volinsky:
Putting recommendations on the map: visualizing clusters and relations. RecSys 2009: 345-348 - [i3]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov, Chris Volinsky:
Putting Recommendations on the Map -- Visualizing Clusters and Relations. CoRR abs/0906.5286 (2009) - [i2]Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
GMap: Drawing Graphs as Maps. CoRR abs/0907.2585 (2009) - 2008
- [c21]Emden R. Gansner, Yifan Hu:
Efficient Node Overlap Removal Using a Proximity Stress Model. GD 2008: 206-217
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
