2 Search Results for "Jungeblut, Paul"


Document
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs

Authors: Miriam Goetze, Paul Jungeblut, and Torsten Ueckerdt

Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)


Abstract
It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs, and hence 3-edge-colorable. We provide an efficient recognition algorithm that given an n-vertex planar graph, augments this graph in 𝒪(n²) steps to a planar cubic bridgeless supergraph, or decides that no such augmentation is possible. The main tools involve the Generalized (Anti)factor-problem for the fixed embedding case, and SPQR-trees for the variable embedding case.

Cite as

Miriam Goetze, Paul Jungeblut, and Torsten Ueckerdt. Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{goetze_et_al:LIPIcs.ESA.2022.62,
  author =	{Goetze, Miriam and Jungeblut, Paul and Ueckerdt, Torsten},
  title =	{{Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs}},
  booktitle =	{30th Annual European Symposium on Algorithms (ESA 2022)},
  pages =	{62:1--62:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-247-1},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{244},
  editor =	{Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.62},
  URN =		{urn:nbn:de:0030-drops-170007},
  doi =		{10.4230/LIPIcs.ESA.2022.62},
  annote =	{Keywords: edge colorings, planar graphs, cubic graphs, generalized factors, SPQR-tree}
}
Document
The Complexity of the Hausdorff Distance

Authors: Paul Jungeblut, Linda Kleist, and Tillmann Miltzow

Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)


Abstract
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for the complexity class ∀∃_<ℝ. This implies that the problem is NP-, co-NP-, ∃ℝ- and ∀ℝ-hard.

Cite as

Paul Jungeblut, Linda Kleist, and Tillmann Miltzow. The Complexity of the Hausdorff Distance. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 48:1-48:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{jungeblut_et_al:LIPIcs.SoCG.2022.48,
  author =	{Jungeblut, Paul and Kleist, Linda and Miltzow, Tillmann},
  title =	{{The Complexity of the Hausdorff Distance}},
  booktitle =	{38th International Symposium on Computational Geometry (SoCG 2022)},
  pages =	{48:1--48:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-227-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{224},
  editor =	{Goaoc, Xavier and Kerber, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.48},
  URN =		{urn:nbn:de:0030-drops-160567},
  doi =		{10.4230/LIPIcs.SoCG.2022.48},
  annote =	{Keywords: Hausdorff Distance, Semi-Algebraic Set, Existential Theory of the Reals, Universal Existential Theory of the Reals, Complexity Theory}
}
  • Refine by Author
  • 2 Jungeblut, Paul
  • 1 Goetze, Miriam
  • 1 Kleist, Linda
  • 1 Miltzow, Tillmann
  • 1 Ueckerdt, Torsten

  • Refine by Classification
  • 1 Theory of computation → Computational geometry
  • 1 Theory of computation → Graph algorithms analysis

  • Refine by Keyword
  • 1 Complexity Theory
  • 1 Existential Theory of the Reals
  • 1 Hausdorff Distance
  • 1 SPQR-tree
  • 1 Semi-Algebraic Set
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 2 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail