Parameterized circuit complexity of model-checking on sparse structures-Reference-Cited by-同舟云学术

Parameterized circuit complexity of model-checking on sparse structures

Published:2018-07-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Pilipczuk Michał¹,Siebertz Sebastian¹,Toruńczyk Szymon¹

Affiliation:

1. Institute of Informatics, University of Warsaw, Poland

Funder

Fundacja na rzecz Nauki Polskiej

H2020 Marie SkBodowska-Curie Actions

Narodowe Centrum Nauki

Publisher

ACM

Link

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

Reference31 articles.

1. Efficient computation of implicit representations of sparse graphs

2. Network decomposition and locality in distributed computation

3. Max Bannach and Till Tantau. 2017. Computing Hitting Set Kernels By AC0-Circuits. (2017). Manuscript accepted for publication at STACS 2018. Max Bannach and Till Tantau. 2017. Computing Hitting Set Kernels By AC0-Circuits. (2017). Manuscript accepted for publication at STACS 2018.

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

1. Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models;The Electronic Journal of Combinatorics;2023-09-22

2. Monadic NIP in monotone classes of relational structures;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

3. Polynomial bounds for centered colorings on proper minor-closed graph classes;Journal of Combinatorial Theory, Series B;2021-11

4. On the Descriptive Complexity of Color Coding;Algorithms;2021-03-19

5. Model-Checking on Ordered Structures;ACM Transactions on Computational Logic;2020-03-18