scientific article; zbMATH DE number 7650213
From MaRDI portal
Publication:5875537
DOI10.4230/LIPICS.IPEC.2019.5MaRDI QIDQ5875537
Publication date: 3 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (3)
Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Hardness of metric dimension in graphs of constant treewidth ⋮ Parameterized Complexity of Geodetic Set
This page was built for publication:
