scientific article; zbMATH DE number 7788458

DOI10.5555/3458064.3458184MaRDI QIDQ6147376zbMATH OpenFDO

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

Publication date 15 January 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(15)

• Transducing paths in graph classes with unbounded shrubdepth
• Existential characterizations of monadic NIP
• Cliquewidth and dimension
• On classes of bounded tree rank, their interpretations, and efficient sparsification
• Randomized communication and implicit graph representations
• Decomposition horizons and a characterization of stable hereditary classes of graphs
• Sparse graphs of twin-width 2 have bounded tree-width
• On first-order transductions of classes of graphs
• Polynomial kernel for immersion hitting in tournaments
• Decomposition horizons: from graph sparsity to model-theoretic dividing lines (extended abstract)
• Shallow vertex minors, stability, and dependence
• Compound logics for modification problems
• First-order transductions of graphs (invited talk)
• Extension preservation on dense graph classes
• Advances in algorithmic meta theorems (invited paper)

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