<
From version < 24.1 >
edited by cds
on 2018/09/10 08:48
To version < 13.1 >
edited by cds
on 2018/07/17 14:24
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -43,64 +43,43 @@
43 43  
44 44  {{expand title="Klick mich, um Dinge zu sehen"}}
45 45  (% class="bodytext" style="text-align: left;" %)
46 -Zur Verfügung stehen die folgenden Paper aus verschiedenen Themenbereichen. Die mit eine markierten Paper sind diejenigen, die wir wichtiger finden als die ohne Stern. Weil sie einen Stern haben halt.
46 +Zur Verfügung stehen die folgenden Paper verschiedenen Themenbereichen. Die Paper werden //first-come-first-serve// vergeben. Ist ein Paper schon an jemanden vergeben, vermerken wir das hier. Viele der Links werden nur aus dem Netz der Uni Kiel heraus funktionieren. Bei Problemen einfach Bescheid sagen.
47 47  
48 -(% class="bodytext" style="text-align: left;" %)
49 -Die Paper werden //first-come-first-serve// vergeben. Ist ein Paper schon an jemanden vergeben, vermerken wir das hier. Viele der Links werden nur aus dem Netz der Uni Kiel heraus funktionieren. Bei Problemen einfach Bescheid sagen.
50 -
51 51  {{note}}
52 -Einige Paper sind nicht frei im Netz verfügbar. Für diese Paper verlinken wir auf eine interne Seite in unserem Wiki. Um dazu Zugang zu bekommen, sst ihr euch mit euren IfI-Account-Daten einloggen. Bei Problemen einfach cds Bescheid geben.
49 +Die Paperliste befindet sich aktuell noch im Aufbau, also verlasst euch besser noch nicht darauf.
53 53  {{/note}}
54 54  
55 -== Aesthetics ==
52 +**Diagrams 2012**
56 56  
57 -(% style="color: rgb(165,173,186);" %)Purchase, Freeman, and Hamer. "An exploration of visual complexity." In //International Conference on Theory and Application of Diagrams//, pp. 200-213. Springer, 2012.(%%) **(vergeben)** **[[PDF>>url:https://www.researchgate.net/profile/Helen_Purchase/publication/262355519_An_Exploration_of_Visual_Complexity/links/5770215308ae621947487b24.pdf||shape="rect"]]**
54 ++ Wybrow, Marriott, Stuckey. Orthogonal hyperedge routing. Diagrams 2012. (Ideal r Abschlussarbeit)
58 58  
59 - Lloyd, Rodgers, and Roberts. "Metro map colour-coding: effect on usability in route tracing." In International conference on Theory and Application of Diagrams, pp. 411-428. Springer, 2018. **[[PDF>>url:https://www.researchgate.net/profile/Peter_Lloyd14/publication/324279056_Metro_Map_Colour-Coding_Effect_on_Usability_in_Route_Tracing/links/5ac94b090f7e9bcd519751ae/Metro-Map-Colour-Coding-Effect-on-Usability-in-Route-Tracing.pdf||shape="rect"]]**
56 ++ Bottoni, Costagliola, Fish. Euler diagram encodings. Diagrams 2012.
60 60  
61 - Kobourov, Pupyrev, and Saket. "Are crossings important for drawing large graphs?" In //International Symposium on Graph Drawing//, pp. 234-245. Springer, 2014. **[[PDF>>url:https://www2.cs.arizona.edu/~~kobourov/crossings.pdf||shape="rect"]]**
58 ++ Burns, Carberry, Elzer, and Chester. Automatically recognizing intended messages in grouped bar charts. Diagrams 2012.
62 62  
63 -(% style="color: rgb(165,173,186);" %)Ware, Colin, Purchase, Colpoys, and McGill. "Cognitive measurements of graph aesthetics." //Information visualization// 1, no. 2 (2002): 103-110.(%%) **(vergeben)** **[[PDF>>url:http://journals.sagepub.com/doi/pdf/10.1057/palgrave.ivs.9500013||shape="rect"]]**
60 ++ Purchase, Freeman, Hamer. An exploration of visual complexity. Diagrams 2012.
64 64  
65 -== Perception and Usage ==
62 +**Diagrams 2014**
66 66  
67 - (% style="color: rgb(165,173,186);" %)Petre, Marian. "“No shit” or “Oh, shit!”: responses to observations on the use of UML in professional practice." //Software & Systems Modeling// 13, no. 4 (2014): 1225-1235.(%%) **(vergeben)** **[[PDF>>url:https://link.springer.com/content/pdf/10.1007%2Fs10270-014-0430-4.pdf||shape="rect"]]**
64 ++ Chapman, Stapleton, Rodgers, Micallef, Blake. Visualizing sets: an empirical comparison of diagram types. Diagrams 2014.
68 68  
69 -Burns, Carberry, Elzer, and Chester. "Automatically recognizing intended messages in grouped bar charts." In //International Conference on Theory and Application of Diagrams//, pp. 8-22. Springer, 2012. **[[PDF>>url:https://www.researchgate.net/profile/Stephanie_Schwartz9/publication/262169666_Automatically_Recognizing_Intended_Messages_in_Grouped_Bar_Charts/links/550882ff0cf26ff55f82ccee.pdf||shape="rect"]]**
66 +**Diagrams 2018**
70 70  
71 -== Browsing ==
68 ++ Baimagambetov, Howse, Stapleton, Delaney. Generating effective Euler diagrams. Diagrams 2018.
72 72  
73 -(% style="color: rgb(165,173,186);" %)Nachmanson, Lev, Prutkin, Lee, Riche, Holroyd, and Chen. "Graphmaps: Browsing large graphs as interactive maps." In //International Symposium on Graph Drawing and Network Visualization//, pp. 3-15. Springer, 2015.(%%) **(vergeben)** [[**PDF**>>url:https://arxiv.org/pdf/1506.06745||shape="rect"]]
70 ++ Erwig, Smeltzer. Variational pictures. Diagrams 2018.
74 74  
75 -(% style="color: rgb(165,173,186);" %)Vaaraniemi, Goerlich, and in der Au. "Intelligent Prioritization and Filtering of Labels in Navigation Maps." (2014).(%%) **(vergeben)** [[**PDF**>>url:https://otik.uk.zcu.cz/bitstream/11025/11895/1/Varaaniemi.pdf||shape="rect"]]
72 ++ Lloyd, Rodgers, Roberts. Metro map colour-coding: effect on usability in route tracing. Diagrams 2018.
76 76  
77 -== Graph Drawing ==
74 +**GD 2014**
78 78  
79 - (% style="color: rgb(165,173,186);" %)Wybrow, Marriott, and Stuckey. "Orthogonal hyperedge routing." In //International Conference on Theory and Application of Diagrams//, pp. 51-64. Springer, 2012.(%%) **(vergeben)** [[**PDF**>>url:http://ialab.it.monash.edu/~~mwybrow/papers/wybrow-diagrams-2012.pdf||shape="rect"]] (Ideal für Leute, die gerne eine Abschlussarbeit zu einem Layoutthema schreiben möchten.)
76 ++ Kobourov, Pupyrev, Saket. Are crossings important for drawing large graphs? GD 2014.
80 80  
81 -(% style="color: rgb(165,173,186);" %)Aulbach, Fink, Schuhmann, and Wolff. "Drawing graphs within restricted area." In //International Symposium on Graph Drawing//, pp. 367-379. Springer, 2014.(%%) **(vergeben)** [[**PDF**>>url:https://arxiv.org/pdf/1409.0499||shape="rect"]]
78 ++ Fink, Wolff, Schuhmann, Aulbach. Drawing graphs with restricted area. GD 2014.
82 82  
83 - Chevalier and Safro. "Comparison of coarsening schemes for multilevel graph partitioning." In //International Conference on Learning and Intelligent Optimization//, pp. 191-205. Springer, 2009. [[**PDF**>>url:http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.531.2924&rep=rep1&type=pdf||shape="rect"]]
80 +**GD 2015**
84 84  
85 -Athenstädt, Hartmann, and Nöllenburg. "Simultaneous embeddability of two partitions." In //International Symposium on Graph Drawing//, pp. 64-75. Springer, 2014. [[**PDF**>>url:https://arxiv.org/pdf/1408.6019||shape="rect"]]
86 -
87 -(% style="color: rgb(165,173,186);" %)Walshaw. "A multilevel algorithm for force-directed graph drawing." In //International Symposium on Graph Drawing//, pp. 171-182. Springer, 2000.(%%) **(vergeben)** [[**PDF**>>url:https://link.springer.com/content/pdf/10.1007/3-540-44541-2_17.pdf||shape="rect"]]
88 -
89 -== Euler Diagrams ==
90 -
91 -Bottoni, Costagliola, and Fish. "Euler diagram encodings." In //International Conference on Theory and Application of Diagrams//, pp. 148-162. Springer, 2012. [[**PDF**>>url:https://s3.amazonaws.com/academia.edu.documents/45649653/Euler_diagram_encodings20160515-26490-1rvpanx.pdf?AWSAccessKeyId=AKIAIWOWYYGZ2Y53UL3A&Expires=1532097323&Signature=0mp3Nn2fRT4GGNbTTcWS%2F3gWwR8%3D&response-content-disposition=inline%3B%20filename%3DEuler_Diagram_Encodings.pdf||shape="rect"]]
92 -
93 -(% style="color: rgb(165,173,186);" %)Baimagambetov, Howse, Stapleton, and Delaney. "Generating Effective Euler Diagrams." In //International Conference on Theory and Application of Diagrams//, pp. 39-54. Springer, 2018.(%%) **(vergeben)** **[[Seite mit PDF>>doc:Eingeschränkt sichtbare Paper]]**
94 -
95 -Chapman, Stapleton, Rodgers, Micallef, and Blake. "Visualizing sets: an empirical comparison of diagram types." In //International Conference on Theory and Application of Diagrams//, pp. 146-160. Springer, 2014. [[**PDF**>>url:http://eprints.brighton.ac.uk/13703/1/diagrams2014%20Visualizing%20DataREVISED.pdf||shape="rect"]]
96 -
97 -Mutton, Rodgers, and Flower. "Drawing graphs in Euler diagrams." In //International Conference on Theory and Application of Diagrams//, pp. 66-81. Springer, 2004. [[**PDF**>>url:https://core.ac.uk/download/pdf/64473.pdf||shape="rect"]]
98 -
99 -== Other Types of Diagrams ==
100 -
101 -Erwig and Smeltzer. "Variational Pictures." In //International Conference on Theory and Application of Diagrams//, pp. 55-70. Springer, 2018. **[[Seite mit PDF>>doc:Eingeschränkt sichtbare Paper]]**
102 -
103 -(% style="color: rgb(165,173,186);" %)Grossman and Harel. "On the algorithmics of higraphs." Weizmann Institute of Science. Department of Applied Mathematics and Computer Science, 1997.(%%) **(vergeben)** **[[Seite mit PDF>>doc:Eingeschränkt sichtbare Paper]]**
82 ++ Nachmanson, Prutkin, Lee, Riche, Holroyd, Chen. GraphMaps: browsing large graphs as interactive maps. GD 2015.
104 104  {{/expand}}
105 105  
106 106  = Ablauf =
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -47185945
1 +45318239
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/47185945/WS18/19 (Layout)
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/45318239/WS18/19 (Layout)