Paul Jungeblut

According to our database, Paul Jungeblut authored at least 14 papers between 2019 and 2024.

Collaborative distances:

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

2024

The product structure of squaregraphs.

Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood

J. Graph Theory, February, 2024

Capturing the Computational Complexity of Geometric Problems by the First-Order Theory of the Reals

Paul Jungeblut

PhD thesis, 2024

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

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

CoRR, 2024

Primal-Dual Cops and Robber.

Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski

Comput. Geom. Topol., 2024

2023

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

Nicholas Bieker, Thomas Bläsius, Emil Dohse, Paul Jungeblut

CoRR, 2023

Cops and Robber - When Capturing Is Not Surrounding.

Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt

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

Training Fully Connected Neural Networks is ∃R-Complete.

Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber

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.

Paul Jungeblut

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

Directed Acyclic Outerplanar Graphs Have Constant Stack Number.

Paul Jungeblut, Laura Merker, Torsten Ueckerdt

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

A Sublinear Bound on the Page Number of Upward Planar Graphs.

Paul Jungeblut, Laura Merker, Torsten Ueckerdt

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs.

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

The Complexity of the Hausdorff Distance.

Paul Jungeblut, Linda Kleist, Tillmann Miltzow

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2020

Guarding Quadrangulations and Stacked Triangulations with Edges.

Paul Jungeblut, Torsten Ueckerdt

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

2019

Multilevel Planarity.

Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019