{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:42Z","timestamp":1730280702995,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785682","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":10,"title":["Canonisation and Definability for Graphs of Bounded Rank Width"],"prefix":"10.1109","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Neuen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.10.006"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21676-7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.02.001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_33"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005107"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4478-3_5"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/140999980"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.42"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s002249910009"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.03.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00184-5"},{"journal-title":"Finite Model Theory","year":"1999","author":"ebbinghaus","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45477-2_12"},{"journal-title":"Finite Model Theory and Its Applications","year":"2007","author":"gr\u00e4del","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56992-8_15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1998.705639"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335313"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/9781139028868"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49257-7_6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/3209108.3209135","article-title":"Definable decompositions for graphs of bounded linear cliquewidth","author":"boja?czyk","year":"2018","journal-title":"Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science LICS 2018"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0070"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90013-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90012-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01204169"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(95)94698-V"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90004-G"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2822890"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/120892234"},{"key":"ref22","first-page":"67: 1","article-title":"An improved isomorphism test for bounded-tree-width graphs","volume":"107","author":"grohe","year":"2018","journal-title":"45th International Colloquium on Automata Languages and Programming ICALP 2018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785682"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/15M1027565"},{"key":"ref41","first-page":"147","article-title":"The isomorphism problem for classes of graphs that are invariant with respect to contraction","volume":"174","author":"ponomarenko","year":"1988","journal-title":"Zap Nauchn Semin Leningrad Otdel Math Inst Steklov (LOMI)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.66"},{"key":"ref44","article-title":"The reduction of a graph to canonical form and the algebra which appears therein","author":"weisfeiler","year":"1968","journal-title":"NTI Series 2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(86)90055-2"},{"key":"ref43","first-page":"137","article-title":"The complexity of relational query languages","author":"vardi","year":"1982","journal-title":"Proceedings of the 14th ACM Symposium on Theory of Computing"},{"key":"ref25","first-page":"1","article-title":"Logic and the challenge of computer science","author":"gurevich","year":"1988","journal-title":"Current Trends in Theoretical Computer Science"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785682.pdf?arnumber=8785682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785682","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}