{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:50Z","timestamp":1750306310292,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"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,2]]},"DOI":"10.1145\/2843043.2843055","type":"proceedings-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T20:06:43Z","timestamp":1454357203000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\n            <i>P<\/i>\n            <sub>3<\/sub>\n            -convexity of some classes of graphs with few\n            <i>P<\/i>\n            <sub>4<\/sub>\n            s and permutation graphs"],"prefix":"10.1145","author":[{"given":"Wing-Kai","family":"Hon","sequence":"first","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[]},{"given":"Hsiang-Hsuan","family":"Liu","sequence":"additional","affiliation":[{"name":"National Tsing Hua University, Hsinchu, Taiwan and The University of Liverpool, Liverpool, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2016,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2011.09.018"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/110828678"},{"key":"e_1_3_2_1_3_1","unstructured":"Barash V. The Dynamics of Social Contagion PhD Thesis Cornell University (2011).   Barash V. The Dynamics of Social Contagion PhD Thesis Cornell University (2011)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.005"},{"issue":"5","key":"e_1_3_2_1_5_1","first-page":"175","article-title":"Convex partitions of graphs induced by paths of order three","volume":"12","author":"Centeno C.","year":"2010","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.029"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859014"},{"key":"e_1_3_2_1_8_1","unstructured":"Chang J. T. Kloks and H. Wang Gray codes for AT-free orders via antimatroids. To appear in the proceedings of IWOCA '15.  Chang J. T. Kloks and H. Wang Gray codes for AT-free orders via antimatroids. To appear in the proceedings of IWOCA '15."},{"key":"e_1_3_2_1_9_1","first-page":"57","volume-title":"Springer-Verlag","author":"Chv\u00e1tal V.","year":"2009"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.03.004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2414243"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_23"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.05.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.012"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/48184.48189"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371374"},{"key":"e_1_3_2_1_18_1","first-page":"283","volume-title":"Wiley","author":"Fink J.","year":"1985"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90019-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00016-P"},{"key":"e_1_3_2_1_21_1","unstructured":"Kloks T. and Y. Wang Advances in graph algorithms. Manuscript on viXra: 1409.0165 2014.  Kloks T. and Y. Wang Advances in graph algorithms. Manuscript on viXra: 1409.0165 2014."},{"key":"e_1_3_2_1_22_1","unstructured":"Kyn\u010dl J. B. Lidick\u00fd and T. Vysko\u010dil Irreversible 2-conversion sets in graphs of bounded degree. Manuscript on arXiv: 1412.4188 2014.  Kyn\u010dl J. B. Lidick\u00fd and T. Vysko\u010dil Irreversible 2-conversion sets in graphs of bounded degree. Manuscript on arXiv: 1412.4188 2014."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/0233193021000015587"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8699-2"},{"key":"e_1_3_2_1_25_1","first-page":"263","volume-title":"proceedings Algorithmic Aspects in Information management, LNCS 8546","author":"Penso L.","year":"2014"}],"event":{"name":"ACSW '16: Australasian Computer Science Week","acronym":"ACSW '16","location":"Canberra Australia"},"container-title":["Proceedings of the Australasian Computer Science Week Multiconference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2843043.2843055","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2843043.2843055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:53:48Z","timestamp":1750222428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2843043.2843055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":25,"alternative-id":["10.1145\/2843043.2843055","10.1145\/2843043"],"URL":"https:\/\/doi.org\/10.1145\/2843043.2843055","relation":{},"subject":[],"published":{"date-parts":[[2016,2]]},"assertion":[{"value":"2016-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}