2021/22 Layout

(((

(% class="bodytext" style="text-align: left;" %)

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

= Imprtant 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;" %)

(((

Lecturers

)))|(((

Reinhard von Hanxleden (rvh@informatik.uni-kiel.de)

27

Sören Domrös (sdo@informatik.uni-kiel.de)

28

)))

29

|=(% style="text-align: right;" %)(% style="text-align: right;" %)

(((

Block seminar day

)))|(((

29.01.22

)))

= Topics =

(% class="bodytext" style="text-align: left;" %)

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.

40

41

(% class="bodytext" style="text-align: left;" %)

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.

43

44

45

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.

== ==

== Aesthetics and Perception ==

51

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"]]**--

53

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

== Human Computer Interaction ==

59

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"]]--

61

62

--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"]]--

63

64

--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"]]**--

65

66

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"]]

== Graph Drawing ==

**(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"]]**

71

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

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

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

78

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"]]**

== Euler Diagrams ==

--Bottoni, Costagliola, and Fish. "Euler diagram encodings." In //International Conference on Theory and Application of Diagrams//, pp. 148-162. Springer, 2012. [[**PDF**>>url:https://www.researchgate.net/publication/262172961_Euler_Diagram_Encodings||shape="rect"]]--

83

84

--Chapman, Stapleton, Rodgers, Micallef, and Blake. "Visualizing sets: an empirical comparison of diagram types." In //International Conference on Theory and Application of Diagrams//, pp. 146-160. Springer, 2014. [[**PDF**>>url:http://eprints.brighton.ac.uk/13703/1/diagrams2014%20Visualizing%20DataREVISED.pdf||shape="rect"]]--

85

86

== Other Types of Diagrams ==

87

88

--Erwig and Smeltzer. "Variational Pictures." In //International Conference on Theory and Application of Diagrams//, pp. 55-70. Springer, 2018. **[[Seite mit PDF>>doc:Seminars.WS2122 (Layout).SS20 Eingeschränkt sichtbare Paper]]**--

= Schedule =

== Dates in the semester (currently not final) ==

93

94

(% class="relative-table wrapped" style="width:52.6894%" %)

|=(((

Datum

)))|=(((

Meilenstein

)))

|(((

Mo., 25.10., 23:59

)))|(((

Deadline for topic

)))

|(((

Mo., 25.10., 12:00

)))|(((

Kick-off

//The kick-off will take place online. We will send you the corresponding link.//

)))

|(((

Mo., 15.11., 23:59

)))|(((

Deadline of the first draft in EasyChair

115

//Content: abstract, introduction, outline, notes for chapter contents, bibliography//

116

)))

117

|(% colspan="1" %)(% colspan="1" %)

118

(((

119

In week of above, individual dates

120

)))|(% colspan="1" %)(% colspan="1" %)

121

(((

122

Individual dates

123

//Online, as discussed with advisor//

124

)))

125

|(% colspan="1" %)(% colspan="1" %)

126

(((

127

Mo., 13.12, 23:59

128

)))|(% colspan="1" %)(% colspan="1" %)

129

(((

130

Deadline of the first full version

131

//Submission-Update in EasyChair//

132

)))

133

|(% colspan="1" %)(% colspan="1" %)

134

(((

135

In week of above, individual dates

136

)))|(% colspan="1" %)(% colspan="1" %)

137

(((

138

Individual dates

139

//Online, as discussed with advisor//

140

)))

141

|(% colspan="1" %)(% colspan="1" %)

142

(((

143

Mo., 10.01., 23:59

144

)))|(% colspan="1" %)(% colspan="1" %)

145

(((

146

Deadline of the review version

147

//Submission-Update in EasyChair//

148

)))

149

|(% colspan="1" %)(% colspan="1" %)

150

(((

151

subsequently

152

)))|(% colspan="1" %)(% colspan="1" %)

(((

Review assignment

//By e-mail//

)))

|(% colspan="1" %)(% colspan="1" %)

158

(((

159

Mo., 17.01., 23:59

160

)))|(% colspan="1" %)(% colspan="1" %)

(((

Deadline reviews

//In EasyChair//

)))

|(% colspan="1" %)(% colspan="1" %)

166

(((

167

tbd

168

)))|(% colspan="1" %)(% colspan="1" %)

169

(((

170

Talk on how to do talks/presentations (the talk-talk)?

171

)))

172

|(% colspan="1" %)(% colspan="1" %)

173

(((

174

In the week of Mo., 10.01.

175

)))|(% colspan="1" %)(% colspan="1" %)

176

(((

177

Individual dates for presentation slides

178

//Online, as discussed with advisor. The slides have to be available online or have been sent beforehand via e-mail.//

179

)))

180

|(% colspan="1" %)(% colspan="1" %)

181

(((

182

Mo., 24.01., 23:59

183

)))|(% colspan="1" %)(% colspan="1" %)

184

(((

185

Deadline final version

186

//Submission-Update in EasyChair//

187

)))

188

|(% colspan="1" %)(% colspan="1" %)

189

(((

190

Sa. 29.1.

191

)))|(% colspan="1" %)(% colspan="1" %)

(((

Presentations

)))

== The Final Presentations ==

197

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.

199

200

= Schedule and Grading =

201

202

== Papers, Talks, Review ==

203

204

This seminar includes the creation of a paper, a talk, and two reviews.

=== Paper ===

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.

209

210

=== Talk/Discussions ===

211

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.

213

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.

=== Review ===

A review consist of two parts:

219

220

1. General comments (what do you like / not like regarding content, structure, and readability) as well as general suggestions to improve the paper

221

1. In detail remarks and corrections

222

223

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.

224

225

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.

226

227

The reviews are assigned after the review-version deadline and are based on the submitted version of the papers.

== Grades ==

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.

232

233

= Technical Details =

== LaTeX ==

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.

238

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.

240

241

While writing your paper keep the following in mind:

242

243

* Think about whether you want to write your paper in German or English and make use to use the corresponding ACM-style.

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.

245

* A paper always consists of an introduction, at least one main chapter, and a conclusion.

246

247

== EasyChair Tutorial ==

248

249

You can find our seminar in EasyChair [[here>>url:https://easychair.org/my/conference?conf=kielrtsyssem21ws||shape="rect"]].

= Ressources =

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:

256

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"]]

)))

(% style="display: none;" %)

268

(((

269

555

270