Changes for page 2025 Layout

Last modified by Maximilian Kasperowski on 2025/02/24 08:08
<
From version < 13.1 >
edited by Soeren Domroes
on 2021/07/15 07:46
To version < 15.1 >
edited by Reinhard von Hanxleden
on 2021/07/15 10:38
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.sdo
1 +XWiki.rvh
Content
... ... @@ -57,28 +57,28 @@
57 57  
58 58   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"]]**
59 59  
60 -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"]]**
61 -
62 62  Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu. "The Turing Test for Graph Drawing Algorithms". //In Processings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020),// pp. 466-481. [[**PDF**>>url:https://arxiv.org/pdf/2008.04869.pdf||shape="rect"]]
63 63  
62 +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"]]**
63 +
64 64  == Human Computer Interaction ==
65 65  
66 -Pietriga. "A Toolkit for Addressing HCI Issues in Visual Language Environments." In //IEEE Symposium on Visual Languages and Human-Centric Computing// (VL/HCC), pp.145–152. 2015. **[[PDF>>url:https://ieeexplore.ieee.org/iel5/10093/32326/01509498.pdf||shape="rect"]]**
67 -
68 -Green, Petre. "Usability Analysis of Visual Programming Environments - A Cognitive Dimensions Framework." In //Journal of Visual Languages and Computing//, pp. 131–174, Issue 7–2. 1996. [[**PDF**>>url:https://www.researchgate.net/profile/Marian-Petre-4/publication/200085937_Usability_Analysis_of_Visual_Programming_Environments_A_%27Cognitive_Dimensions%27_Framework/links/02bfe50fbf23476730000000/Usability-Analysis-of-Visual-Programming-Environments-A-Cognitive-Dimensions-Framework.pdf||shape="rect"]]
69 -
70 70  Pourali, Atlee. "A Focus+Context Approach to Alleviate Cognitive Challenges of Editing and Debugging UML Models." In //ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems (MODELS)//, pp. 183–193. 2019. [[**PDF**>>url:https://ieeexplore.ieee.org/iel7/8894013/8906890/08906900.pdf||shape="rect"]]
71 71  
72 72  Frisch, Dachselt. "Off-Screen visualization techniques for class diagrams." In //Proceedings of the 5th International Symposium on Software Visualization//, pp. 163–172. 2010. [[**PDF**>>url:https://www.researchgate.net/profile/Raimund_Dachselt/publication/220955887_Off-screen_visualization_techniques_for_class_diagrams/links/0fcfd50abd0eba0db2000000.pdf||shape="rect"]]
73 73  
70 +Pietriga. "A Toolkit for Addressing HCI Issues in Visual Language Environments." In //IEEE Symposium on Visual Languages and Human-Centric Computing// (VL/HCC), pp.145–152. 2015. **[[PDF>>url:https://ieeexplore.ieee.org/iel5/10093/32326/01509498.pdf||shape="rect"]]**
71 +
72 +Green, Petre. "Usability Analysis of Visual Programming Environments - A Cognitive Dimensions Framework." In //Journal of Visual Languages and Computing//, pp. 131–174, Issue 7–2. 1996. [[**PDF**>>url:https://www.researchgate.net/profile/Marian-Petre-4/publication/200085937_Usability_Analysis_of_Visual_Programming_Environments_A_%27Cognitive_Dimensions%27_Framework/links/02bfe50fbf23476730000000/Usability-Analysis-of-Visual-Programming-Environments-A-Cognitive-Dimensions-Framework.pdf||shape="rect"]]
73 +
74 74  == Graph Drawing ==
75 75  
76 +**(Master)** Julien Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff. "Layered Drawing of Undirected Graphs with Generalized Port Constraints". In //Processings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020),// pp. 220-234. **[[PDF>>url:https://arxiv.org/pdf/2008.10583.pdf||shape="rect"]]**
77 +
76 76   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"]]
77 77  
78 78  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"]]
79 79  
80 -**(Master)** Julien Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff. "Layered Drawing of Undirected Graphs with Generalized Port Constraints". In //Processings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020),// pp. 220-234. **[[PDF>>url:https://arxiv.org/pdf/2008.10583.pdf||shape="rect"]]**
81 -
82 82  Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen Kobourev, Mingwei Li. "Graph Drawing via Gradient Descent".In //Processings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020),// pp. 3-17. **[[PDF>>url:https://arxiv.org/abs/2008.05584||shape="rect"]]**
83 83  
84 84  Amyra Meidiana, Seok-Hee Hong, Peter Eades. "New Quality Metrics for Dynamic Graph Drawing". In //Processings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020),// pp. 450-465. **[[PDF>>url:https://arxiv.org/pdf/2008.07764.pdf||shape="rect"]]**
... ... @@ -207,7 +207,7 @@
207 207  
208 208  == The Final Presentations ==
209 209  
210 -Currently, it is unclear how the talks will take place. This will be influenced by the development of the pandemic. We can think of recorded videos or a live conference or other alternatives. We expect to be able to make a decision at the end of Mai.
210 +Currently, it is unclear how the talks will take place. This will be influenced by the development of the pandemic. We can think of recorded videos or a live conference or other alternatives. We expect to be able to make a decision at the end of May.
211 211  {{/expand}}
212 212  
213 213  = Schedule and Grading =
... ... @@ -221,11 +221,11 @@
221 221  
222 222  The paper should provide an overview of the chosen topic. It should be written in a style that late bachelor student can understand it. The paper should be 6 (master) or 4 (bachelor) pages long, not more not less, and it should use the ACM LaTeX-style (more details below). We advise you to read the [[writing advice>>doc:RTSYS.Writing and Grading Theses||shape="rect"]] for writing a thesis.
223 223  
224 -=== Talk ===
224 +=== Talk/Discussions ===
225 225  
226 -The talk should be 40 minutes (master) or 25 minutes (bachelor) long. This is followed by 5 minutes of questions. The slides should contain page numbers to allow the participants to ask specific questions after the talk. It would be great to include a short tool demo if your topic includes some concrete implementation.\\
226 +Your talk should be 40 minutes (master) or 25 minutes (bachelor) long. This is followed by 5 minutes of questions. The slides should contain page numbers to allow the participants to ask specific questions after the talk. It would be great to include a short tool demo if your topic includes some concrete implementation. You can freely choose your presentation tool. The talk can be held in English or German.
227 227  
228 -You can freely choose your presentation tool. The talk can be held in English or German.
228 +Your talk is followed by a discussion that should involve your fellow students (not just the lecturers). That means that you should also make an effort to get engaged in your fellow students' talks as well.
229 229  
230 230  === Review ===
231 231  
... ... @@ -242,7 +242,7 @@
242 242  
243 243  == Grades ==
244 244  
245 -This seminar is graded. The grade is based on each milestone (the different versions of the paper, the reviews, the slides, the talk). For each milestone quality, timing (see dates) are graded. You may fail the seminar because of missed deadlines.
245 +This seminar is graded. The grade is based on each milestone (the different versions of the paper, the reviews, the slides, the talk, your engagement in the discussion of other talks). For each milestone, quality and timeliness (see dates) are considered. If you miss deadlines, you may fail the seminar.
246 246  {{/expand}}
247 247  
248 248  = Technical Details =
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -102236165
1 +102236168
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/102236165/WS21/22 (Layout)
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SEM/pages/102236168/WS21/22 (Layout)

Navigation

Quick Links

KIELER on GitHub
RTSYS Homepage