×

Found 24 Documents (Results 1–24)

Problems hard for treewidth but easy for stable gonality. (English) Zbl 07682403

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 84-97 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Anonymity-preserving space partitions. (English) Zbl 07788605

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 32, 16 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field