default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Jungeblut
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Paul Jungeblut
:
Capturing the Computational Complexity of Geometric Problems by the First-Order Theory of the Reals. Karlsruhe University, Germany, 2024- [j5]Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski:
Primal-Dual Cops and Robber. Comput. Geom. Topol. 3(2): 4:1-4:12 (2024) - [j4]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. Discret. Comput. Geom. 71(1): 177-213 (2024) - [j3]Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood:
The product structure of squaregraphs. J. Graph Theory 105(2): 179-191 (2024) - [i12]Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs. CoRR abs/2401.05892 (2024) - 2023
- [j2]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
A Sublinear Bound on the Page Number of Upward Planar Graphs. SIAM J. Discret. Math. 37(4): 2312-2331 (2023) - [c9]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
Directed Acyclic Outerplanar Graphs Have Constant Stack Number. FOCS 2023: 1937-1952 - [c8]Paul Jungeblut:
On the Complexity of Lombardi Graph Drawing. GD (1) 2023: 180-194 - [c7]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber:
Training Fully Connected Neural Networks is ∃R-Complete. NeurIPS 2023 - [c6]Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt:
Cops and Robber - When Capturing Is Not Surrounding. WG 2023: 403-416 - [i11]Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt:
Primal-Dual Cops and Robber. CoRR abs/2301.05514 (2023) - [i10]Nicholas Bieker, Thomas Bläsius, Emil Dohse, Paul Jungeblut:
Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃R-Complete. CoRR abs/2301.05550 (2023) - [i9]Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt:
Cops and Robber - When Capturing is not Surrounding. CoRR abs/2302.10577 (2023) - [i8]Paul Jungeblut:
On the Complexity of Lombardi Graph Drawing. CoRR abs/2306.02649 (2023) - 2022
- [c5]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. SoCG 2022: 48:1-48:17 - [c4]Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. ESA 2022: 62:1-62:14 - [c3]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
A Sublinear Bound on the Page Number of Upward Planar Graphs. SODA 2022: 963-978 - [i7]Daniel Bertschinger, Christoph Hertrich, Paul Jungeblut, Tillmann Miltzow, Simon Weber:
Training Fully Connected Neural Networks is ∃R-Complete. CoRR abs/2204.01368 (2022) - [i6]Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. CoRR abs/2204.11750 (2022) - [i5]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
Directed Acyclic Outerplanar Graphs Have Constant Stack Number. CoRR abs/2211.04732 (2022) - 2021
- [j1]Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. J. Graph Algorithms Appl. 25(1): 151-170 (2021) - [i4]Paul Jungeblut, Laura Merker, Torsten Ueckerdt:
A Sublinear Bound on the Page Number of Upward Planar Graphs. CoRR abs/2107.05227 (2021) - [i3]Paul Jungeblut, Linda Kleist, Tillmann Miltzow:
The Complexity of the Hausdorff Distance. CoRR abs/2112.04343 (2021) - 2020
- [c2]Paul Jungeblut, Torsten Ueckerdt:
Guarding Quadrangulations and Stacked Triangulations with Edges. WG 2020: 14-26 - [i2]Paul Jungeblut, Torsten Ueckerdt:
Guarding Quadrangulations and Stacked Triangulations with Edges. CoRR abs/2006.13722 (2020)
2010 – 2019
- 2019
- [c1]Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. WALCOM 2019: 219-231 - 2018
- [i1]Lukas Barth, Guido Brückner, Paul Jungeblut, Marcel Radermacher:
Multilevel Planarity. CoRR abs/1810.13297 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
