<
From version < 16.1 >
edited by cds
on 2018/07/18 08:39
To version < 11.1 >
edited by cds
on 2018/07/04 14:42
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -49,55 +49,43 @@
49 49  Die Paperliste befindet sich aktuell noch im Aufbau, also verlasst euch besser noch nicht darauf.
50 50  {{/note}}
51 51  
52 -== Aesthetics ==
52 +Wybrow, Marriott, Stuckey. Orthogonal hyperedge routing. Diagrams 2012.
53 53  
54 -Purchase, Freeman, and Hamer. "An exploration of visual complexity." In //International Conference on Theory and Application of Diagrams//, pp. 200-213. Springer, 2012. **[[PDF>>url:https://www.researchgate.net/profile/Helen_Purchase/publication/262355519_An_Exploration_of_Visual_Complexity/links/5770215308ae621947487b24.pdf||shape="rect"]]**
54 +Bottoni, Costagliola, Fish. Euler diagram encodings. Diagrams 2012.
55 55  
56 - 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 +Baimagambetov, Howse, Stapleton, Delaney. Generating effective Euler diagrams. Diagrams 2018.
57 57  
58 - 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 +Erwig, Smeltzer. Variational pictures. Diagrams 2018.
59 59  
60 -Ware, Colin, Purchase, Colpoys, and McGill. "Cognitive measurements of graph aesthetics." //Information visualization// 1, no. 2 (2002): 103-110. **[[PDF>>url:http://journals.sagepub.com/doi/pdf/10.1057/palgrave.ivs.9500013||shape="rect"]]**
60 +Burns, Carberry, Elzer, and Chester. Automatically recognizing intended messages in grouped bar charts. Diagrams 2012.
61 61  
62 -== Perception and Usage ==
62 +Purchase, Freeman, Hamer. An exploration of visual complexity. Diagrams 2012.
63 63  
64 - 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. **[[PDF>>url:https://link.springer.com/content/pdf/10.1007%2Fs10270-014-0430-4.pdf||shape="rect"]]**
64 +Alqadah, Stapleton, Howse, Chapman. Evaluation the impact of clutter in Euler diagrams. Diagrams 2014.
65 65  
66 -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 +Chapman, Stapleton, Rodgers, Micallef, Blake. Visualizing sets: an empirical comparison of diagram types. Diagrams 2014.
67 67  
68 -== Browsing ==
68 +Fox, de Vries, Lima, Loker. Exploring representations of student time-use. Diagrams 2016.
69 69  
70 -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. [[**PDF**>>url:https://arxiv.org/pdf/1506.06745||shape="rect"]]
70 +Kriglstein, Haider, Wallner, Pohl. Who, where, when and with whom? Evaluation of group meeting visualization. Diagrams 2016.
71 71  
72 -Vaaraniemi, Goerlich, and in der Au. "Intelligent Prioritization and Filtering of Labels in Navigation Maps." (2014). [[**PDF**>>url:https://otik.uk.zcu.cz/bitstream/11025/11895/1/Varaaniemi.pdf||shape="rect"]]
72 +Tversky, Gao, Corter, Tanaka, Nickerson. People, place, and time: inferences from diagrams. Diagrams 2016.
73 73  
74 -== Graph Drawing ==
74 +Lloyd, Rodgers, Roberts. Matro map colour-coding: effect on usability in route tracing. Diagrams 2018.
75 75  
76 - Wybrow, Marriott, and Stuckey. "Orthogonal hyperedge routing." In //International Conference on Theory and Application of Diagrams//, pp. 51-64. Springer, 2012. [[**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 +Durugbo. Modelling information flow: improving diagrammatic visualizations. Diagrams 2012.
77 77  
78 -Aulbach, Fink, Schuhmann, and Wolff. "Drawing graphs within restricted area." In //International Symposium on Graph Drawing//, pp. 367-379. Springer, 2014. [[**PDF**>>url:https://arxiv.org/pdf/1409.0499||shape="rect"]]
78 +Nagy. Graphical representations of context-free languages. Diagrams 2014.
79 79  
80 - 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 +Bojda, Bubnó, Nagy, Takács. A graphical representation of boolean logic. Diagrams 2014.
81 81  
82 -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"]]
82 +Kobourov, Pupyrev, Saket. Are crossings important for drawing large graphs? GD 2014.
83 83  
84 -Walshaw. "A multilevel algorithm for force-directed graph drawing." In //International Symposium on Graph Drawing//, pp. 171-182. Springer, 2000. [[**PDF**>>url:https://link.springer.com/content/pdf/10.1007/3-540-44541-2_17.pdf||shape="rect"]]
84 +Fink, Wolff, Schuhmann, Aulbach. Drawing graphs with restricted area. GD 2014.
85 85  
86 -== Euler Diagrams ==
86 +Nachmanson, Prutkin, Lee, Riche, Holroyd, Chen. GraphMaps: browsing large graphs as interactive maps. GD 2015.
87 87  
88 -Bottoni, Costagliola, and Fish. "Euler diagram encodings." In //International Conference on Theory and Application of Diagrams//, pp. 148-162. Springer, 2012. [[**PDF**>>url:http://www.academia.edu/download/45649653/Euler_diagram_encodings20160515-26490-1rvpanx.pdf||shape="rect"]]
89 -
90 -Baimagambetov, Howse, Stapleton, and Delaney. "Generating Effective Euler Diagrams." In //International Conference on Theory and Application of Diagrams//, pp. 39-54. Springer, 2018.
91 -
92 -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"]]
93 -
94 -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"]]
95 -
96 -== Other Types of Diagrams ==
97 -
98 -Erwig and Smeltzer. "Variational Pictures." In //International Conference on Theory and Application of Diagrams//, pp. 55-70. Springer, 2018.
99 -
100 -Grossman and Harel. "On the algorithmics of higraphs." Weizmann Institute of Science. Department of Applied Mathematics and Computer Science, 1997.
88 +Hou, Chapman, Oliver. Measuring perceived clutter in concept diagrams. VL/HCC 2016.
101 101  {{/expand}}
102 102  
103 103  = Ablauf =
... ... @@ -282,7 +282,7 @@
282 282  Ausarbeitung
283 283  )))|(((
284 284  {{code language="none"}}
285 -<login>/sem18ws-<login>.[tex/pdf]
273 +<login>/sem16ws-<login>.[tex/pdf]
286 286  {{/code}}
287 287  )))
288 288  |=(((
... ... @@ -289,7 +289,7 @@
289 289  Vortragsfolien
290 290  )))|(((
291 291  {{code language="none"}}
292 -<login>/sem18ws-<login>-talk.[tex/pdf]
280 +<login>/sem16ws-<login>-talk.[tex/pdf]
293 293  {{/code}}
294 294  )))
295 295  |=(((
... ... @@ -296,7 +296,7 @@
296 296  Handoutfolien
297 297  )))|(((
298 298  {{code language="none"}}
299 -<login>/sem18ws-<login>-handout.[tex/pdf]
287 +<login>/sem16ss-<login>-handout.[tex/pdf]
300 300  {{/code}}
301 301  )))
302 302  |=(((
... ... @@ -303,10 +303,10 @@
303 303  Review
304 304  )))|(((
305 305  Generelle Anmerkungen:
306 -{{code language="none"}}<login review-Empfänger>/sem18ws-<login review-Empfänger>-reviewnotes-<login Reviewer>.[pdf]{{/code}}
294 +{{code language="none"}}<login review-Empfänger>/sem16ss-<login review-Empfänger>-reviewnotes-<login Reviewer>.[pdf]{{/code}}
307 307  
308 308  Annotiertes PDF:
309 -{{code language="none"}}<login review-Empfänger>/sem18ws-<login review-Empfänger>-review-<login Reviewer>.[pdf]{{/code}}
297 +{{code language="none"}}<login review-Empfänger>/sem16ws-<login review-Empfänger>-review-<login Reviewer>.[pdf]{{/code}}
310 310  )))
311 311  
312 312  Die Handoutfolien unterscheiden sich von den Vortragsfolien dadurch, dass die Handoutfolien keine Animationen für die Präsentation am Beamer enthalten. Beim Arbeiten mit der LaTeX-beamer Klasse können Handoutfolien durch das Hinzufügen eines optionalen Argumentes bei der Deklaration der Dokumentenklasse generiert werden ({{code language="none"}}\documentclass[trans]{beamer}{{/code}}).
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -45318269
1 +45318236
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/45318269/WS18/19 (Layout)
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/45318236/WS18/19 (Layout)