Wiki source code of 2025 Layout

Version 41.7 by Maximilian Kasperowski on 2025/01/29 12:00

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

Wiki source code of 2025 Layout

Navigation

Quick Links