scientific article; zbMATH DE number 7788607

DOI10.4230/LIPICS.ISAAC.2021.34MaRDI QIDQ6147536zbMATH OpenFDO

Authors Michael Lampis, Valia Mitsou

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2109.10333

zbMATH Keywords

fine-grained complexitymodel-checkingvertex integrity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(11)

• Structural parameterizations of vertex integrity (best paper)
• Algorithmic meta-theorems for combinatorial reconfiguration revisited
• Structural parameterizations of vertex integrity
• On the parameterized complexity of computing good edge-labelings
• Core stability in additively separable hedonic games of low treewidth
• Algorithmic meta-theorems for combinatorial reconfiguration revisited
• Nearly-tight bounds for flow sparsifiers in quasi-bipartite graphs
• Parameterized vertex integrity revisited
• Combining crown structures for vulnerability measures
• Twin-width meets feedback edges and vertex integrity
• Core stability in additively separable hedonic games of low treewidth

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147536)