Matthias Pfretzschner

According to our database, Matthias Pfretzschner authored at least 6 papers between 2023 and 2024.

Collaborative distances:

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

2024

Level Planarity Is More Difficult Than We Thought.

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf

CoRR, 2024

Clustered Planarity Variants for Level Graphs.

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper

CoRR, 2024

Level Planarity Is More Difficult Than We Thought (Poster Abstract).

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Experimental Comparison of PC-Trees and PQ-Trees.

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter

ACM J. Exp. Algorithmics, December, 2023

Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1.

Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Parameterized Complexity of Simultaneous Planarity.

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023