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 (% style="text-align: left;" %)
12 = Important Dates =
13
14 (% class="wrapped" %)
15 |=(% colspan="1" style="text-align: right;" %)(% colspan="1" style="text-align: right;" %)
16 (((
17 Requirements
18 )))|(% colspan="1" %)(% colspan="1" %)
19 (((
20 //Wissenschaftliches Arbeiten// von Prof. Peters
21 )))
22 |=(% style="text-align: right;" %)(% style="text-align: right;" %)
23 (((
24 Lecturers
25 )))|(((
26 Reinhard von Hanxleden ([[rvh@informatik.uni-kiel.de>>path:mailto:rvh@informatik.uni-kiel.de]])
27 Sören Domrös ([[sdo@informatik.uni-kiel.de>>path:mailto:sdo@informatik.uni-kiel.de]])
28 Maximilian Kasperowski ([[mka@informatik.uni-kiel.de>>path:mailto:mka@informatik.uni-kiel.de]])
29 )))
30 |=(% style="text-align: right;" %)(% style="text-align: right;" %)
31 (((
32 Block seminar day
33 )))|(((
34 tbd
35 )))
36
37 = Topics =
38
39 (% class="bodytext" style="text-align: left;" %)
40 You may choose one of the following papers from the different topics.
41
42 (% class="bodytext" style="text-align: left;" %)
43 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]]) in order to reserve a paper.
44
45 (% class="bodytext" style="text-align: left;" %)
46 Many of the links do only work in the university network. Through the usage of a [[VPN>>url:https://www.rz.uni-kiel.de/de/angebote/vpn]] or a remote session to the [[terminal server>>url:https://www.inf.uni-kiel.de/de/service/technik-service/dienste]], those are also accessible from home. If any problems occur feel free to contact us.
47
48 {{info}}
49 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 contact mka.
50 {{/info}}
51
52 == ==
53
54 == Aesthetics and Perception ==
55
56 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]]**
57
58 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]]**
59
60 == Human Computer Interaction ==
61
62 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"]]
63
64 == Graph Drawing ==
65
66 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]]**
67
68 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]]**
69
70 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]]**
71
72 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]]**
73
74 **(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"]]**
75
76 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"]]
77
78 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"]]**
79
80 == Euler Diagrams ==
81
82 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.
83
84 == Other Types of Diagrams ==
85
86
87 = Schedule =
88
89 == Dates in the semester (currently not final) ==
90
91 (% class="relative-table wrapped" style="width:52.6894%" %)
92 |=(((
93 Datum
94 )))|=(((
95 Milestone
96 )))
97 |(((
98 Mo., 25.10., 23:59
99 )))|(((
100 Deadline for topic
101 )))
102 |(((
103 Mo., 25.10., 12:00
104 )))|(((
105 Kick-off
106 //The kick-off will take place online. We will send you the corresponding link.//
107 )))
108 |(((
109 Mo., 15.11., 23:59
110 )))|(((
111 Deadline of the first draft in EasyChair
112 //Content: abstract, introduction, outline, notes for chapter contents, bibliography//
113 )))
114 |(% colspan="1" %)(% colspan="1" %)
115 (((
116 In week of above, individual dates
117 )))|(% colspan="1" %)(% colspan="1" %)
118 (((
119 Individual dates
120 //Online, as discussed with advisor//
121 )))
122 |(% colspan="1" %)(% colspan="1" %)
123 (((
124 Mo., 13.12, 23:59
125 )))|(% colspan="1" %)(% colspan="1" %)
126 (((
127 Deadline of the first full version
128 //Submission-Update in EasyChair//
129 )))
130 |(% colspan="1" %)(% colspan="1" %)
131 (((
132 In week of above, individual dates
133 )))|(% colspan="1" %)(% colspan="1" %)
134 (((
135 Individual dates
136 //Online, as discussed with advisor//
137 )))
138 |(% colspan="1" %)(% colspan="1" %)
139 (((
140 Mo., 10.01., 23:59
141 )))|(% colspan="1" %)(% colspan="1" %)
142 (((
143 Deadline of the review version
144 //Submission-Update in EasyChair//
145 )))
146 |(% colspan="1" %)(% colspan="1" %)
147 (((
148 subsequently
149 )))|(% colspan="1" %)(% colspan="1" %)
150 (((
151 Review assignment
152 //By e-mail//
153 )))
154 |(% colspan="1" %)(% colspan="1" %)
155 (((
156 Mo., 17.01., 23:59
157 )))|(% colspan="1" %)(% colspan="1" %)
158 (((
159 Deadline reviews
160 //In EasyChair//
161 )))
162 |(% colspan="1" %)(% colspan="1" %)
163 (((
164 tbd
165 )))|(% colspan="1" %)(% colspan="1" %)
166 (((
167 Talk on how to do talks/presentations (the talk-talk)?
168 )))
169 |(% colspan="1" %)(% colspan="1" %)
170 (((
171 In the week of Mo., 10.01.
172 )))|(% colspan="1" %)(% colspan="1" %)
173 (((
174 Individual dates for presentation slides
175 //Online, as discussed with advisor. The slides have to be available online or have been sent beforehand via e-mail.//
176 )))
177 |(% colspan="1" %)(% colspan="1" %)
178 (((
179 Mo.,  24.01., 23:59
180 )))|(% colspan="1" %)(% colspan="1" %)
181 (((
182 Deadline final version
183 //Submission-Update in EasyChair//
184 )))
185 |(% colspan="1" %)(% colspan="1" %)
186 (((
187 Sa. 29.1.
188 )))|(% colspan="1" %)(% colspan="1" %)
189 (((
190 Presentations
191 )))
192
193 == The Final Presentations ==
194
195 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.
196
197 === Agenda ===
198
199 **tbd**
200
201 = Schedule and Grading =
202
203 == Papers, Talks, Review ==
204
205 This seminar includes creating a paper, a talk, and two reviews.
206
207 === Paper ===
208
209 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.
210
211 === Talk ===
212
213 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.
214
215 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.
216
217 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.
218
219 The talk can be held in English or German.
220
221 === Review ===
222
223 A review consist of two parts:
224
225 1. General comments (what do you like/ not like regarding content, structure, and readability) as well as general suggestions to improve the paper
226 1. In detail remarks and corrections
227
228 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.
229
230 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.
231
232 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]].
233
234 The reviews are assigned after the review-version deadline and are based on the submitted version of the papers.
235
236 == Grades ==
237
238 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.
239
240 = Technical Details =
241
242 === LaTeX ===
243
244 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.
245
246 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.
247
248 While writing your paper keep the following in mind:
249
250 * Think about whether you want to write your paper in German or English and make use to use the corresponding ACM-style.
251 * 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.
252 * A paper always consists of an introduction, at least one main chapter, and a conclusion.
253
254 === EasyChair Tutorial ===
255
256 **[[The Tutorial>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/view/Seminars/EasyChair%20Tutorial/]]**
257
258 You can find our seminar in EasyChair: **[[Link>>url:https://easychair.org/conferences/?conf=kielrtsyssem24ss]]**
259
260 = Resources =
261
262 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:
263
264 * Google Scholar: [[http:~~/~~/scholar.google.de/>>url:http://scholar.google.de/]]
265 * dblp: [[http:~~/~~/dblp.uni-trier.de/>>url:http://dblp.uni-trier.de/]]
266 * CiteSeer: [[http:~~/~~/citeseer.ist.psu.edu/>>url:http://citeseer.ist.psu.edu/]]
267 * IEEE-Xplore: [[http:~~/~~/ieeexplore.ieee.org/Xplore/dynhome.jsp>>url:http://ieeexplore.ieee.org/Xplore/dynhome.jsp]]
268 * ACM Digital Library: [[http:~~/~~/portal.acm.org/dl.cfm>>url:http://portal.acm.org/dl.cfm]]
269 * Universitätsbibliothek Digitale Medien: [[http:~~/~~/www.uni-kiel.de/ub/emedien/index.html>>url:http://www.uni-kiel.de/ub/emedien/index.html]]
270
271
272 )))
273
274 (% style="display: none;" %)
275 (((
276 555
277 )))
278
279 (% style="display: none;" %)
280 (((
281 610
282 )))
283
284 (% style="display: none;" %)
285 (((
286 410
287 )))
288
289 (% style="display: none;" %)
290 (((
291 547
292 )))
293
294 (% style="display: none;" %)
295 (((
296 983
297 )))
298
299 (% style="display: none;" %)
300 (((
301 150
302 )))
303
304 (% style="display: none;" %)
305 (((
306 329
307 )))