{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:54:10Z","timestamp":1781855650528,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"H2020 Marie SkBodowska-Curie Actions","award":["665778"],"award-info":[{"award-number":["665778"]}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["UMO-2015\/19\/P\/ST6\/03998 and 2016\/21\/D\/ST6\/01485"],"award-info":[{"award-number":["UMO-2015\/19\/P\/ST6\/03998 and 2016\/21\/D\/ST6\/01485"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001870","name":"Fundacja na rzecz Nauki Polskiej","doi-asserted-by":"publisher","award":["START stipend"],"award-info":[{"award-number":["START stipend"]}],"id":[{"id":"10.13039\/501100001870","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209136","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"789-798","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Parameterized circuit complexity of model-checking on sparse structures"],"prefix":"10.1145","author":[{"given":"Micha\u0142","family":"Pilipczuk","sequence":"first","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Siebertz","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Szymon","family":"Toru\u0144czyk","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00007-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63504"},{"key":"e_1_3_2_1_3_1","volume-title":"IPEC 2015 (LIPIcs)","volume":"43","author":"Bannach Max","year":"2015","unstructured":"Max Bannach, Christoph Stockhusen, and Till Tantau. 2015. Fast Parallel Fixed-parameter Algorithms via Color Coding. In IPEC 2015 (LIPIcs), Vol. 43. Schloss Dagstuhl --- Leibniz-Zentrum f\u00fcr Informatik, 224--235."},{"key":"e_1_3_2_1_4_1","volume-title":"Parallel Multivariate Meta-Theorems. In IPEC 2016 (LIPIcs)","volume":"63","author":"Bannach Max","year":"2016","unstructured":"Max Bannach and Till Tantau. 2016. Parallel Multivariate Meta-Theorems. In IPEC 2016 (LIPIcs), Vol. 63. Schloss Dagstuhl --- Leibniz-Zentrum f\u00fcr Informatik, 4:1--4:17."},{"key":"e_1_3_2_1_5_1","volume-title":"Computing Hitting Set Kernels By AC0-Circuits. (2017). Manuscript, accepted for publication at STACS","author":"Bannach Max","year":"2018","unstructured":"Max Bannach and Till Tantau. 2017. Computing Hitting Set Kernels By AC0-Circuits. (2017). Manuscript, accepted for publication at STACS 2018."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979675"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0088-2"},{"key":"e_1_3_2_1_8_1","volume-title":"Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. In CSL 2017 (LIPIcs)","volume":"82","author":"Chen Yijia","year":"2017","unstructured":"Yijia Chen, J\u00f6rg Flum, and Xuangui Huang. 2017. Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. In CSL 2017 (LIPIcs), Vol. 82. Schloss Dagstuhl --- Leibniz-Zentrum f\u00fcr Informatik, 19:1--19:16."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2815661"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.31"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2568438"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2012.12.004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499483"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9944-y"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799360768"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121738"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28429"},{"key":"e_1_3_2_1_19_1","volume-title":"Contemporary Mathematics","volume":"558","author":"Grohe Martin","year":"2011","unstructured":"Martin Grohe and Stephan Kreutzer. 2011. Methods for Algorithmic Meta Theorems. In Model Theoretic Methods in Finite Combinatorics, M. Grohe and J.A. Makowsky (Eds.). Contemporary Mathematics, Vol. 558. American Mathematical Society, 181--206."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53174-7_23"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051095"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.07.013"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1278682204"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.01.006"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.07.014"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2230458"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-015-0251-x"},{"key":"e_1_3_2_1_29_1","unstructured":"Micha\u0142 Pilipczuk and Sebastian Siebertz. Winter Semester 2017\/18. Lecture notes for the course \"Sparsity\" given at Faculty of Mathematics Informatics and Mechanics of the University of Warsaw. (Winter Semester 2017\/18). Available at https:\/\/www.mimuw.edu.pl\/~mp248287\/sparsity."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80203-8"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.03.024"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209136","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:32:55Z","timestamp":1781854375000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":31,"alternative-id":["10.1145\/3209108.3209136","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209136","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}