Paul Jungeblut

activity

20182024

most citedTraining Fully Connected Neural Networks is

\exists R

-Complete

7 citations · 19 across the 9 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2024

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

We study the recognition complexity of subgraphs of k-connected planar cubic graphs for k = 1, 2, 3. We present polynomial-time algorithms to recognize subgraphs of 1- and 2-connec…

cs.DM2020

Guarding Quadrangulations and Stacked Triangulations with Edges

Paul Jungeblut, Torsten Ueckerdt

Let $G = (V, E)$ be a plane graph. A face $f$ of $G$ is guarded by an edge $v w \in E$ if at least one vertex from ${v, w}$ is on the boundary of $f$ . For a planar graph class $\mat…