 | 2012 |
| 23 |  | Daniel Archambault,
Helen C. Purchase:
The mental map and memorability in dynamic graphs.
PacificVis 2012: 89-96 |
| 2011 |
| 22 |  | Anthony Brew,
Derek Greene,
Daniel Archambault,
Padraig Cunningham:
Deriving Insights from National Happiness Indices.
ICDM Workshops 2011: 53-60 |
| 21 |  | Karen Wade,
Derek Greene,
Conrad Lee,
Daniel Archambault,
Pádraig Cunningham:
Identifying Representative Textual Sources in Blog Networks.
ICWSM 2011 |
| 20 |  | Daniel Archambault,
Derek Greene,
Pádraig Cunningham,
Neil J. Hurley:
ThemeCrowds: multiresolution summaries of twitter usage.
SMUC 2011: 77-84 |
| 19 |  | Paolo Simonetto,
Daniel Archambault,
David Auber,
Romain Bourqui:
ImPrEd: An Improved Force-Directed Algorithm that Prevents Nodes from Crossing Edges.
Comput. Graph. Forum 30(3): 1071-1080 (2011) |
| 18 |  | Daniel Archambault,
Tamara Munzner,
David Auber:
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths.
IEEE Trans. Vis. Comput. Graph. 17(3): 276-289 (2011) |
| 17 |  | Daniel Archambault,
Helen C. Purchase,
Bruno Pinaud:
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs.
IEEE Trans. Vis. Comput. Graph. 17(4): 539-552 (2011) |
| 2010 |
| 16 |  | David Auber,
Patrick Mary,
Morgan Mathiaut,
Jonathan Dubois,
Antoine Lambert,
Daniel Archambault,
Romain Bourqui,
Bruno Pinaud,
Maylis Delest,
Guy Melançon:
Tulip : a scalable graph visualization framework.
EGC 2010: 623-624 |
| 15 |  | Daniel Archambault,
Helen C. Purchase,
Bruno Pinaud:
Difference Map Readability for Dynamic Graphs.
Graph Drawing 2010: 50-61 |
| 14 |  | Pierre-Yves Koenig,
Faraz Zaidi,
Daniel Archambault:
Interactive searching and visualization of patterns in attributed graphs.
Graphics Interface 2010: 113-120 |
| 13 |  | Faraz Zaidi,
Daniel Archambault,
Guy Melançon:
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths.
ICDM 2010: 42-56 |
| 12 |  | Daniel Archambault,
Helen C. Purchase,
Bruno Pinaud:
The Readability of Path-Preserving Clusterings of Graphs.
Comput. Graph. Forum 29(3): 1173-1182 (2010) |
| 11 |  | Donald Derrick,
Daniel Archambault:
TreeForm: Explaining and exploring grammar through syntax trees.
LLC 25(1): 53-66 (2010) |
| 2009 |
| 10 |  | Daniel Archambault:
Structural differences between two graphs through hierarchies.
Graphics Interface 2009: 87-94 |
| 9 |  | Paolo Simonetto,
Pierre-Yves Koenig,
Faraz Zaidi,
Daniel Archambault,
Frédéric Gilbert,
Trung-Tien Phan-Quang,
Morgan Mathiaut,
Antoine Lambert,
Jonathan Dubois,
Ronan Sicre,
Mathieu Brulin,
Rémy Vieux,
Guy Melançon:
Solving the traffic and flitter challenges with tulip.
IEEE VAST 2009: 247-248 |
| 8 |  | Daniel Archambault,
Tamara Munzner,
David Auber:
TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs.
PacificVis 2009: 113-120 |
| 7 |  | Paolo Simonetto,
David Auber,
Daniel Archambault:
Fully Automatic Visualisation of Overlapping Sets.
Comput. Graph. Forum 28(3): 967-974 (2009) |
| 2008 |
| 6 |  | Daniel Archambault,
Tamara Munzner,
David Auber:
GrouseFlocks: Steerable Exploration of Graph Hierarchy Space.
IEEE Trans. Vis. Comput. Graph. 14(4): 900-913 (2008) |
| 2007 |
| 5 |  | Daniel Archambault,
Tamara Munzner,
David Auber:
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration.
EuroVis 2007: 67-74 |
| 4 |  | Daniel Archambault,
Tamara Munzner,
David Auber:
TopoLayout: Multilevel Graph Layout by Topological Features.
IEEE Trans. Vis. Comput. Graph. 13(2): 305-317 (2007) |
| 2006 |
| 3 |  | Daniel Archambault,
Tamara Munzner,
David Auber:
Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components.
IEEE Trans. Vis. Comput. Graph. 12(5): 813-820 (2006) |
| 2005 |
| 2 |  | Daniel Archambault,
William S. Evans,
David G. Kirkpatrick:
Computing the Set of all the Distant Horizons of a Terrain.
Int. J. Comput. Geometry Appl. 15(6): 547-564 (2005) |
| 2004 |
| 1 |  | William S. Evans,
Daniel Archambault,
David G. Kirkpatrick:
Computing the set of all distant horizons of a terrain.
CCCG 2004: 76-79 |