1-Fan-bundle-planar drawings of graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Philipp Kindermann; Thomas Schneck (Theor. Comput. Sci., 2018)

Drawing Planar Graphs with Few Segments on a Polynomial Grid. - Philipp Kindermann; Tamara Mchedlidze; Thomas Schneck; Antonios Symvonis (GD, 2019)

2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth. - Patrizio Angelini; Giordano Da Lozzo; Henry Förster; Thomas Schneck (GD, 2020)

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Thomas Schneck (J. Graph Algorithms Appl., 2020)

Drawing Shortest Paths in Geodetic Graphs. - Sabine Cornelsen; Maximilian Pfister 002; Henry Förster; Martin Gronemann; Michael Hoffmann 001; Stephen G. Kobourov; Thomas Schneck (J. Graph Algorithms Appl., 2022)

2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth. - Patrizio Angelini; Giordano Da Lozzo; Henry Förster; Thomas Schneck (Comput. J., 2024)