Search Results

Documents authored by Frenkel, Sarah


Document
Computing Local 2-Separators

Authors: Sarah Frenkel and Johannes Carmesin

Published in: LIPIcs, Volume 398, 21st International Symposium on Parameterized and Exact Computation (IPEC 2026)


Abstract
Graph decompositions are the natural generalisation of tree decompositions where the decomposition tree is replaced by a genuine graph. Recently, they have found theoretical applications in sparsity theory, topological graph theory, structural graph theory, and geometric group theory. In this paper, we present the first efficient implementation of an algorithm to compute these graph decompositions.

Cite as

Sarah Frenkel and Johannes Carmesin. Computing Local 2-Separators. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{frenkel_et_al:LIPIcs.IPEC.2026.5,
  author =	{Frenkel, Sarah and Carmesin, Johannes},
  title =	{{Computing Local 2-Separators}},
  booktitle =	{21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
  pages =	{5:1--5:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-456-7},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{398},
  editor =	{Korhonen, Tuukka and Lampis, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.5},
  URN =		{urn:nbn:de:0030-drops-281780},
  doi =		{10.4230/LIPIcs.IPEC.2026.5},
  annote =	{Keywords: Tree decomposition, graph decomposition, local separator, parallel algorithm}
}

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail