Linear rankwidth meets stability

DOI10.1137/1.9781611975994.72MaRDI QIDQ5146844zbMATH OpenOpenAlexFDO

Authors J. Nešetřil, Roman Rabinovich, P. Ossona de Mendez, Sebastian Siebertz

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(14)

• From \(\chi\)- to \(\chi_p\)-bounded classes
• Regular partitions of gentle graphs
• Bounds on half graph orders in powers of sparse graphs
• Treelike decompositions for transductions of sparse graphs
• Stable graphs of bounded twin-width
• Model checking on interpretations of classes of bounded local cliquewidth
• On classes of bounded tree rank, their interpretations, and efficient sparsification
• On first-order transductions of classes of graphs
• Polynomial kernel for immersion hitting in tournaments
• Elementary first-order model checking for sparse graphs
• Decomposition horizons: from graph sparsity to model-theoretic dividing lines (extended abstract)
• Compound logics for modification problems
• First-order transductions of graphs (invited talk)
• Advances in algorithmic meta theorems (invited paper)

This page was built for publication: Linear rankwidth meets stability

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