<
From version < 52.1 >
edited by Maximilian Kasperowski
on 2025/04/11 06:29
To version < 56.1 >
edited by Maximilian Kasperowski
on 2025/04/15 15:30
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -66,13 +66,13 @@
66 66  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"]]**
67 67  
68 68  
69 -**(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]]**
69 +**[RESERVED] (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]]**
70 70  
71 -**(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"]]**
71 +**[RESERVED] (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"]]**
72 72  
73 73  == Euler Diagrams ==
74 74  
75 -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]]**
75 +**[RESERVED] **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]]**
76 76  
77 77  Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, and Alexander Dobler. "Hoop Diagrams: A Set Visualization Method". 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]]**
78 78  
... ... @@ -249,7 +249,7 @@
249 249  
250 250  **[[The Tutorial>>url:https://wiki.rtsys.informatik.uni-kiel.de/bin/view/Seminars/EasyChair%20Tutorial/]]**
251 251  
252 -You can find our seminar in EasyChair: **[[Link>>url:https://easychair.org/conferences/?conf=kielrtsyssem24ss]]**
252 +You can find our seminar in EasyChair: **[[Link>>https://easychair.org/conferences/?conf=kielrtsyssem25ss]]**
253 253  
254 254  = Resources =
255 255