Thomas Schneck

According to our database, Thomas Schneck authored at least 6 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

2-Layer <i>k</i>-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth.

Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck

Comput. J., 2024

2022

Drawing Shortest Paths in Geodetic Graphs.

Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck

J. Graph Algorithms Appl., 2022

2020

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity.

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck

J. Graph Algorithms Appl., 2020

2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth.

Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Drawing Planar Graphs with Few Segments on a Polynomial Grid.

Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

1-Fan-bundle-planar drawings of graphs.

Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck

Theor. Comput. Sci., 2018