Show last authors
1 (((
2 (% class="bodytext" style="text-align: left;" %)
3 The purpose of this seminar is to independently scientifically work on a layout algorithm topic. The goal is to summarize the topic in an oral presentation and a written elaboration in form of a paper. Another purpose of this seminar is to practice working in structured and time-driven workflows (e.g. for conferences or workshops). Moreover, both of these aspects are good preparation for working on your thesis. We have many theses regarding these topics available; contact us if you are interested in that.
4
5 (% class="bodytext" style="text-align: left;" %)
6 This seminar is a bachelor and master module at the same time. Compared to the bachelor seminar, we expect that master students include more related papers and therefore write a longer paper and hold a longer presentation (see below).
7
8 [[image:attach:image2016-7-7 15:43:29.png]] [[image:attach:image2016-7-7 15:43:25.png]]
9
10
11 == Prerequisites ==
12
13 For the participation of this seminar the attendance of the "Automatic Graph Drawing" lecture is not specifically required. However, specific lecture topics required for the paper should be revised.
14
15 Moreover, we recommend the attendance of the lecture "**Scientific Working for Seminars and Thesis**" (Wissenschaftliches Arbeiten für Seminar und Abschlussarbeiten) held by Prof. Peters.
16
17 Finally, there is the infamous "Vortragsvortrag" by Christoph Daniel Schulze. Sadly, he is not at RTSYS anymore to give that talk in person. However, he kindly started to prepare this [[sequence of videos>>url:https://www.youtube.com/playlist?list=PLjRqbgPHrKwC3uUQBRzKtnRH1vrNY9ehK]] that should get the gist across as well.
18
19 == Lecturers ==
20
21 Reinhard von Hanxleden ([[rvh@informatik.uni-kiel.de>>path:mailto:rvh@informatik.uni-kiel.de]])
22 Maximilian Kasperowski ([[mka@informatik.uni-kiel.de>>path:mailto:mka@informatik.uni-kiel.de]])
23 Sören Domrös ([[sdo@informatik.uni-kiel.de>>path:mailto:sdo@informatik.uni-kiel.de]])
24
25 = Topics =
26
27 (% class="bodytext" style="text-align: left;" %)
28 You may choose one of the following papers from the different topics.
29
30 (% class="bodytext" style="text-align: left;" %)
31 The papers are assigned via //first-come-first-serve//. Already reserved papers are crossed out. Please send an email to Max ([[mka@informatik.uni-kiel.de>>path:mailto:mka@informatik.uni-kiel.de]]).
32
33 (% class="bodytext" style="text-align: left;" %)
34 Many of the links only work in the university network.
35
36 {{info}}
37 Some papers are not freely available. These papers are linked in an internal page in our wiki. You can log in with your Ifi-account. If any problems occur feel free to contact us.
38 {{/info}}
39
40 == Aesthetics and Perception ==
41
42 Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, and Falk Schreiber. "GraphTrials: Visual Proofs of Graph Properties". In //32nd International Symposium on Graph Drawing and Network Visualization// (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). **[[PDF>>https://drops.dagstuhl.de/storage/00lipics/lipics-vol320-gd2024/LIPIcs.GD.2024.16/LIPIcs.GD.2024.16.pdf]]**
43
44 Gavin J. Mooney, Helen C. Purchase, Michael Wybrow, Stephen G. Kobourov, and Jacob Miller. "The Perception of Stress in Graph Drawings". In //32nd International Symposium on Graph Drawing and Network Visualization// (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). **[[PDF>>https://drops.dagstuhl.de/storage/00lipics/lipics-vol320-gd2024/LIPIcs.GD.2024.21/LIPIcs.GD.2024.21.pdf]]**
45
46 Helmke, S., Doğan, K., Scheffler, R., Wrobel, G. (2024). "Domain-Specific Rules Override Aesthetic Graph Drawing Criteria: An Exploration of User-Generated Diagrams". In: Lemanski, J., Johansen, M.W., Manalo, E., Viana, P., Bhattacharjee, R., Burns, R. (eds) //Diagrammatic Representation and Inference//. Diagrams 2024. Lecture Notes in Computer Science(), vol 14981. Springer, 2024**. **[[**PDF**>>https://link.springer.com/content/pdf/10.1007/978-3-031-71291-3_4.pdf?pdf=inline%20link]]
47
48 == Human Computer Interaction ==
49
50 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"]]
51
52 == Graph Drawing ==
53
54 Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger. "Bundling-Aware Graph Drawing". In //32nd International Symposium on Graph Drawing and Network Visualization// (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 15:1-15:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)**. [[PDF>>https://drops.dagstuhl.de/storage/00lipics/lipics-vol320-gd2024/LIPIcs.GD.2024.15/LIPIcs.GD.2024.15.pdf]]**
55
56 Tim Hegemann and Alexander Wolff. "Storylines with a Protagonist". In //32nd International Symposium on Graph Drawing and Network Visualization// (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 26:1-26:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). **[[PDF>>https://drops.dagstuhl.de/storage/00lipics/lipics-vol320-gd2024/LIPIcs.GD.2024.26/LIPIcs.GD.2024.26.pdf]]**
57
58 Oswin Aichholzer, Joachim Orthaber, and Birgit Vogtenhuber. "Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles". In //32nd International Symposium on Graph Drawing and Network Visualization// (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). **[[PDF>>https://drops.dagstuhl.de/storage/00lipics/lipics-vol320-gd2024/LIPIcs.GD.2024.34/LIPIcs.GD.2024.34.pdf]]**
59
60 Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson. "Morphing Planar Graph Drawings via Orthogonal Box Drawings". In //32nd International Symposium on Graph Drawing and Network Visualization// (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). **[[PDF>>https://drops.dagstuhl.de/storage/00lipics/lipics-vol320-gd2024/LIPIcs.GD.2024.40/LIPIcs.GD.2024.40.pdf]]**
61
62 Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, and Jules Wulms. "Boundary Labeling in a Circular Orbit". In //32nd International Symposium on Graph Drawing and Network Visualization// (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). **[[PDF>>https://drops.dagstuhl.de/storage/00lipics/lipics-vol320-gd2024/LIPIcs.GD.2024.22/LIPIcs.GD.2024.22.pdf]]**
63
64 **(Master)** Julien Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff. "Layered Drawing of Undirected Graphs with Generalized Port Constraints". In //Proceedings 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"]]**
65
66 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"]]
67
68 Amyra Meidiana, Seok-Hee Hong, Peter Eades. "New Quality Metrics for Dynamic Graph Drawing". In //Proceedings 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"]]**
69
70 == Euler Diagrams ==
71
72 Yan, X., Rodgers, P., Rottmann, P., Archambault, D., Haunert, JH., Wang, B. (2024). "EulerMerge: Simplifying Euler Diagrams Through Set Merges". In: Lemanski, J., Johansen, M.W., Manalo, E., Viana, P., Bhattacharjee, R., Burns, R. (eds) //Diagrammatic Representation and Inference//. Diagrams 2024. Lecture Notes in Computer Science(), vol 14981. Springer, 2024. **[[INTERNAL>>doc:.WS2122 Eingeschränkt sichtbare Paper.WebHome]]**
73
74 == Other Types of Diagrams ==
75
76 Engelhardt, Y., Richards, C. (2024). "A Building-Block Approach to the Diversity of Visualization Types – Each Type Expressed Visually, and as a Systematically Generated Sentence". In: Lemanski, J., Johansen, M.W., Manalo, E., Viana, P., Bhattacharjee, R., Burns, R. (eds) //Diagrammatic Representation and Inference//. Diagrams 2024. Lecture Notes in Computer Science(), vol 14981. Springer, 2024. **[[INTERNAL>>doc:.WS2122 Eingeschränkt sichtbare Paper.WebHome]]**
77
78 Erwig and Smeltzer. "Variational Pictures." In //International Conference on Theory and Application of Diagrams//, pp. 55-70. Springer, 2018. **[[INTERNAL>>doc:.WS2122 Eingeschränkt sichtbare Paper.WebHome]]**
79
80 == Diagramming Tools ==
81
82 Metin, H., Bork, D. "A reference architecture for the development of GLSP-based web modeling tools". //Softw Syst Model// (2025). **[[PDF>>https://link.springer.com/content/pdf/10.1007/s10270-024-01257-y.pdf]]**
83
84 = Schedule =
85
86 == Dates in the semester ==
87
88 (% class="relative-table wrapped" style="width:550.333px" %)
89 |=(((
90 Datum
91 )))|=(% style="width: 434px;" %)(((
92 Milestone
93 )))
94 |(((
95 Tue., 15.04., 23:59
96 )))|(% style="width:434px" %)(((
97 Deadline for topic
98 )))
99 |(((
100 Tue., 15.04., 10:00
101 )))|(% style="width:434px" %)First Meeting/**Kick-Off **with a Latex and EasyChair introduction. The meeting will take place in room 11.1114/11.1115 in CAP4.
102 |(((
103 Mo., xx.xx., 23:59
104 )))|(% style="width:434px" %)(((
105 Deadline of the first draft in EasyChair
106 //Content: abstract, introduction, outline, notes for chapter contents, bibliography//
107 )))
108 |(% colspan="1" %)(% colspan="1" %)
109 (((
110 In week of above, individual dates
111 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
112 (((
113 Individual dates
114 //Online, as discussed with advisor//
115 )))
116 |(% colspan="1" %)(% colspan="1" %)
117 (((
118 Mo., xx.xx, 23:59
119 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
120 (((
121 Deadline of the first full version
122 //Submission-Update in EasyChair//
123 )))
124 |(% colspan="1" %)(% colspan="1" %)
125 (((
126 In week of above, individual dates
127 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
128 (((
129 Individual dates
130 //Online, as discussed with advisor//
131 )))
132 |(% colspan="1" %)(% colspan="1" %)
133 (((
134 Mo., xx.xx., 23:59
135 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
136 (((
137 Deadline of the review version
138 //Submission-Update in EasyChair//
139 )))
140 |(% colspan="1" %)(% colspan="1" %)
141 (((
142 subsequently
143 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
144 (((
145 Review assignment
146 //By e-mail//
147 )))
148 |(% colspan="1" %)(% colspan="1" %)
149 (((
150 Mo., xx.xx., 23:59
151 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
152 (((
153 Deadline reviews
154 //In EasyChair//
155 )))
156 |(% colspan="1" %)(% colspan="1" %)
157 (((
158 tbd
159 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
160 (((
161 Talk on how to do talks/presentations (the talk-talk)?
162 )))
163 |(% colspan="1" %)(% colspan="1" %)
164 (((
165 In the week of Mo., xx.xx.
166 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
167 (((
168 Individual dates for presentation slides
169 //Online, as discussed with advisor. The slides have to be available online or have been sent beforehand via e-mail.//
170 )))
171 |(% colspan="1" %)(% colspan="1" %)
172 (((
173 Mo.,  xx.xx., 23:59
174 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
175 (((
176 Deadline final version
177 //Submission-Update in EasyChair//
178 )))
179 |(% colspan="1" %)(% colspan="1" %)
180 (((
181 Sa. xx.xx.
182 )))|(% colspan="1" style="width:434px" %)(% colspan="1" %)
183 (((
184 Presentations
185 )))
186
187 == The Final Presentations ==
188
189 The presentation of the prepared topic is held during a block seminar at **tbd**. The attendance at the seminar day is mandatory. Every attending person receives the proceedings of the current semester.
190
191 === Agenda ===
192
193 **tbd**
194
195 = Schedule and Grading =
196
197 == Papers, Talks, Review ==
198
199 This seminar includes creating a paper, a talk, and two reviews.
200
201 === Paper ===
202
203 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 (including bibliography), not more not less, and it should use the ACM LaTeX-style (more details below). We advise you to read the [[writing advice>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/view/Theses/Writing%20and%20Grading%20Theses/]] for writing a thesis. You can write your paper either in English or German.
204
205 === Talk ===
206
207 The talk should be 30 minutes (master) or 20 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.
208
209 You can freely choose your presentation tool. Therefore, for the individual dates on the presentation slides it would be best to to use your own computer. If the slides are provided as PDF beforehand, a different computer could be used.
210
211 Especially when using online tools, note that the block seminar might take place in Falckenstein and that there is no WLAN access. Therefore, the presentations must allow to be held offline.
212
213 The talk can be held in English or German.
214
215 === Review ===
216
217 A review consist of two parts:
218
219 1. General comments (what do you like/ not like regarding content, structure, and readability) as well as general suggestions to improve the paper
220 1. In detail remarks and corrections
221
222 The first part of the review should be at least half an A4 page long. It should be written in full text and not only consist of notes. The review content should be similar to the review you get during the individual dates, however, it should be more in detail and with a clear focus on content, structure, and readability of the paper.
223
224 It is not possible to add files in the EasyChair review form. Therefore, it is not possible to add an annotated pdf as detailed correction.
225
226 Some example reviews from a previous semester to understand the form (not necessarily with the best grades) can be found in here: [[1>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/download/Seminars/SS23%20%28Embedded%20Real-Time%20Systems%29/WebHome/review1.txt?rev=1.2]] [[2>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/download/Seminars/SS23%20%28Embedded%20Real-Time%20Systems%29/WebHome/review2.txt?rev=1.2]] [[3>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/download/Seminars/SS23%20%28Embedded%20Real-Time%20Systems%29/WebHome/review3.txt?rev=1.2]] [[4>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/download/Seminars/SS23%20%28Embedded%20Real-Time%20Systems%29/WebHome/review4.txt?rev=1.2]] [[5>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/download/Seminars/SS23%20%28Embedded%20Real-Time%20Systems%29/WebHome/review5.txt?rev=1.2]].
227
228 The reviews are assigned after the review-version deadline and are based on the submitted version of the papers.
229
230 == Grades ==
231
232 This seminar is graded. The grade is based on each milestone (the different versions of the paper, the reviews, the slides, the talk, engagement in the workshop). For each milestone quality, timing (see dates) are graded. Missed deadlines may cause you to fail the seminar.
233
234 = Technical Details =
235
236 === LaTeX ===
237
238 Your papers should be created using LaTeX and have to be in the provided ACM style. You can find all necessary files in this [[zip archive>>url:https://cloud.rz.uni-kiel.de/index.php/s/PpmFxJtxYqF2GaX]], including an example document that includes helpful LaTeX-hints to start with. Copy all files in some folder and begin to write your paper.
239
240 LaTeX can create a bibliography (it includes scientific publications, which are referenced to prove statements) too. The example includes a file named {{code language="none"}}myrefs.bib{{/code}}, which holds the references. ACM provides a short overview with [[examples>>url:https://www.acm.org/publications/authors/bibtex-formatting]] of bibliography entries.
241
242 While writing your paper keep the following in mind:
243
244 * Think about whether you want to write your paper in German or English and make use to use the corresponding ACM-style.
245 * If you use graphics from your original paper, you should not just add a screenshot of the pdf your paper. Try to use the image from the original paper by exporting them, including the pdf directly {{code language="none"}}\inlcudegraphics[page=... trim=...]{*.pdf}{{/code}}, or by recreating the image by yourself (ideally as a vector graphic). This way you should get a result that is not pixelated or at least not worse than the original.
246 * A paper always consists of an introduction, at least one main chapter, and a conclusion.
247
248 === EasyChair Tutorial ===
249
250 **[[The Tutorial>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/view/Seminars/EasyChair%20Tutorial/]]**
251
252 You can find our seminar in EasyChair: **[[Link>>url:https://easychair.org/conferences/?conf=kielrtsyssem24ss]]**
253
254 = Resources =
255
256 In general, it is advised to look for related work in the university network since you will get access to many online libraries. We recommend the following search engines and web pages:
257
258 * Google Scholar: [[http:~~/~~/scholar.google.de/>>url:http://scholar.google.de/]]
259 * dblp: [[http:~~/~~/dblp.uni-trier.de/>>url:http://dblp.uni-trier.de/]]
260 * CiteSeer: [[http:~~/~~/citeseer.ist.psu.edu/>>url:http://citeseer.ist.psu.edu/]]
261 * IEEE-Xplore: [[http:~~/~~/ieeexplore.ieee.org/Xplore/dynhome.jsp>>url:http://ieeexplore.ieee.org/Xplore/dynhome.jsp]]
262 * ACM Digital Library: [[http:~~/~~/portal.acm.org/dl.cfm>>url:http://portal.acm.org/dl.cfm]]
263 * Universitätsbibliothek Digitale Medien: [[http:~~/~~/www.uni-kiel.de/ub/emedien/index.html>>url:http://www.uni-kiel.de/ub/emedien/index.html]]
264
265
266 )))
267
268 (% style="display: none;" %)
269 (((
270 555
271 )))
272
273 (% style="display: none;" %)
274 (((
275 610
276 )))
277
278 (% style="display: none;" %)
279 (((
280 410
281 )))
282
283 (% style="display: none;" %)
284 (((
285 547
286 )))
287
288 (% style="display: none;" %)
289 (((
290 983
291 )))
292
293 (% style="display: none;" %)
294 (((
295 150
296 )))
297
298 (% style="display: none;" %)
299 (((
300 329
301 )))