Treelike Decompositions for Transductions of Sparse Graphs-Reference-Cited by-同舟云学术

Treelike Decompositions for Transductions of Sparse Graphs

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Dreier Jan¹,Gajarský Jakub²,Kiefer Sandra³,Pilipczuk Michał²,Toruńczyk Szymon²

Affiliation:

1. TU Wien, Austria

2. University of Warsaw, Poland

3. Max Planck Institute for Software Systems, Germany

Funder

European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3533349

Reference22 articles.

1. Twin-width II: small classes

2. Twin-width I: tractable FO model checking

3. Édouard Bonnet , Jaroslav Nešetřil , Patrice Ossona de Mendez , Sebastian Siebertz, and Stéphan Thomassé. 2021 . Twin-width and permutations. CoRR abs/2102.06880(2021). arXiv:2102.06880https://arxiv.org/abs/2102.06880 Édouard Bonnet, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz, and Stéphan Thomassé. 2021. Twin-width and permutations. CoRR abs/2102.06880(2021). arXiv:2102.06880https://arxiv.org/abs/2102.06880

4. Erdös--Hajnal Properties for Powers of Sparse Graphs

5. Jan Dreier . 2021 . Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021 . IEEE, 1–13. https://doi.org/10.1109/LICS52264.2021.9470680 Jan Dreier. 2021. Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021. IEEE, 1–13. https://doi.org/10.1109/LICS52264.2021.9470680

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Flip-width: Cops and Robber on dense graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Decomposition horizons: from graph sparsity to model-theoretic dividing lines;European Conference on Combinatorics, Graph Theory and Applications;2023-08-28

3. Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes;Logical Methods in Computer Science;2023-06-06

4. First-Order Model Checking on Structurally Sparse Graph Classes;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02