Show last authors
1 Übersicht über Graphalgorithmen:
2
3 [[http:~~/~~/vcg.informatik.uni-rostock.de/~~~~hs162/treeposter/poster.html>>url:http://vcg.informatik.uni-rostock.de/~~hs162/treeposter/poster.html||shape="rect"]]
4
5 Erste Paper:
6
7 (((
8 T. Dwyer and K. Marriott, "Exploration of networks using overview+ detail with constraint-based cooperative layout"
9 )))
10
11 (((
12 (((
13 Nathalie Henry, Jean-Daniel Fekete, and Michael J. McGuffin. 2007. NodeTrix: a Hybrid Visualization of Social Networks.
14 )))
15 )))
16
17 (((
18 T. Dwyer, K. Marriott, and P. Sbarski, "Hi-tree layout using quadratic programming"
19 )))
20
21 (((
22 V. Yoghourdjian, T. Dwyer, G. Gange, S. Kieffer, K. Klein, and K. Marriott, "High-Quality Ultra-Compact Grid Layout of Grouped Networks"
23 )))
24
25 (((
26 Im Zusammenhang mit einem kräfte-basierten Layouter:
27 )))
28
29 (((
30 Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander Holroyd, "Node Overlap Removal by Growing a Tree" [[http:~~/~~/arxiv.org/format/1608.02653>>url:http://arxiv.org/format/1608.02653||shape="rect"]]
31 )))
32
33 Hierrchical Edge Bundles: Visualizaiton of Adjacency Relations in Hierarchical Data
34
35 Radial
36
37 [[http:~~/~~/vcg.informatik.uni-rostock.de/~~~~hs162/treeposter/scans/Eades1992.pdf>>url:http://vcg.informatik.uni-rostock.de/~~hs162/treeposter/scans/Eades1992.pdf||shape="rect"]]