Paul Jungeblut

Orcid: 0000-0001-8241-2102

According to our database1, Paul Jungeblut authored at least 14 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The product structure of squaregraphs.
J. Graph Theory, February, 2024

The Complexity of the Hausdorff Distance.
Discret. Comput. Geom., January, 2024

Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs.
CoRR, 2024

Primal-Dual Cops and Robber.
Comput. Geom. Topol., 2024

2023
A Sublinear Bound on the Page Number of Upward Planar Graphs.
SIAM J. Discret. Math., December, 2023

Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete.
CoRR, 2023

Primal-Dual Cops and Robber.
CoRR, 2023

Cops and Robber - When Capturing Is Not Surrounding.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Training Fully Connected Neural Networks is ∃R-Complete.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Complexity of Lombardi Graph Drawing.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Directed Acyclic Outerplanar Graphs Have Constant Stack Number.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Multilevel Planarity.
J. Graph Algorithms Appl., 2021

2020
Guarding Quadrangulations and Stacked Triangulations with Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020


  Loading...