scientific article; zbMATH DE number 7638379

DOI10.4230/LIPICS.IPEC.2022.0MaRDI QIDQ5872927zbMATH OpenFDO

Authors

Publication date 4 January 2023

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2022/17355/pdf/lipics-vol249-ipec2022-complete.pdf

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cited in

(6)

• Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10--12, 2014. Revised selected papers
• 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
• Twin-width and transductions of proper \(k\)-mixed-thin graphs
• XNLP-completeness for parameterized problems on graphs with a linear structure

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 Q5872927)