{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T10:10:10Z","timestamp":1746439810530,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644445","type":"print"},{"value":"9789819644452","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-4445-2_9","type":"book-chapter","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:00Z","timestamp":1746437640000},"page":"100-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Twin-width of Outerplanar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0120-2416","authenticated-orcid":false,"given":"Muhammad","family":"Anwarul Azim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7388-1670","authenticated-orcid":false,"given":"Sk Ruhul","family":"Azgor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6381-1308","authenticated-orcid":false,"given":"Sadia","family":"Sharmin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0112-0242","authenticated-orcid":false,"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"2564","DOI":"10.1007\/s00453-020-00697-4","volume":"82","author":"JM Alam","year":"2020","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Queue layouts of planar 3-trees. Algorithmica 82, 2564\u20132585 (2020)","journal-title":"Algorithmica"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Lozzo, G.D., Hlin\u011bn\u00fd, P., Kaufmann, M.: Graph product structure for $$h$$-framed graphs. In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022), pp. 23:1\u201323:15. Leibniz International Proceedings in Informatics (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2022.23","DOI":"10.4230\/LIPIcs.ISAAC.2022.23"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Berg\u00e9, P., Bonnet, \u00c9., D\u00e9pr\u00e9s, H.: Deciding twin-width at most 4 is np-complete. In: 49th International Colloquium on Automata, Languages and Programming (ICALP 2022) (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.18","DOI":"10.4230\/LIPIcs.ICALP.2022.18"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Geniet, C., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width ii: small classes. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1977\u20131996. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.118","DOI":"10.1137\/1.9781611976465.118"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Geniet, C., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width iii: max independent set, min dominating set, and coloring. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.35","DOI":"10.4230\/LIPIcs.ICALP.2021.35"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Kim, E.J., Reinald, A., Thomass\u00e9, S.: Twin-width vi: the lens of contraction sequences. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1036\u20131056. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.45","DOI":"10.1137\/1.9781611977073.45"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3486655","volume":"69","author":"\u00c9 Bonnet","year":"2021","unstructured":"Bonnet, \u00c9., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width i: tractable FO model checking. ACM J. ACM (JACM) 69(1), 1\u201346 (2021). https:\/\/doi.org\/10.1145\/3486655","journal-title":"ACM J. ACM (JACM)"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Kwon, O.J., Wood, D.R., et\u00a0al.: Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond). arXiv preprint arXiv:2202.11858 (2022). https:\/\/doi.org\/10.48550\/arXiv.2202.11858","DOI":"10.48550\/arXiv.2202.11858"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218x(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discret. Appl. Math. 3(3), 163\u2013174 (1981). https:\/\/doi.org\/10.1016\/0166-218x(81)90013-5","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385731","volume":"67","author":"V Dujmovi\u0107","year":"2020","unstructured":"Dujmovi\u0107, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. J. ACM (JACM) 67(4), 1\u201338 (2020)","journal-title":"J. ACM (JACM)"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Hlin\u011bn\u1ef3, P., Jedelsk\u1ef3, J.: Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar. In: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.75","DOI":"10.4230\/LIPIcs.ICALP.2023.75"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Jacob, H., Pilipczuk, M.: Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 287\u2013299. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5","DOI":"10.1007\/978-3-031-15914-5"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Kr\u00e1l\u2019, D., Lamaison, A.: Planar graph with twin-width seven. Eur. J. Comb. 103749 (2023). https:\/\/doi.org\/10.1016\/j.ejc.2023.103749","DOI":"10.1016\/j.ejc.2023.103749"},{"key":"9_CR14","series-title":"Undergraduate Topics in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49475-3","volume-title":"Basic Graph Theory","author":"MS Rahman","year":"2017","unstructured":"Rahman, M.S.: Basic Graph Theory. UTCS, Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49475-3"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. ii. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90023-4","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Schidler, A., Szeider, S.: A sat approach to twin-width. In: 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pp. 67\u201377. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977042.6","DOI":"10.1137\/1.9781611977042.6"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4445-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:01Z","timestamp":1746437641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4445-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644445","9789819644452"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4445-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}