{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:15Z","timestamp":1750306335128,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2934517","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"397-406","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Order Invariance on Decomposable Structures"],"prefix":"10.1145","author":[{"given":"Michael","family":"Elberfeld","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marlin","family":"Frickenschmidt","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Grohe","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}],"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.2178\/jsl\/1231082307"},{"key":"e_1_3_2_1_2_1","volume-title":"Monadic second-order definable graph orderings. LMCS, 10(1)","author":"Blumensath A.","year":"2014","unstructured":"A. Blumensath and B. Courcelle . Monadic second-order definable graph orderings. LMCS, 10(1) , 2014 . A. Blumensath and B. Courcelle. Monadic second-order definable graph orderings. LMCS, 10(1), 2014."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934508"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/103654.103657"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00083-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00306-5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00578-9"},{"key":"e_1_3_2_1_9_1","series-title":"Encyclopedia of mathematics and its applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach","author":"Courcelle B.","year":"2012","unstructured":"B. Courcelle and J. Engelfriet . Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , volume 138 of Encyclopedia of mathematics and its applications . Cambridge University Press , 2012 . ISBN 978-0-521-89833-1. B. Courcelle and J. Engelfriet. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications. Cambridge University Press, 2012. ISBN 978-0-521-89833-1."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44522-8_22"},{"key":"e_1_3_2_1_11_1","first-page":"1","volume-title":"Canonizing Graphs of Bounded Tree Width in Logspace. In Proc. of STACS 2016","volume":"47","author":"Elberfeld M.","year":"2016","unstructured":"M. Elberfeld and P. Schweitzer . Canonizing Graphs of Bounded Tree Width in Logspace. In Proc. of STACS 2016 , volume 47 of LIPIcs, pages 32: 1 -- 32 :14. Schloss Dagstuhl LZI , 2016 . M. Elberfeld and P. Schweitzer. Canonizing Graphs of Bounded Tree Width in Logspace. In Proc. of STACS 2016, volume 47 of LIPIcs, pages 32:1--32:14. Schloss Dagstuhl LZI, 2016."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-47-1-57-103"},{"key":"e_1_3_2_1_13_1","first-page":"313","volume-title":"Proc. of STACS 2008","author":"Ganzow T.","year":"2008","unstructured":"T. Ganzow and S. Rubin . Order-invariant MSO is stronger than counting MSO in the finite . In Proc. of STACS 2008 , pages 313 -- 324 , 2008 . T. Ganzow and S. Rubin. Order-invariant MSO is stronger than counting MSO in the finite. In Proc. of STACS 2008, pages 313--324, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0099486"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01363288"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646513.759232"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements Of Finite Model Theory","author":"Libkin L.","year":"2004","unstructured":"L. Libkin . Elements Of Finite Model Theory . Springer , 2004 . L. Libkin. Elements Of Finite Model Theory. Springer, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.28"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2003.11.002"},{"key":"e_1_3_2_1_20_1","volume-title":"Das Geschlecht des vollst\u00e4ndigen paaren Graphen. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg, 28(3):139--150","author":"Ringel G.","year":"1965","unstructured":"G. Ringel . Das Geschlecht des vollst\u00e4ndigen paaren Graphen. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg, 28(3):139--150 , 1965 . G. Ringel. Das Geschlecht des vollst\u00e4ndigen paaren Graphen. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg, 28(3):139--150, 1965."},{"key":"e_1_3_2_1_21_1","volume-title":"Der vollst\u00e4ndige paare Graph auf nichtorientierbaren Fl\u00e4chen. Journal f\u00fcr die reine und angewandte Mathematik, 220: 88--93","author":"Ringel G.","year":"1965","unstructured":"G. Ringel . Der vollst\u00e4ndige paare Graph auf nichtorientierbaren Fl\u00e4chen. Journal f\u00fcr die reine und angewandte Mathematik, 220: 88--93 , 1965 . G. Ringel. Der vollst\u00e4ndige paare Graph auf nichtorientierbaren Fl\u00e4chen. Journal f\u00fcr die reine und angewandte Mathematik, 220: 88--93, 1965."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38536-0_10"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90051-2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"}],"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.2934517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2934517","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.2934517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":24,"alternative-id":["10.1145\/2933575.2934517","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2934517","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"}}]}}