Summary

• Page properties (1 modified, 0 added, 0 removed)

Details

Page properties

Content

...	...	@@ -9,7 +9,7 @@
9	9
10	10
11	11	(% style="text-align: left;" %)
12		-= Important Dates =
	12	+= Imprtant Dates =
13	13
14	14	(% class="wrapped" %)
15	15	|=(% colspan="1" style="text-align: right;" %)(% colspan="1" style="text-align: right;" %)
...	...	@@ -23,38 +23,38 @@
23	23	(((
24	24	Lecturers
25	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]])
	26	+Reinhard von Hanxleden (rvh@informatik.uni-kiel.de)
	27	+Sören Domrös (sdo@informatik.uni-kiel.de)
29	29	)))
30	30	|=(% style="text-align: right;" %)(% style="text-align: right;" %)
31	31	(((
32	32	Block seminar day
33	33	)))|(((
34		-tbd
	33	+29.01.22
35	35	)))
36	36
37	37	= Topics =
38	38
39	39	(% class="bodytext" style="text-align: left;" %)
40		-You may choose one of the following papers from the different topics.
	39	+You may choose one of the following papers from the different topics. The papers marked with a are the ones that we deemed more important.
41	41
42	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]])
	42	+The papers are assigned via //first-come-first-serve//. Already taken papers are crossed out. Many of the links do only work in the university network. If any problems occur feel free to contact us.
44	44
45		-(% class="bodytext" style="text-align: left;" %)
46		-Many of the links do only work in the university network. If any problems occur feel free to contact us.
47		-
48	48	{{info}}
49	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 sdo.
50	50	{{/info}}
51	51
52		-== ==
	48	+== ==
53	53
54	54	== Aesthetics and Perception ==
55	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]]**
	52	+-- 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"]]**--
57	57
	54	+--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"]]--
	55	+
	56	+--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"]]**--
	57	+
58	58	== Human Computer Interaction ==
59	59
60	60	--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"]]--
...	...	@@ -67,12 +67,14 @@
67	67
68	68	== Graph Drawing ==
69	69
70		-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]]**
71		-
72	72	**(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"]]**
73	73
	72	+-- 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"]]--
	73	+
74	74	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"]]
75	75
	76	+--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"]]**--
	77	+
76	76	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"]]**
77	77
78	78	== Euler Diagrams ==
...	...	@@ -93,7 +93,7 @@
93	93	|=(((
94	94	Datum
95	95	)))|=(((
96		-Milestone
	98	+Meilenstein
97	97	)))
98	98	|(((
99	99	Mo., 25.10., 23:59
...	...	@@ -193,37 +193,29 @@
193	193
194	194	== The Final Presentations ==
195	195
196		-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.
	198	+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 beginning of January.
197	197
198		-=== Agenda ===
199		-
200		-**tbd**
201		-
202	202	= Schedule and Grading =
203	203
204	204	== Papers, Talks, Review ==
205	205
206		-This seminar includes creating a paper, a talk, and two reviews.
	204	+This seminar includes the creation of a paper, a talk, and two reviews.
207	207
208	208	=== Paper ===
209	209
210		-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.
	208	+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:Theses.Writing and Grading Theses.WebHome||shape="rect"]] for writing a thesis.
211	211
212		-=== Talk ===
	210	+=== Talk/Discussions ===
213	213
214		-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.
	212	+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.
215	215
216		-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.
	214	+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.
217	217
218		-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.
219		-
220		-The talk can be held in English or German.
221		-
222	222	=== Review ===
223	223
224	224	A review consist of two parts:
225	225
226		-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. General comments (what do you like / not like regarding content, structure, and readability) as well as general suggestions to improve the paper
227	227	1. In detail remarks and corrections
228	228
229	229	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.
...	...	@@ -230,45 +230,43 @@
230	230
231	231	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.
232	232
233		-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]].
234		-
235	235	The reviews are assigned after the review-version deadline and are based on the submitted version of the papers.
236	236
237	237	== Grades ==
238	238
239		-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.
	231	+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.
240	240
241	241	= Technical Details =
242	242
243		-=== LaTeX ===
	235	+== LaTeX ==
244	244
245		-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.
	237	+Your papers should be created using LaTeX and have to be in the ACM style. You can find all necessary files in this [[zip archive>>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.
246	246
247		-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.
	239	+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||shape="rect"]] of bibliography entries.
248	248
249	249	While writing your paper keep the following in mind:
250	250
251	251	* Think about whether you want to write your paper in German or English and make use to use the corresponding ACM-style.
252		-* 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.
	244	+* Graphics from your original paper should not just be screenshotted and added to your paper. Ideally, you create your own graphic (ideally as a vector graphic) to have good quality graphics.
253	253	* A paper always consists of an introduction, at least one main chapter, and a conclusion.
254	254
255		-=== EasyChair Tutorial ===
	247	+== EasyChair Tutorial ==
256	256
257		-**[[The Tutorial>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/view/Seminars/EasyChair%20Tutorial/]]**
	249	+You can find our seminar in EasyChair [[here>>url:https://easychair.org/my/conference?conf=kielrtsyssem21ws||shape="rect"]].
258	258
259		-You can find our seminar in EasyChair: **[[Link>>url:https://easychair.org/conferences/?conf=kielrtsyssem24ss]]**
260	260
261		-= Resources =
	252	+= Ressources =
262	262
263		-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:
264	264
265		-* Google Scholar: [[http:~~/~~/scholar.google.de/>>url:http://scholar.google.de/]]
266		-* dblp: [[http:~~/~~/dblp.uni-trier.de/>>url:http://dblp.uni-trier.de/]]
267		-* CiteSeer: [[http:~~/~~/citeseer.ist.psu.edu/>>url:http://citeseer.ist.psu.edu/]]
268		-* IEEE-Xplore: [[http:~~/~~/ieeexplore.ieee.org/Xplore/dynhome.jsp>>url:http://ieeexplore.ieee.org/Xplore/dynhome.jsp]]
269		-* ACM Digital Library: [[http:~~/~~/portal.acm.org/dl.cfm>>url:http://portal.acm.org/dl.cfm]]
270		-* Universitätsbibliothek Digitale Medien: [[http:~~/~~/www.uni-kiel.de/ub/emedien/index.html>>url:http://www.uni-kiel.de/ub/emedien/index.html]]
	255	+In general, it is advised to look for related work in the university network since you will get access to many online libraries. We the following search engines and web pages:
271	271
	257	+* Google Scholar: [[http:~~/~~/scholar.google.de/>>url:http://scholar.google.de/||shape="rect" class="external-link"]]
	258	+* dblp: [[http:~~/~~/dblp.uni-trier.de/>>url:http://dblp.uni-trier.de/||shape="rect"]]
	259	+* CiteSeer: [[http:~~/~~/citeseer.ist.psu.edu/>>url:http://citeseer.ist.psu.edu/||shape="rect" class="external-link"]]
	260	+* IEEE-Xplore: [[http:~~/~~/ieeexplore.ieee.org/Xplore/dynhome.jsp>>url:http://ieeexplore.ieee.org/Xplore/dynhome.jsp||shape="rect" class="external-link"]]
	261	+* ACM Digital Library: [[http:~~/~~/portal.acm.org/dl.cfm>>url:http://portal.acm.org/dl.cfm||shape="rect" class="external-link"]]
	262	+* Universitätsbibliothek Digitale Medien: [[http:~~/~~/www.uni-kiel.de/ub/emedien/index.html>>url:http://www.uni-kiel.de/ub/emedien/index.html||shape="rect"]]
	263	+
272	272
273	273	)))
274	274