Summary

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

Details

Page properties

Content

...	...	@@ -31,14 +31,12 @@
31	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	32
33	33	(% class="bodytext" style="text-align: left;" %)
34		-Many of the links do only work in the university network. If any problems occur feel free to contact us.
	34	+Many of the links only work in the university network.
35	35
36	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 contact mka.
	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	38	{{/info}}
39	39
40		-== ==
41		-
42	42	== Aesthetics and Perception ==
43	43
44	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]]**
...	...	@@ -57,16 +57,19 @@
57	57
58	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]]**
59	59
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	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	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"]]**
	60	+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]]**
65	65
66	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	67
68	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	69
	66	+
	67	+**(Master) **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]]**
	68	+
	69	+**(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"]]**
	70	+
70	70	== Euler Diagrams ==
71	71
72	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]]**
...	...	@@ -77,6 +77,10 @@
77	77
78	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	79
	81	+== Diagramming Tools ==
	82	+
	83	+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]]**
	84	+
80	80	= Schedule =
81	81
82	82	== Dates in the semester ==