Changes for page 2025 Layout
Last modified by Maximilian Kasperowski on 2025/02/24 08:08
<
>
edited by Maximilian Kasperowski
on 2025/01/29 12:18
on 2025/01/29 12:18
edited by Maximilian Kasperowski
on 2025/01/29 12:20
on 2025/01/29 12:20
Change comment:
There is no comment for this version
Summary
-
Page properties (1 modified, 0 added, 0 removed)
Details
- Page properties
-
- Content
-
... ... @@ -55,18 +55,19 @@ 55 55 56 56 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]]** 57 57 58 -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]]** 59 - 60 60 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]]** 61 61 62 62 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]]** 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"]]** 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]]**