Guarding Quadrangulations and Stacked Triangulations with Edges. - Paul Jungeblut; Torsten Ueckerdt (WG, 2020)

Multilevel Planarity. - Lukas Barth; Guido Brückner; Paul Jungeblut; Marcel Radermacher (J. Graph Algorithms Appl., 2021)

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. - Miriam Goetze; Paul Jungeblut; Torsten Ueckerdt (ESA, 2022)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number. - Paul Jungeblut; Laura Merker; Torsten Ueckerdt (FOCS, 2023)

On the Complexity of Lombardi Graph Drawing. - Paul Jungeblut (GD (1), 2023)

Training Fully Connected Neural Networks is ∃R-Complete. - Daniel Bertschinger; Christoph Hertrich; Paul Jungeblut; Tillmann Miltzow; Simon Weber 001 (NeurIPS, 2023)

Cops and Robber - When Capturing Is Not Surrounding. - Paul Jungeblut; Samuel Schneider; Torsten Ueckerdt (WG, 2023)

Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. - Nicholas Bieker; Thomas Bläsius; Emil Dohse; Paul Jungeblut (CoRR, 2023)

A Sublinear Bound on the Page Number of Upward Planar Graphs. - Paul Jungeblut; Laura Merker; Torsten Ueckerdt (SIAM J. Discret. Math., 2023)

Primal-Dual Cops and Robber. - Minh Tuan Ha; Paul Jungeblut; Torsten Ueckerdt; Pawel Zylinski (Comput. Geom. Topol., 2024)

Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs. - Miriam Goetze; Paul Jungeblut; Torsten Ueckerdt (CoRR, 2024)

Capturing the Computational Complexity of Geometric Problems by the First-Order Theory of the Reals - Paul Jungeblut (2024)

The Complexity of the Hausdorff Distance. - Paul Jungeblut; Linda Kleist; Tillmann Miltzow (Discret. Comput. Geom., 2024)

The product structure of squaregraphs. - Robert Hickingbotham; Paul Jungeblut; Laura Merker; David R. Wood (J. Graph Theory, 2024)