scientific article; zbMATH DE number 7638379
From MaRDI portal
Publication:5872927
DOI10.4230/LIPIcs.IPEC.2022.0zbMath1502.68027MaRDI QIDQ5872927
No author found.
Publication date: 4 January 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2022/17355/pdf/lipics-vol249-ipec2022-complete.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (3)
Twin-width can be exponential in treewidth ⋮ Neighbourhood complexity of graphs of bounded twin-width ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width
This page was built for publication:
