{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:19Z","timestamp":1730280679784,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005107","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:43:24Z","timestamp":1502397804000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["The Weisfeiler-Leman dimension of planar graphs is at most 3"],"prefix":"10.1109","author":[{"given":"Sandra","family":"Kiefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilia","family":"Ponomarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0089374"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2371656.2371662"},{"key":"ref11","article-title":"Tangled up in blue (A survey on connectivity, decompositions, and tangles)","author":"grohe","year":"2016","journal-title":"CoRR abs\/1605 06704"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/9781139028868"},{"key":"ref13","first-page":"70","article-title":"Definability and descriptive complexity on databases of bounded tree-width","author":"grohe","year":"1999","journal-title":"ICDT volume 1540 of Lecture Notes in Computer Science"},{"key":"ref14","first-page":"289","article-title":"Pebble games and linear equations","author":"grohe","year":"2012","journal-title":"CSL Volume 16 of LIPIcs"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(71)90019-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_13"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803896"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.13"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934560"},{"journal-title":"Defining PTIME problems on planar graphs with few variables","year":"2014","author":"redies","key":"ref27"},{"key":"ref3","first-page":"1","article-title":"The graph isomorphism problem (Dagstuhl seminar 15511)","volume":"5","author":"babai","year":"2015","journal-title":"Dagstuhl Reports"},{"key":"ref6","first-page":"203","article-title":"Thomas Thier-auf, and Fabian Wagner. Planar graph isomorphism is in log-space","author":"datta","year":"2009","journal-title":"IEEE Conference on Computational Complexity"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_58"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1998.705639"},{"key":"ref7","article-title":"Separability number and schurity number of coherent configurations","volume":"7","author":"evdokimov","year":"2000","journal-title":"Electr J Comb"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/120867834"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335313"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22177-9_26"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021146226285"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48057-1_25"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933595"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"ref23","first-page":"383","article-title":"Force-directed drawing algorithms","author":"kobourov","year":"2013","journal-title":"Handbook of Graph Drawing and Visualization"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098279"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06686-8_21"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2017,6,20]]},"location":"Reykjavik, Iceland","end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005107.pdf?arnumber=8005107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T21:05:27Z","timestamp":1513199127000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005107","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}