scientific article; zbMATH DE number 7489399

DOI10.4230/LIPICS.IPEC.2021.0zbMATH Open1482.68023MaRDI QIDQ5062015FDOQ5062015

Authors:

Publication date: 15 March 2022

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/15382/pdf/lipics-vol214-ipec2021-complete.pdf

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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)

Cited In (4)

• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
• Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded
• Twin-width can be exponential in treewidth
• Maximum matching in almost linear time on graphs of bounded clique-width

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