P. Paetzold, R. Kehlbeck, H. Strobelt, Y. Xue, S. Storandt, and O. Deussen, “RectEuler: Visualizing Intersecting Sets using Rectangles,”
Computer Graphics Forum, vol. 42, no. 3, Art. no. 3, 2023, doi:
10.1111/cgf.14814.
BibTeX
Y. Zhang, K. Klein, O. Deussen, T. Gutschlag, and S. Storandt, “Robust Visualization of Trajectory Data,”
it - Information Technology, vol. 64, pp. 181–191, 2022, doi:
10.1515/itit-2022-0036.
BibTeX
P. Schäfer, N. Rodrigues, D. Weiskopf, and S. Storandt, “Group Diagrams for Simplified Representation of Scanpaths,” in
Proceedings of the ACM Symposium on Visual Information Communication and Interaction (VINCI), in Proceedings of the ACM Symposium on Visual Information Communication and Interaction (VINCI). ACM, Aug. 2022. doi:
10.1145/3554944.3554971.
BibTeX
T. Stankov and S. Storandt, “Maximum Gap Minimization in Polylines,” in
Web and Wireless Geographical Information Systems - 18th International Symposium, W2GIS 2020, Wuhan, China, November 13-14, 2020, Proceedings, in Web and Wireless Geographical Information Systems - 18th International Symposium, W2GIS 2020, Wuhan, China, November 13-14, 2020, Proceedings. 2020, pp. 181–196. doi:
10.1007/978-3-030-60952-8\_19.
BibTeX
H. Bast, P. Brosi, and S. Storandt, “Metro Maps on Octilinear Grid Graphs,” in
Computer Graphics Forum, in Computer Graphics Forum. Hoboken, New Jersey: Wiley-Blackwell - STM, 2020, pp. 357–367. doi:
10.1111/cgf13986.
BibTeX
J. Spoerhase, S. Storandt, and J. Zink, “Simplification of Polyline Bundles,” in
17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands, in 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands. 2020, pp. 35:1-35:20. doi:
10.4230/LIPIcs.SWAT.2020.35.
BibTeX
M. Beck and S. Storandt, “Puzzling Grid Embeddings,” in
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020, in Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020. 2020, pp. 94–105. doi:
10.1137/1.9781611976007.8.
BibTeX
P. Angelini, S. Chaplick, S. Cornelsen, and G. Da Lozzo, “Planar L-Drawings of Bimodal Graphs,” in
Graph Drawing and Network Visualization, D. Auber and P. Valtr, Eds., in Graph Drawing and Network Visualization. Cham: Springer International Publishing, 2020, pp. 205–219. doi:
10.1007/978-3-030-68766-3_17.
BibTeX
S. Cornelsen
et al., “Drawing Shortest Paths in Geodetic Graphs,” in
Graph Drawing and Network Visualization, D. Auber and P. Valtr, Eds., in Graph Drawing and Network Visualization. Cham: Springer International Publishing, 2020, pp. 333–340. doi:
10.1007/978-3-030-68766-3_26.
BibTeX
H. Bast, P. Brosi, and S. Storandt, “Efficient Generation of Geographically Accurate Transit Maps,” in
Proceedings of the ACM International Conference on Advances in Geographic Information Systems (SIGSPATIAL), F. B. Kashani, E. G. Hoel, R. H. Güting, R. Tamassia, and L. Xiong, Eds., in Proceedings of the ACM International Conference on Advances in Geographic Information Systems (SIGSPATIAL). ACM, 2018, pp. 13–22. doi:
10.1145/3274895.3274955.
BibTeX
S. Funke, T. Mendel, A. Miller, S. Storandt, and M. Wiebe, “Map Simplification with Topology Constraints: Exactly and in Practice,” in
Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX), S. P. Fekete and V. Ramachandran, Eds., in Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX). SIAM, 2017, pp. 185–196. doi:
10.1137/1.9781611974768.15.
BibTeX
S. Funke, N. Schnelle, and S. Storandt, “URAN: A Unified Data Structure for Rendering and Navigation,” in
Web and Wireless Geographical Information Systems. W2GIS 2017. Lecture Notes in Computer Science, vol. 10181, D. Brosset, C. Claramunt, X. Li, and T. Wang, Eds., in Web and Wireless Geographical Information Systems. W2GIS 2017. Lecture Notes in Computer Science, vol. 10181. , 2017, pp. 66–82. doi:
10.1007/978-3-319-55998-8_5.
BibTeX
D. Bahrdt
et al., “Growing Balls in ℝd,” in
Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX), S. P. Fekete and V. Ramachandran, Eds., in Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX). SIAM, 2017, pp. 247–258. doi:
10.1137/1.9781611974768.20.
BibTeX
S. Funke, A. Nusser, and S. Storandt, “On k-Path Covers and their Applications.,”
VLDB Journal, vol. 25, no. 1, Art. no. 1, 2016, doi:
10.1007/s00778-015-0392-3.
BibTeX
S. Funke, F. Krumpe, and S. Storandt, “Crushing Disks Efficiently,” in
Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science, vol. 9843, V. Mäkinen, S. J. Puglisi, and L. Salmela, Eds., in Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science, vol. 9843. , Springer International Publishing, 2016, pp. 43–54. doi:
10.1007/978-3-319-44543-4_4.
BibTeX