Maximilian Pfister

Orcid: 0000-0002-7203-0669

Affiliations:
  • University of Tübingen, Germany


According to our database1, Maximilian Pfister authored at least 14 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On the maximum number of edges of outer k-planar graphs.
CoRR, May, 2025

A first view on the density of 5-planar graphs.
CoRR, May, 2025

2024
Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Simultaneous Drawing of Layered Trees.
Proceedings of the WALCOM: Algorithms and Computation, 2024

On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023
Weakly and Strongly Fan-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Axis-Parallel Right Angle Crossing Graphs.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
On morphs of 1-plane graphs.
J. Comput. Geom., 2022

RAC Drawings of Graphs with Low Degree.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

The Thickness of Fan-Planar Graphs is At Most Three.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021
On Morphing 1-Planar Drawings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020
Drawing Shortest Paths in Geodetic Graphs.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2018
Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Beyond-Planarity: Density Results for Bipartite Graphs.
CoRR, 2017


  Loading...