{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:00:59Z","timestamp":1762272059911,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Czech Science Foundation","award":["14-03501S"],"award-info":[{"award-number":["14-03501S"]}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P26696 X-TRACT"],"award-info":[{"award-number":["P26696 X-TRACT"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2935314","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"176-184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["A New Perspective on FO Model Checking of Dense Graph Classes"],"prefix":"10.1145","author":[{"given":"J.","family":"Gajarsk\u00fd","sequence":"first","affiliation":[{"name":"Masaryk University, Brno"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Hlin\u011bn\u00fd","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Obdr\u017e\u00e1lek","sequence":"additional","affiliation":[{"name":"Masaryk University, Brno"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Lokshtanov","sequence":"additional","affiliation":[{"name":"University of Bergen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[{"name":"TU Wien"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603110"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00184-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.31"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","first-page":"140","volume-title":"Database Theory - ICDT '97, Proceedings","author":"Dong G.","year":"1997"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.20"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71879-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.63"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32589-2_38"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_24"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591851"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888935.1888998"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00023-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"J.\n       \n      Ne\u0161et\u0159il\n     and \n      \n        \n      P.\n\n  \n   \n  Ossona de Mendez. Sparsity: Graphs Structures and Algorithms volume \n  28\n   of \n  Algorithms and Combinatorics\n  . \n  Springer 2012\n  .   J. Ne\u0161et\u0159il and P. Ossona de Mendez. Sparsity: Graphs Structures and Algorithms volume 28 of Algorithms and Combinatorics. Springer 2012.","DOI":"10.1007\/978-3-642-27875-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500070079"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2935314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2935314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:53Z","timestamp":1750222493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2935314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":16,"alternative-id":["10.1145\/2933575.2935314","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2935314","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}