Changes for page 2018/19 Layout
Last modified by Soeren Domroes on 2025/01/30 11:56
Summary
-
Page properties (1 modified, 0 added, 0 removed)
-
Objects (1 modified, 0 added, 0 removed)
Details
- Page properties
-
- Content
-
... ... @@ -49,29 +49,37 @@ 49 49 Die Paperliste befindet sich aktuell noch im Aufbau, also verlasst euch besser noch nicht darauf. 50 50 {{/note}} 51 51 52 - == GraphLayout ==52 +**Diagrams 2012** 53 53 54 -Wybrow, Marriott, Stuckey. Orthogonal hyperedge routing. Diagrams 2012. 54 ++ Wybrow, Marriott, Stuckey. Orthogonal hyperedge routing. Diagrams 2012. (Ideal für Abschlussarbeit) 55 55 56 -Bottoni, Costagliola, Fish. Euler diagram encodings. Diagrams 2012. 56 ++ Bottoni, Costagliola, Fish. Euler diagram encodings. Diagrams 2012. 57 57 58 - ==Perception==58 ++ Burns, Carberry, Elzer, and Chester. Automatically recognizing intended messages in grouped bar charts. Diagrams 2012. 59 59 60 - Burns,Carberry, Elzer,andChester. Automatically recognizingintendedmessagesin grouped bar charts. Diagrams 2012.60 ++ Purchase, Freeman, Hamer. An exploration of visual complexity. Diagrams 2012. 61 61 62 - Purchase, Freeman, Hamer. An exploration of visual complexity.Diagrams 2012.62 +**Diagrams 2014** 63 63 64 - Alqadah, Stapleton,Howse,Chapman.EvaluationtheimpactofclutterEulerdiagrams. Diagrams 2014.64 ++ Chapman, Stapleton, Rodgers, Micallef, Blake. Visualizing sets: an empirical comparison of diagram types. Diagrams 2014. 65 65 66 - Chapman, Stapleton, Rodgers, Micallef, Blake. Visualizing sets: an empirical comparison of diagram types.Diagrams 2014.66 +**Diagrams 2018** 67 67 68 - ==Miscellaneous==68 ++ Baimagambetov, Howse, Stapleton, Delaney. Generating effective Euler diagrams. Diagrams 2018. 69 69 70 - Durugbo.Modellinginformationflow:improving diagrammaticvisualizations. Diagrams 2012.70 ++ Erwig, Smeltzer. Variational pictures. Diagrams 2018. 71 71 72 - Nagy.Graphicalpresentationsof context-free languages. Diagrams 2014.72 ++ Lloyd, Rodgers, Roberts. Metro map colour-coding: effect on usability in route tracing. Diagrams 2018. 73 73 74 -Bojda, Bubnó, Nagy, Takács. A graphical representation of boolean logic. Diagrams 2014. 74 +**GD 2014** 75 + 76 ++ Kobourov, Pupyrev, Saket. Are crossings important for drawing large graphs? GD 2014. 77 + 78 ++ Fink, Wolff, Schuhmann, Aulbach. Drawing graphs with restricted area. GD 2014. 79 + 80 +**GD 2015** 81 + 82 ++ Nachmanson, Prutkin, Lee, Riche, Holroyd, Chen. GraphMaps: browsing large graphs as interactive maps. GD 2015. 75 75 {{/expand}} 76 76 77 77 = Ablauf =
- Confluence.Code.ConfluencePageClass[0]
-
- Id
-
... ... @@ -1,1 +1,1 @@ 1 -45318 1781 +45318237 - URL
-
... ... @@ -1,1 +1,1 @@ 1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/45318 178/WS18/19 (Layout)1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/45318237/WS18/19 (Layout)